Name
Title | ||
|---|---|---|
Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences. |
Abstract | ||
|---|---|---|
Algorithms of sequence alignment are the key instruments for computer-assisted studies of biopolymers. Obviously, it is important to take into account the "quality" of the obtained alignments, i.e. how closely the algorithms manage to restore the "gold standard" alignment (GS-alignment), which superimposes positions originating from the same position in the common ancestor of the compared sequences. As an approximation of the GS-alignment, a 3D-alignment is commonly used not quite reasonably. Among the currently used algorithms of a pair-wise alignment, the best quality is achieved by using the algorithm of optimal alignment based on affine penalties for deletions (the Smith-Waterman algorithm). Nevertheless, the expedience of using local or global versions of the algorithm has not been studied.Using model series of amino acid sequence pairs, we studied the relative "quality" of results produced by local and global alignments versus (1) the relative length of similar parts of the sequences (their "cores") and their nonhomologous parts, and (2) relative positions of the core regions in the compared sequences. We obtained numerical values of the average quality (measured as accuracy and confidence) of the global alignment method and the local alignment method for evolutionary distances between homologous sequence parts from 30 to 240 PAM and for the core length making from 10% to 70% of the total length of the sequences for all possible positions of homologous sequence parts relative to the centers of the sequences.We revealed criteria allowing to specify conditions of preferred applicability for the local and the global alignment algorithms depending on positions and relative lengths of the cores and nonhomologous parts of the sequences to be aligned. It was demonstrated that when the core part of one sequence was positioned above the core of the other sequence, the global algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the local algorithm. On the contrary, when the cores were positioned asymmetrically, the local algorithm was more stable at longer evolutionary distances and larger nonhomologous parts than the global algorithm. This opens a possibility for creation of a combined method allowing generation of more accurate alignments. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1186/1748-7188-6-25 | Algorithms for molecular biology : AMB |
Keywords | Field | DocType |
bioinformatics,biomedical research,algorithms | Sequence alignment,Affine transformation,Structural alignment,Computer science,Test sequence,Pairwise sequence alignment,Algorithm,Local algorithm,Bioinformatics | Journal |
Volume | Issue | ISSN |
6 | 1 | 1748-7188 |
Citations | PageRank | References |
6 | 0.73 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valery O Polyanovsky | 1 | 6 | 0.73 |
| Mikhail A. Roytberg | 2 | 114 | 54.66 |
| Vladimir G. Tumanyan | 3 | 6 | 0.73 |