Sequence alignment, mutual information, and dissimilarity measures for constructing phylogenies

PLoS ONE

Volumn 6, Issue 1, 2011, Pages

  Penner, Orion ^a   Grassberger, Peter ^a   Paczuski, Maya ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MITOCHONDRIAL DNA;

ALGORITHM; ARTICLE; BIOINFORMATICS; COMPUTER PROGRAM; CONTROLLED STUDY; INFORMATION SCIENCE; INTERMETHOD COMPARISON; PHYLOGENY; SEQUENCE ALIGNMENT; BIOLOGY; COMPARATIVE STUDY; METHODOLOGY; STANDARD; TECHNIQUE;

ANIMALIA;

ALGORITHMS; COMPUTATIONAL BIOLOGY; INFORMATION THEORY; METHODS; PHYLOGENY; SEQUENCE ALIGNMENT;

EID: 79251587451     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0014373     Document Type: Article

References (38)

1. Aluru S, ed (2006) Handbook of computational molecular biology. Boca Raton: Chapman & Hall/CRC.
2. Brudno M, Malde S, Poliakov A, Do C, Couronne O, et al. (2003) Glocal alignment: finding rearrangements during alignment. Bioinformatics 19: 54-62.
3. Altschul S, Gish W, Miller W, Myers E, Lipman D (1990) Basic local alignment search tool. Journal of molecular biology 215: 403-410.
4. Altschul S, Madden T, Schaffer A, Zhang J, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic acids research 25: 3389.
5. McGinnis S, Madden T (2004) BLAST: at the core of a powerful and diverse set of sequence analysis tools. Nucleic Acids Research 32: W20.
6. Durbin R, Eddy S, Krogh A, Mitchison G (1998) Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press Cambridge.
7. Nei M, Kumar S (2000) Molecular evolution and phylogenetics. USA: Oxford University Press.
8. Buneman P (1974) A note on metric properties of trees. Journal of Combinatorial Theory, Ser B 17: 48-50.
9. Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular biology and evolution 4: 406.
10. Lake J (1994) Reconstructing evolutionary trees from DNA and protein sequences: paralinear distances. Proceedings of the National Academy of Sciences of the United States of America 91: 1455.
11. Lockhart P, Steel M, Hendy M, Penny D (1994) Recovering evolutionary trees under a more realistic model of sequence evolution. Molecular biology and evolution 11: 605.
12. Cover T, Thomas J (2006) Elements of information theory John Wiley & Sons.
13. Milosavljević A (1995) Discovering dependencies via algorithmic mutual information: A case study in dna sequence comparisons. Machine Learning 21: 35-50.
14. Viola P, Wells III W (1997) Alignment by maximization of mutual information. International journal of computer vision 24: 137-154.
15. Allison L, Powell D, Dix T (1999) Compression and approximate matching. Computer Journal 42: 1-10.
16. Varre J, Delahaye J, Rivals E (1999) Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics 15: 194-202.
17. Mahoney M (2008) http://cs.fit.edu/ mmahoney/compression/text.html
18. Chen X, et al. (2003) http://monod.uwaterloo.ca/downloads/gencompress.
19. Cao M, Dix T, Allison L, Mears C (2007) A Simple Statistical Algorithm for Biological Sequence Compression. In: 2007 Data Compression Conference IEEE Computer Society. pp 43-52.
20. Cilibrasi R, Vitanyi P (2005) Clustering by compression. IEEE Transactions on Information Theory 51: 1523-1545.
21. Navarro G (2001) A guided tour to approximate string matching. ACM computing surveys (CSUR) 33: 88.
22. Press W, Teukolsky S, Vetterling W, Flannery B (2007) Numerical recipes: the art of scientific computing Cambridge University Press.
23. Li M, Badger J, Chen X, Kwong S, Kearney P, et al. (2001) An informationbased sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 17: 149-154.
24. Li M, Chen X, Li X, Ma B, Vitanyi P (2004) The similarity metric. IEEE Transactions on Information Theory 50: 3250-3264.
25. Kraskov A, Stögbauer H, Andrzejak R, Grassberger P (2003) Hierarchical clustering based on mutual information. Arxiv preprint q-bio/0311039.
26. Felsenstein J (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal of molecular evolution 17: 368-376.
27. Bray N, Pachter L (2003) MAVID multiple alignment server. Nucleic Acids Research 31: 3525-3526.
28. Lassmann T, Sonnhammer E (2005) Kalign - an accurate and fast multiple sequence alignment algorithm. BMC Bioinformatics 6: 298.
29. Bray N, Pachter L (2004) http://bio.math.berkeley.edu/mavid/download.
30. EMBL-EBI (2006) http://msa.sbc.su.se/cgi-bin/msa.cgi.
31. Emboss (1999) http://bioweb2.pasteur.fr/docs/EMBOSS/stretcher.html.
32. Brudno M, Do C, Cooper G, Kim M, Davydov E, et al. (2003) LAGAN and Multi-LAGAN: Efficient Tools for Large-Scale Multiple Alignment of Genomic DNA. Genome Research 13: 721-731.
33. Thompson J, Higgins D, Gibson T (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.
34. NCBI (2008) http://www.ncbi.nlm.nih.gov/sites/entrez?db =genome.
35. Steel M, Lockhart P, Penny D (1993) Confidence in evolutionary trees from biological sequence data. Nature 364: 440-442.
36. Vinga S, Almeida J (2003) Alignment-free sequence comparison-a review. Bioinformatics 19: 513.
37. Rissanen J (1978) Modeling by shortest data description. Automatica 14: 465-471.
38. Rissanen J (1986) Stochastic complexity and statistical inference Analysis and Optimization of Systems. pp 391-407.