Sequence alignment: Difference between revisions

Revision as of 20:59, 12 May 2021

Revision as of 14:23, 15 May 2021

Line 1:

{{shortShort description|Process in bioinformatics that identifies equivalent sites within molecular sequences}}

{{Use dmy dates|date=April 2017}}

{{More citations needed|date=March 2009}}

Line 39 ⟶ 40:

===CIGAR Format===

Ref. : GTCGTAGAATA <br/>

[[Read (biology)|Read]]: CACGTAG--TACACGTAG—TA <br/>

CIGAR: 2S5M2D2M

where: <br/>

Line 92 ⟶ 93:

==Pairwise alignment==

Pairwise sequence alignment methods are used to find the best-matching piecewise (local or global) alignments of two query sequences. Pairwise alignments can only be used between two sequences at a time, but they are efficient to calculate and are often used for methods that do not require extreme precision (such as searching a database for sequences with high similarity to a query). The three primary methods of producing pairwise alignments are dot-matrix methods, dynamic programming, and word methods;<ref name="mount"/> however, multiple sequence alignment techniques can also align pairs of sequences. Although each method has its individual strengths and weaknesses, all three pairwise methods have difficulty with highly repetitive sequences of low [[information content]] - especially where the number of repetitions differ in the two sequences to be aligned.

===Maximal unique match===

One way of quantifying the utility of a given pairwise alignment is the '[[maximal unique match]]' (MUM), or the longest subsequence that occurs in both query sequences. Longer MUM sequences typically reflect closer relatedness.<ref name="Alignment of whole genomes">{{cite journal |last1=Delcher |first1=A. L. |last2=Kasif |first2=S. |last3=Fleishmann |first3=R.D. |last4=Peterson |first4=J. |last5=White |first5=O. |last6=Salzberg |first6=S.L. |title=Alignment of whole genomes |journal=Nucleic Acids Research |date=1999 |volume=27 |issue=11 |pages=2369-23762369–2376 |doi=10.1093/nar/30.11.2478 |pmid=10325427|doi-access=free }}</ref> in the [[multiple sequence alignment]] of [[genomes]] in [[computational biology]]. Identification of MUMs and other potential anchors, is the first step in larger alignment systems such as [[MUMmer]]. Anchors are the areas between two genomes where they are highly similar. To understand what a MUM is we can break down each word in the acronym. Match implies that the substring occurs in both sequences to be aligned. Unique means that the substring occurs only once in each sequence. Finally, maximal states that the substring is not part of another larger string that fulfills both prior requirements. The idea behind this, is that long sequences that match exactly and occur only once in each genome are almost certainly part of the global alignment.

More precisely:

Line 223 ⟶ 224:

{{Wikiversity|Dot-matrix methods}}

{{Spoken Wikipedia|En-Sequence_alignment.ogg|date=2012-06-05}}

*{{Commons category-inline}}

*{{Commonscatinline}}

{{Bioinformatics}}

{{Strings}}

{{Authority control}}

{{Use dmy dates|date=April 2017}}

[[Category:Bioinformatics algorithms]]