Lower bounds on multiple sequence alignment using exact 3-way alignment

BMC Bioinformatics

Volumn 8, Issue , 2007, Pages

  Colbourn, Charles J ^a,b   Kumar, Sudhir ^a,c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

^c ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT ALGORITHMS; COMPUTATION TIME; COMPUTATIONAL EFFORT; EXPONENTIAL GROWTH; MINIMAL ADDITIONAL EFFORTS; MULTIPLE SEQUENCE ALIGNMENTS; OPTIMAL ALIGNMENTS; RANDOM PACKING;

HEURISTIC ALGORITHMS; OPTIMIZATION;

COSTS;

ACCURACY; ANALYTIC METHOD; ARTICLE; CONTROLLED STUDY; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PREDICTION; QUALITY CONTROL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; TIME; ALGORITHM; CHEMISTRY; DNA SEQUENCE; EVALUATION; GENETICS; METHODOLOGY; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY;

DNA;

ALGORITHMS; BASE SEQUENCE; DNA; MOLECULAR SEQUENCE DATA; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 34250174157     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-8-140     Document Type: Article

References (26)

1. Davidson A A Fast Pruning Algorithm for Optimal Sequence Alignment Proceedings of The 2nd IEEE International Symposium on Bioinformatics and Bioengineering (BIBE'2001) 2001 49-56
2. Gotoh O Significant Improvement in Accuracy of Multiple Protein Sequence Alignments by Iterative Refinement as Assessed by Reference to Structural Alignments J Mol Evol 1996 264 823-838
3. Gusfield D Efficient methods for multiple sequence alignment with guaranteed error bounds Bulletin Mathematical Biology 1993 55 141-154
4. Gusfield D Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Cambridge University Press 1997
5. Huang X Alignment of Three Sequences in Quadratic Space ACM SIGAPP Applied Computing Review 1993 1 7-11
6. Miller W Building multiple alignments from pairwise alignments Bioinformatics 1993 9 169-176
7. Myers EW Miller W Optimal alignments in linear space Comput Appl Biosci 1988 4 11-17 3382986
8. Bonizzoni P Vedova GD The complexity of multiple sequence alignment with SP-score that is a metric Theoretical Computer Science 2001 259 63-79
9. Just W Computational complexity of multiple sequence alignment using SP score J Comput Biol 2001 8 615-623 11747615
10. Wang L Jiang T On the complexity of multiple sequence alignment J Comp Biol 1994 1 337-348
11. Durbin R Eddy S Krogh A Mitchison G Biological Sequence Analysis Cambridge: Cambridge University Press 1998
12. Kumar S Filipski AJ Molecular Phylogeny Reconstruction Oxford University Press 2000
13. Stevens JR Schofield CJ Phylogenetics and sequence analysis - some problems for the unwary Trends in Parasitology 2003 19 582-588 14642769
14. Thompson JD Plewniak F Poch O A comprehensive comparison of multiple sequence alignment programs Nucleic Acids Res 1999 27 2682-2690 148477 10373585
15. Wallace IM Blackshields G Higgins DG Multiple sequence alignments Curr Opin Struct Biol 2005 15 261-266 15963889
16. Feng DF Doolittle RF Progressive sequence alignment as a prerequisite to correct phylogenetic trees J Mol Evol 1987 25 351-360 3118049
17. Kumar S Filipski AJ Multiple Sequence Alignment: In Pursuit of Homologous DNA Positions Genome Res
18. Gupta SK Kececioglu JD Schaffer AA Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment J Comput Biol 1995 2 459-72 8521275
19. Spouge JL Speeding up dynamic programming algorithms for finding optimal latticepaths SIAM J Appl Math 1989 49 1552-1566
20. Colbourn CJ Dinitz J (Eds) CRC Handbook of Combinatorial Designs Boca Raton FL: CRC Press 1996
21. Colbourn CJ Rosa A Triple Systems Oxford: Oxford University Press 1999
22. Holyer I The NP-completeness of some edge-partition problems SIAM J Comput 1981 10 4 713-717
23. Rosenberg MS Multiple sequence alignment accuracy and evolutionary distance estimation BMC Bioinformatics 2005 6 278 1318491 16305750
24. Stinson DR Hill-climbing algorithms for the construction of combinatorial designs Annals Discrete Math 1985 26 321-334
25. Gibbons PB Computational Methods in Design Theory CRC Handbook of Combinatorial Designs Boca Raton FL: CRC Press 1996 718-740
26. Colbourn CJ Mathon R Leave graphs of small maximal partial triple systems J Combin Math Combin Comput 1987 2 13-28