Comparison of alignment free string distances for complete genome phylogeny

Advances in Data Analysis and Classification

Volumn 3, Issue 2, 2009, Pages 95-108

  Guyon, Frédéric ^a   Brochier Armanet, Céline ^b   Guénoche, Alain ^c  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b CNRS   (France)

^c AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Complete bacterial genomes; Phylogeny; String distances

Indexed keywords

ALIGNMENT; BACTERIA; BACTERIOLOGY; BIOLOGY; MAXIMUM LIKELIHOOD; RNA; TOPOLOGY;

AVERAGE LENGTH; BACTERIAL GENOMES; BIOLOGICAL DATA; COMPLETE GENOMES; COMPRESSION ALGORITHMS; GENE IDENTIFICATION; GENOMIC SEQUENCE; HORIZONTAL TRANSFER; LINEAR TIME; NEIGHBOR JOINING; PRELIMINARY PROCESSING; RANDOM TREE; SEQUENCE ALIGNMENTS; SIMULATION PROCESS; SUB-STRINGS; TOPOLOGICAL CRITERIA;

GENES;

EID: 76149086150     PISSN: 18625347     EISSN: 18625355     Source Type: Journal    
DOI: 10.1007/s11634-009-0041-z     Document Type: Article

References (19)

1. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) Basic local alignment search tool. J Mol Biol 215: 403-410.
2. Amir A, Keselman D (1997) Maximum agreement subtree in a set of evolutionary trees: metric and efficient algorithms. SIAM J Comput 26: 1656-1669.
3. Deschavanne PJ, Giron A (1999) Genomic signature: characterization and classification of species assessed by chaos game representation of sequences. Mol Biol Evol 16(10): 1391-1399.
4. Edgar RC (2004) MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics 5: 113.
5. Estabrook GF, McMorris FR, Meacham CA (1985) Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst Zool 34: 193-200.
6. Guindon S, Gascuel O (2003) A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst Biol 52: 696-704.
7. Guyon F, Guénoche A (2009) An evolutionary distance based on maximal unique matches. Commun Stat (in press).
8. Hao BI, Qi J, Wang B (2003) Prokaryotic phylogeny based on complete genomes without sequence alignment. Modern Phys Lett B 17(2): 1-4.
9. Henz SR, Huson DH, Auch AF, Nieselt-Struwe K, Schuster SC (2005) Whole-genome prokaryotic phylogeny. Bioinformatics 15; 21(10): 2329-2335.
10. Jeffrey HJ (1990) Chaos game representation of gene structure. Nucleic Acids Res 18(8): 2163-2170.
11. Karlin S, Taylor H (1981) A second course in stochastic processes. Academic Press, New York.
12. Kimura M (1980) A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J Mol Evol 16: 111-120.
13. Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, Salzberg SL (2004) Versatile and open software for comparing large genomes. Genome Biol 5: R12.
14. Otu HH, Sayood K (2003) A new sequence distance measure for phylogenetic tree construction. Bioinformatics 19(16): 2122-2130.
15. Robinson DF, Foulds LR (1981) Comparison of phylogenetic trees. Math Biosci 53: 131-147.
16. Saitou N, Nei M (1987) The Neighbor-Joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 4: 406-425.
17. Snel B, Huynen MA, Dutilh BE (2005) Genome trees and the nature of genome evolution. Annu Rev Microbiol 59: 191-209.
18. Ulitsky I, Burnstein D, Tuller T, Chor B (2006) The average common substring approach to phylogenomic reconstruction. J Comput Biol 13: 336-350.
19. Ziv J, Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans Inform Theory 23: 337-343.