A theoretical model for whole genome alignment

Journal of Computational Biology

Volumn 18, Issue 5, 2011, Pages 705-728

  Belal, Nahla A ^a   Heath, Lenwood S ^b  

^a Egypt Mansoura University   (Egypt)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

algorithms; combinatorics; probability; sequences

Indexed keywords

ALGORITHM; ARTICLE; DNA SEQUENCE; GENOME; MATHEMATICS; METHODOLOGY; MOLECULAR EVOLUTION; NUCLEOTIDE SEQUENCE; THEORETICAL MODEL;

ALGORITHMS; BASE SEQUENCE; EVOLUTION, MOLECULAR; GENOME; MATHEMATICS; MODELS, THEORETICAL; SEQUENCE ANALYSIS, DNA;

EID: 79955809167     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0101     Document Type: Article

References (38)

1. Abouelhoda, M., Kurtz, S., and Ohlebusch, E. 2008. CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9, 476.
2. Altschul, S.F., Gish, W., Miller, W., et al. 1990. Basic local alignment search tool. Mol. Biol. 215, 403-410.
3. Blanchette, M. 2007. Computation and analysis of genomic multi-sequence alignments. Annu. Rev. Genomics Hum. Genet. 8, 193-213.
4. Blanchette, M., Kent, W.J., Riemer, C., et al. 2004. Aligning multiple genomic sequences with the Threaded Blockset Aligner. Genome Res. 14, 708-715. (Pubitemid 38500244)
5. Bray, N., Dubchak, I., and Pachter, L. 2003. AVID: a global alignment program. Genome Res. 13, 97-102.
6. Bray, N., and Pachter, L. 2004. MAVID: constrained ancestral alignment of multiple sequences. Genome Res. 14, 693-699. (Pubitemid 38500242)
7. Brudno, M., Chapman, M., Gottgens, B., et al. 2003. Fast and sensitive multiple alignment of large genomic sequences. BMC Bioinform. 4, 66.
8. Brundo, M., Malde, S., Poliakov, A., et al. 2003. Glocal alignment: finding rearrangements during alignment. Bioinformatics 19, Suppl. 1, i54-i62. (Pubitemid 41185599)
9. Darling, A.C., Mau, B., Blattner, F.R., et al. 2004. MAUVE: multiple alignment of conserved genomic sequence with rearrangements. Genome Res. 14, 1394-1403. (Pubitemid 39029237)
10. Delcher, A., Kasif, S., Fleischmann, R., et al. 1999. Alignment of whole genomes. Nucleic Acids Res. 27, 2369-2376. (Pubitemid 29245657)
11. Dubchak, I., Poliakov, A., Kislyuk, A., et al. 2009. Multiple whole-genome alignments without a reference organism. Genome Res. 19, 682-689.
12. Durbin, R., Eddy, S., Krogh, A., et al. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, United Kingdom.
13. Ergun, F., Muthukrishnan, S., and Sahinalp, S.C. 2003. Comparing sequences with segment rearrangements. Lect. Notes Comput. Sci. 2914, 183-194.
14. Garey, M.R., and Johnson, D.S. 1979. Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco.
15. Joseph, J., and Sasikumar, R. 2006. Chaos game representation for comparison of whole genomes. BMC Bioinform. 7, 243.
16. Junier, T., and Pagni, M. 2000. Dotlet: diagonal plots in a web browser. Bioinformatics 16, 178-179. (Pubitemid 30248596)
17. Kurtz, S., Phillippy, A., Delcher, A.L., et al. 2004. Versatile and open software for comparing large genomes. Genome Biol. 5, R12.
18. Lu, G., Jiang, L., Helikar, R.M., et al. 2006. GenomeBlast: a web tool for small genome comparison. BMC Bioinform. 7, S18.
19. Ma, J., Ratan, A., Raney, B.J., et al. 2008. The infinite sites model of genome evolution. Proc. Nat. Acad. Sci. USA 105, 14254-14261.
20. Morgenstern, B., Werner, N., Prohaska, S.J., et al. 2005. Multiple sequence alignment with user-defined constraints at GOBICS. Bioinformatics 21, 1271-1273. (Pubitemid 40467957)
21. Needleman, S.B., and Wunsch, C.D. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Mol. Biol. 48, 443-453.
22. Otu, H.H., and Sayood, K. 2003. A new sequence distance measure for phylogenetic tree construction. Bioinformatics 19, 2122-2130. (Pubitemid 37408164)
23. Paten, B., Herrero, J., Fitzgerald, K.B.S., et al. 2008. Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs. Genome Res. 18, 1814-1828.
24. Pei, J., and Grishin, N. 2006. MUMMALS: multiple sequence alignment improved by using hidden Markov models with local structural information. Nucleic Acids Res. 34, 4364-4374. (Pubitemid 44567036)
25. Phuong, T.M., Do, C.B., Edgar, R.C., et al. 2006. Multiple alignment of protein sequences with repeats and rearrangements. Nucleic Acids Res. 34, 5932-5942. (Pubitemid 44941172)
26. Pohler, D., Werner, N., Steinkamp, R., et al. 2005. Multiple alignment of genomic sequences using CHAOS, DIALIGN and ABC. Nucleic Acids Res. 33, W532-W534. (Pubitemid 44529977)
27. Raphael, B., Zhi, D., Tang, H., et al. 2004. A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Res. 14, 2336-2346. (Pubitemid 39517341)
28. Schwartz, S., Kent, W.J., Smit, A., et al. 2003. Human-mouse alignments with BLASTZ. Genome Res. 13, 103-107.
29. Shapiro, L., and Stephens, A.B. 1991. Bootstrap percolation, the Schröder numbers, and the N-kings problem. SIAM J. Discr. Math. 4, 275-280.
30. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. Mol. Biol. 147, 195-197.
31. Szklarczyk, R., and Heringa, J. 2006. AuberGenena sensitive genome alignment tool. Bioinformatics 22, 1431-1436. (Pubitemid 43985312)
32. Thompson, J.D., Higgins, D.G., and Gibson, T.J. 1994. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 22, 4673-4680. (Pubitemid 24354800)
33. Varre, J.-S., Delahaye, J.-P., and Rivals, E. 1999. Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics 15, 194-202. (Pubitemid 29196996)
34. Wallace, I., Sullivan, O., Higgins, D., et al. 2006. M-Coffee: combining multiple sequence alignment methods with T-Coffee. Nucleic Acids Res. 34, 1692-1699.
35. Weisstein, E.W. 2003. CRC Concise Encyclopedia of Mathematics, 2nd ed. CRC Press, Boca Raton, FL.
36. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346. (Pubitemid 41222437)
37. Ye, L., and Huang, X. 2005. MAP2: multiple alignment of syntenic genomic sequences. Nucleic Acids Res. 33, 162-170. (Pubitemid 40276938)
38. Zhang, Y., and Waterman, M.S. 2005. An Eulerian path approach to local multiple alignment for DNA sequences. Proc. Nat. Acad. Sci. USA 102, 1285-1290. (Pubitemid 40209162)