Phylogeny inference based on spectral graph clustering

Journal of Computational Biology

Volumn 18, Issue 4, 2011, Pages 627-637

  Zhang, Shu Bo ^a   Zhou, Song Yu ^b   He, Jian Guo ^b   Lai, Jian Huang ^c  

^a Guangdong University of Technology   (China)

^b Attardi Institute of Mitochondrial Biomedicine   (China)

^c SUN YAT SEN UNIVERSITY   (China)

Author keywords

distance matrix; generalized eigenvalue system; maximum cut criterion; phylogeny inference; spectral graph clustering

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CLUSTER ANALYSIS; HUMAN; METHODOLOGY; PHYLOGENY;

ALGORITHMS; ANIMALS; CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; HUMANS; MODELS, GENETIC; PHYLOGENY;

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

References (53)

1. Andersson, G. 2000. Some new randomized approximation algorithms [Ph.D. disseration]. Department of Numerical
2. Analysis and Computer Science, Royal Institute of Technology, Stockholm. Bansal, V., and Bafna, V. 2008. HapCUT: an efficient and accurate algorithm for the haplotype assembly problem. Bioinformatics 24, i153-i159.
3. Birin, H., Gal-Or, Z., Elias, I., et al. 2008. Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion. Bioinformatics 24, 826-832. (Pubitemid 351386921)
4. Camin, J., and Sokal, R. 1965. A method for deducing branching sequences in phylogeny. Evolution 19,311-326.
5. Chor, B., and Tuller, T. 2005. Maximum likelihood of evolutionary trees: hardness and approximation. Bioinformatics 21,97-106.
6. Chung, F.R. 1997. Spectral Graph Theory. American Mathematical Society, Providence, RI.
7. Criscuolo, A., and Gascuel, O. 2008. Fast NJ-like algorithms to deal with incomplete distance matrices. BMC Bioinformatics 9, 166.
8. Delorme, C., and Poljak, S. 1993. Laplacian eigenvalues and the maximum cut problem. Math. Programm. 62, 557-574.
9. Evans, J., Sheneman, L., and Foster, J. 2006. Relaxed neighbor joining: a fast distance-based phylogenetic tree construction method. J. Mol. Evol. 62, 785-792. (Pubitemid 43847228)
10. Felsenstein, J. 1981. Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol. 17, 368-376. (Pubitemid 11016207)
11. Feng, X., Buell, D.A., Rose, J.R., et al. 2003. Parallel algorithms for Bayesian phylogenetic inference. J. Parallel Distr. Com. 63, 707-718. (Pubitemid 37268361)
12. Fieder, M. 1973. Algebraic connectivity of graphs. Czech. Math. J. 22, 298-305.
13. Foulds, L.R., and Graham, R.L. 1982. The steiner tree problem in phylogeny is np-complete. Adv. Appl. Math. 3, 4-49.
14. Garey, M.R., and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
15. Gascuel, O. 1997. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14, 685-695. (Pubitemid 27287289)
16. Goemans, M.X., and Williamson, D.P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1145.
17. Golub, G.H., and Van Loan, C.F. 1989. Matrix Computations. Johns Hopkins Press, Baltimore.
18. Goodman, D., Ollikainen, N., and Sholley, C. 2007. Baculovirus phylogeny based on genome rearrangements. Lect. Notes Comput. Sci. 4751, 69-82.
19. Grünewald, S., Forslund, K., Dress, A.W., et al. 2007. QNet: An agglomerative method for the construction of phylogenetic networks from weighted quartets. Mol. Biol. Evol. 24, 532-538. (Pubitemid 46204385)
20. Hein, J. 1990. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185-200. (Pubitemid 20171457)
21. Hein, J. 1993. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396-405. (Pubitemid 23121907)
22. Herniou, E.A., and Jehle, J.A. 2007. Baculovirus phylogeny and evolution. Curr. Drug Targets 8, 1043-1050. (Pubitemid 47578132)
23. Herniou, E.A., Luque, T., Chen, X., et al. 2001. Use of whole genome sequence data to infer baculovirus phylogeny. J. Virol. 75, 8117-8126. (Pubitemid 32743684)
24. Herniou, E.A., Olszewski, J.A., Cory, J.S., et al. 2003. The genome sequence and evolution of baculoviruses. Annu. Rev. Entomol. 48, 211-234. (Pubitemid 37365392)
25. Holder, M., and Lewis, P. 2003. Phylogeny estimation: traditional and Bayesian approaches. Nat. Rev. Genet. 4, 275-284. (Pubitemid 36389532)
26. Howe, K., Bateman, A., and Durbin, R. 2002. QuickTree: building huge neighbor-joining trees of protein sequences. Bioinformatics 18, 1546-1547. (Pubitemid 35422615)
27. Huelsenbeck, J.P., and Ronquist, F. 2001. MRBAYES: Bayesian inference of phylogenetic trees. Bioinformatics 17, 754-755. (Pubitemid 32851390)
28. Jehle, J.A., Lange, M., Wang, H.L., et al. 2006. Molecular identification and phylogenetic analysis of baculoviruses from Lepidoptera virology. Virology 346, 180-193. (Pubitemid 43254709)
29. Jin, G., Nakhleh, L., Snir, S., et al. 2006. Maximum likelihood of phylogenetic networks. Bioinformatics 22, 2604-2611. (Pubitemid 44642598)
30. Keane, T.M., Naughton, T.J., Travers, S.A., et al. 2005. DPRml: distributed phylogeny reconstruction by maximum likelihood. Bioinformatics 21, 969-974. (Pubitemid 40467917)
31. Kidd, K.K., and Sgaramella-Zonta, L.A. 1971. Phylogenetic analysis: concepts and methods. Am. J. Hum. Genet. 23, 235-252.
32. Kumar, S. 1996. A stepwise algorithm for finding minimum evolution trees. Mol. Biol. Evol. 13, 584-593. (Pubitemid 26094319)
33. Kumar, S., and Gadagkar, S.R. 2000. Efficiency of the neighbor-joining method in reconstructing deep and shallow evolutionary relationship in large phylogenies. J. Mol. Evol. 51, 544-553. (Pubitemid 32001973)
34. Lange, M., Wang, H.L., Zhihong, H., et al. 2004. Towards a molecular identification and classification system of lepidopteran-specific baculoviruses. Virology 325, 36-47. (Pubitemid 38844768)
35. Larget, B., and Simon, D. 1999. Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees. Mol. Biol. Evol. 16, 750-759. (Pubitemid 29260829)
36. Lauzon, H.A.M., Lucarotti, C.J., Krell, P.J., et al. 2004. Sequence and organization of the Neodiprion lecontei nu-cleopolyhedrovirus genome. J. Virol. 78, 7023-7035. (Pubitemid 38781541)
37. Mahajan, S., and Ramesh, H. 1999. Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28, 1641-1663. (Pubitemid 129304146)
38. Mailund, T., Brodal, G.S., Fagerberg, R., et al. 2006. Recrafting the neighbor-joining method. BMC Bioinformatics 7, 29.
39. Nadeau, J.H., and Taylor, B.A. 1984. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81, 814-818. (Pubitemid 14199035)
40. Ninio, M., Privman, E., Pupko, T., et al. 2007. Phylogeny reconstruction: increasing the accuracy of pairwise distance estimation using Bayesian inference of evolutionary rates. Bioinformatics 23, e136-e141. (Pubitemid 46189648)
41. Robinson, D.F., and Foulds, L.R. 1981. Comparison of phylogenetic trees. Math. Biosci. 53, 131-147. (Pubitemid 11129084)
42. Rohrmann, G.F. 1986. Polyhedrin structure. J. Gen. Virol. 67, 1499-1513.
43. Rosenberg, M.S., and Kumar, S. 2001. Traditional phylogenetic reconstruction methods reconstruct shallow and deep evolutionary relationship equally well. Mol. Biol. Evol. 18, 1823-1827. (Pubitemid 32776932)
44. Rzhetsky, A., and Nei, M. 2003. Theoretical foundation of the minimum-evolution method of phylogenetic inference. Mol. Biol. Evol. 10, 1073-1095.
45. Saitou, N., and Nei, M. 1986. The number of nucleotides required to determine the branching order of three species with special reference to the human-chimpanzee-gorilla divergence. J. Mol. Evol. 24, 189-204.
46. Saitou, N., and Nei, M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425.
47. Shi, J., and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. 22, 888-905.
48. Snel, B., Bork, P., and Huynen, M.A. 1999. Genome phylogeny based on gene content. Nat. Genet. 21, 108-110. (Pubitemid 29036294)
49. Snir, S., and Rao, S. 2006. Using max cut to enhance rooted trees consistency. IEEE/ACM Trans. Comput. Biol. Bioinform. 3, 323-333. (Pubitemid 44950082)
50. Studier, J.A., and Keppler, K.J. 1988. A note on the neighbor-joining algorithm of Saitou and Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 5, 729-731.
51. Takahashi, K., and Nei, M. 2000. Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used. Mol. Biol. Evol. 17, 1251-1258. (Pubitemid 30617152)
52. Yang, Z.H., and Rannala, B. 1997. Bayesian phylogenetic inference using DNA sequences: a Markov chain Monte Carlo method. Mol. Biol. Evol. 14, 717-724. (Pubitemid 27287292)
53. Zanotto, P.M., Kessing, B.D., and Maruniak, J.E. 1993. Phylogenetic interrelationships among baculoviruses: evolutionary rates and host associations. J. Invertebr. Pathol. 62, 147-164. (Pubitemid 223036689)