Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method

International Journal of Bioinformatics Research and Applications

Volumn 2, Issue 3, 2006, Pages 219-248

  Wu, Xiaomeng ^a   Wan, Xiu Feng ^b   Wu, Gang ^a   Xu, Dong ^c   Lin, Guohui ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b MIAMI UNIVERSITY   (United States)

^c University of Missouri   (United States)

Author keywords

Composition Vector (CV); Neighbour Joining, clustering; Whole genome phylogeny

Indexed keywords

ARTICLE; CONTROLLED STUDY; EVOLUTION; GENE SEQUENCE; GENOME; MEDICAL INFORMATION; MITOCHONDRION; NEIGHBOR JOINING METHOD; NONHUMAN; NUCLEOTIDE SEQUENCE; PHYLOGENETIC TREE CONSTRUCTION METHOD; PHYLOGENY; TAXONOMY; UNINDEXED SEQUENCE;

EID: 33748796945     PISSN: 17445458     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2006.010602     Document Type: Article

References (30)

1. Benedetto, D., Caglioti, E. and Loreto, V. (2002) Language trees and zipping, Physical Review Letters, Vol. 88, p.048702.
2. Brendel, V., Beckmann, J.S. and Trifonov, E.N. (1986) Linguistics of nucleotide sequences: Morphology and comparison of vocabularies, Biomolecular Structure and Dynamics, Vol. 4, 11-21.
3. Brochier, C., Bapteste, E., Moreira, D. and Philippe, H. (2002) Eubacterial phylogeny based on translationl apparatus proteins Trends in Genetics, 1-5.
4. Chen, X., Kwong, S. and Li, M. (2000) A compression algorithm for DNA sequences and its applications in genome comparison Proceedings of the Sixth Annual International Computing and Combinatories Conference (RECOMB), ACM Press, August 8-11, Tokyo, Japan, 107-117.
5. Doolittle, W.F. (1999) Phylogenetic classification and the universal tree, Science, Vol. 284, 2124-2128.
6. Erdos, P., Steel, M., Szekely, L. and Warnow, T. (1999) A few logs suffice to build (almost) all trees (Part 1), Random Structures and Algorithms, Vol. 14, 153-184.
7. Gentles, A.J. and Karlin, S. (2001) Genome-scale compositional comparisons in Eukaryotes, Genome Research, Vol. 11, pp.540-546.
8. Grumbach, S. and Tahi, F. (1994) A new challenge for compression algorithms: genetic sequences, Journal of Information Processing Management, Vol. 30, pp.875-866.
9. Hao, B. (2000) Fractals from genomes - exact solutions of a biology-inspired problem Physica, A282, pp.225-246.
10. Hao, B. and Qi, J. (2003) Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance, Proceedings of the 2003 IEEE Bioinformatics Conference (CSB 2003), August 11-14, Stanford, CA, USA, 375-385.
11. Herniou, E., Luque, T., Chen, X., Vlak, J., Winstanley, D., Cory, J. and O'Reilly, D. (2001) Use of whole genome sequence data to infer baculovirus phylogeny Journal of Virology, Vol. 75, pp.8117-8126.
12. House, C. and Fitz-Gibbon, S. (2002)Using homolog groups to create a whole-genomic tree of free-living organisms: an update Molecular Evolution, Vol. 54, pp.539-547.
13. Lempel, A. and Ziv, J. (1978) Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, Vol. 24, pp.530-536.
14. Li, M., Badger, J.H., Chen, X., Kwong, S., Kearney, P. and Zhang, H. (2001) An information-based sequence distance and its application to whole mitochondrial genome phylogeny, Bioinformatics, Vol. 17, pp.149-154.
15. Li, W., Fang, W., Ling, L., Wang, J., Xuan, Z. and Chen, R. (2002) Phylogeny based on whole genome as inferred from complete information set analysis Journal of Biological Physics, Vol. 28, pp.439-447.
16. Milosavljevic, A. (1993) Discovering sequence similarity by the algorithmic significance Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology (ISMB), July, Bethesda, MD, USA, pp.284-291.
17. Qi, J., Wang, B. and Hao, B. (2004) Whole proteome prokaryote phylogeny without sequence alignment: a k-string composition approach Journal of Molecular Evolution, Vol. 58, 1-11.
18. Rehder, B., Schriener, M.E., Wolfe, M.B.W., Laham, D., Landause, T.K. and Kintsch, W. (1998) Using latent semantic analysis to assess knowledge: some technical considerations Discourse Process, Vol. 25, 337-354.
19. Rivals, E., Dauchet, M., Delahaye, J. and Delgrange, O. (1996) Compression and genetic sequences analysis Biochimie, Vol. 78, pp.315-322.
20. Saitou, N. and Nei, M. (1987) The neighbour-joining method: a new method for reconstructing phylogenetic trees Molecular Biology and Evolution, Vol. 4, pp.406-425.
21. Snel, B., Bork, P. and Huynen, M.A. (1999) Genome phytogeny based on gene content National Genetics, Vol. 21, pp.108-110.
22. Snel, B., Bork, P. and Huynen, M.A. (2000) Genome evolution: gene fusion versus gene fission Trends in Genetics, Vol. 16, pp.9-11.
23. Snel, B., Bork, P. and Huynen, M.A. (2002) Genomes in flux: the evolution of archaeal and proteobacterial gene content Genome Research, Vol. 12, pp.17-25.
24. Stuart, G. and Berry, M. (2003) A comprehensive whole genome bacterial phylogeny using correlated peptide motifs defined in a high dimensional vector space Journal of Bioinformatics and Computational Biology, Vol. 1, pp.475-493.
25. Stuart, G., Moffet, K. and Baker, S. (2002a) Integrated gene and species phylogenies from unaligned whole genome sequence Bioinformatics, Vol. 18, pp. 100-108.
26. Stuart, G., Moffet, K. and Leader, J. (2002b) A comprehensive vertebrate phylogeny using vector representation of protein sequences from whole genomes Molecular Biology and Evolution, Vol. 19, pp.554-562.
27. Stuart, G., Moffett, K. and Bozarth, R.F. (2004) A whole genome perspective on the phylogeny of the plant virus family tombusviridae Archieves of Virology, Vol. 149, pp.1595-1610.
28. Wheeler, D.L., Chappey, C., Lash, A.E., Leipe, D.D., Madden, T.L., Schuler, G.D., Tatusova, T.A. and Rapp, B.A. (2000) Database resources of the national center for biotechnology information Nucleic Acids Research, Vol. 28, pp.10-14.
29. Wu, X., Wan, X-F., Xu, D. and Lin, G-H. (2005) Whole genome phylogeny based on clustered signature string composition Posters in 2005 IEEE Computational Systems Bioinformatics Conference (CSB 2005), Stanford University, California, August 8-11, 53-54.
30. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression IEEE Transactions on Information Theory, Vol. 23, pp.337-343.