Minimum contradiction matrices in whole genome phylogenies

Evolutionary Bioinformatics

Volumn 2008, Issue 4, 2008, Pages 237-247

  Thuillard, Marc ^a  

^a Belimo Automation AG   (Switzerland)

Author keywords

Minimum contradiction; Phylogenetic trees; Split network; Whole genome phylogeny

Indexed keywords

ARCHAEBACTERIUM; ARTICLE; BACTERIAL GENETICS; BACTERIAL GENOME; EUKARYOTE; GENETIC ALGORITHM; MOLECULAR EVOLUTION; NONHUMAN; PHYLOGENY; STATISTICAL ANALYSIS;

EUKARYOTA;

EID: 53749083324     PISSN: None     EISSN: 11769343     Source Type: Journal    
DOI: None     Document Type: Article

References (44)

1. Atteson, K. 1999. The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction. Algorithmica, 25:251-78.
2. Barthélemy, J.P. and Guénoche, A. 1991. Trees and proximity representations. New York: Wiley.
3. Bandelt, H.J. and Dress, A. 1992. Split decomposition: a new and useful approach to phylogenetic analysis of distance data. Molecular Phylogenetic Evolution, 1:242-52.
4. Bertrand, P. and Diday, E. 1985. A visual representation of the compatibility between an order and a dissimilarity index: the pyramids. Computational Statistics Quarterly, 2:31-44.
5. Bryant, D. and Moulton, V. 2004. Neighbor-Net: an agglomerative method for the construction of phylogenetic networks. Molecular Biology and Evolution, 21:255-65.
6. Buneman, P. 1971. The recovery of trees from measures of dissimilarity. In: Hodson F.R. Kendall, DG. and Tauta P, (eds). Mathematics in the Archaeological and Historical Sciences. Edinburgh: Edinburgh University Press, 387-95.
7. Christopher, G.E., Farach, M. and Trick, M.A. 1996. The structure of circular decomposable metrics. In European Symposium on Algorithms (ESA)'96, Lectures Notes in Computer Science, 1136:455-500.
8. Clarke, G.D.P., Beiko, R., Ragan, M.A. and Charlebois, R.L. 2002. Inferring genome trees by using a filter to eliminate phylogenetically discordant sequeneces and a distance matrix based on mean normalized BlastP scores. Journal of Bacteriology, 184:2072-80.
9. Delsuc, F., Brinkmann, H. and Philippe, H. 2005. Phylogenomics and the reconstruction of the tree of life. Nature Reviews Genetics, 6:361-76.
10. Deineko, V., Rudolf, R. and Woeginger, G. 1995. Sometimes traveling is easy: the master tour problem, Institute of Mathematics, SIAM. Journal on Discrete Mathematics, 11:81-93.
11. Dress, A. and Huson, D. 2004. Constructing split graphs. IEEE Transactions on Computational Biology and Bioinformatics, 1:109-15.
12. Dutilh, B.E., Noort, V., Heijden, R.T.J.M., Boekhout, T., Snel, B. and Huynen, M.A. 2007. Assessment of phylogenomic and orthology approaches for phylogenetic inference. Bioinformatics, 23:815-24.
13. Fitz-Gibbon, S.T. and House, C.H. 1999. Whole genome-based phylogenetic analysis of free-living microorganisms. Nucleic Acids Research, 27:4718-222.
14. Fukami-Kobayashi, K., Minezaki, Y., Tateno, Y. and Nishikawa, K. 2007. A tree of life based on protein domain organizations. Molecular Biology and Evolution, 24:1181-9.
15. Galperin, M.Y. and Kolker, E. 2006. New metrics for comparative genomics. Current Opinion in Biotechnology, 17:440-7.
16. Gascuel, O. and Steel, M. 2006. Neighbor-joining revealed. Molecular Biology and Evolution, 23:1997-2000.
17. Grünewald, S., Forslund, K., Dress, A. and Moulton, V. 2006. QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. Molecular Biology and Evolution, 24:532-8.
18. Henz, S.R., Huson, D.H., Auch, A.F., Nieselt-Struwe, K. and Schuster, S.C. 2005. Whole-genome prokaryotic phylogeny. Bioinformatics, 21:2329-33.
19. Huson, D. 1998. Splitstree- a program for analyzing and visualizing evolutionary data. Bioinformatics, 14:68-73.
20. Kalmanson, K. 1975. Edgeconvex circuits and the traveling salesman problem. Canadian Journal of Mathematics, 27:1000-10.
21. Karlin, S. and Altschul, S.F. 1990. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proceedings National Academy of Sciences U.S.A., 87:2264-8.
22. Korbel, J.O., Snel, B., Huynen, M.A. and Bork, P. 2002. SHOT: a web server for the construction of genome phylogenies. Trends Genetics, 18:158-62.
23. Korostensky, C. and Gonnet, G.H. 2000. Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics, 16:619-27.
24. Kraskov, A., Stögbauer, H., Andrezejak, R.G. and Grassberger, P. 2005. Hierarchical clustering using mutual information. Europhysics Letter, 70:278-94.
25. Kunin, V., Goldovsky, L., Darzentas, N. and Ouzounis, C.A. 2005a. The net of life: reconstructing the microbial phylogenetic network. Genome Research, 15:954-9.
26. Kunin, V., Ahren, D., Goldovsky, L., Janssen, P. and Ouzounis, C.A. 2005b. Measuring genome conservation across taxa: divided strains and united kingdoms. Nucleic Acids Research, 33(2):616-21. http://cgg.ebi.ac.uk/cgi-bin/gps/GPS.pl
27. Lin, J. and Gerstein, M. 2007. Whole-genome trees based on the occurence of folds and ordiologs: implications for comparing genomes on different levels, Genome Research. 2000:808-18.
28. Makarenkov, V. and Leclerc, B. 1997. Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees. In: Mirkin B., Morris FR., Roberts F, Rzhetsky A, (eds). Mathematical hierarchies and Biology, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence: Amer. Math. Soc., 183-208.
29. Makarenkov, V. and Leclerc, B. 2000. Comparison of additive trees using circular orders. J. Computational Biol., 5:731-44.
30. Makarenkov, V., Kevorkov, D. and Legendre, P. 2006. Phylogenetic network construction approaches. Applied Mycology and Biotechnology, International Elsevier Series, vol. 6. Bioinformatics, 61-97.
31. Mihaescu, R., Levy, D. and Pachter, L. 2006. Why neighbourjoining works. arXiv cs.DS/0602041, Accessed 20 Mai 2007, http://arxiv.org/PS_cache/ cs/pdf/0602/0602041v3.pdf
32. Nakhleh, L., Warnow, T. and Linder, C.R. 2004. Reconstructing Reticulate Evolution in Species- Theory and Practice. Recomb'04 March 27-31 2004, San Diego: ACM337-46.
33. Pauplin, Y. 2000. Direct calculation of a tree length using a distance matrix. J. Mol. Biol., 51:41-7.
34. Robinson, W. 1951. A method for chronologically ordering archaeological deposits. American Antiquity, 16:293-301.
35. Saitou, N. and Nei, M. 1987. The neighbour-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406-25.
36. Snel, B., Bork, P. and Huynen, M.A. 1999. Genome phylogeny based on gene content. Nature Genetics, 21:108-10.
37. Thuillard, M. 2001. Wavelets in Soft Computing. Singapore: World Scientific.
38. Thuillard, M. 2004. Adaptive multiresolution search: how to beat brute force? International Journal Approximate Reasoning, 35(3):223-38.
39. Thuillard, M. 2007. Minimizing contradictions on circular order of phylogenic trees. Evolutionary Bioinformatics, 3:267-77.
40. Timmis, J.N., Ayliffe, M.A., Huang, C.Y. and Martin, W. 2004. Endosymbiotic gene transfer: organelle genomes forge eukaryotic chromosomes. Nature Reviews Genetics, 5:123-35.
41. Wang, L.S., Warnow, T., Moret, BME., Jansen, R.K. and Raubeson, L.A. 2006. Distance-based Genome Rearrangement Phylogeny, Journal of Molecular Evolution, 63:473-83.
42. Wolf, Y.I., Rogozin, I.B., Grishin, N.V. and Koonin, E.V. 2002. Genome trees and the tree of life. Trends Genetics, 18:472-9.
43. Yang, S., Doolittle, R.F. and Bourne, P.E. 2005. Phylogeny determined protein domain content. Proceedings National. Academy of Sciences U.S.A., 102:373-8.
44. Yushmanov, S.V. 1984. Construction of a tree with p leaves from 2p-3 elements of its distance matrix (Russian). Matematicheskie Zametki, 35:877-87.