New efficient algorithm for detection of horizontal gene transfer events

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2812, Issue , 2003, Pages 190-201

  Boc, Alix ^a   Makarenkov, Vladimir ^a,b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; GENE TRANSFER;

HORIZONTAL GENE TRANSFER; LEAST-SQUARES OPTIMIZATION; MOLECULAR PHYLOGENY; PHYLOGENETIC TREES; PROTEOBACTERIA; RUBISCO;

GENES;

EID: 35248900589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_15     Document Type: Article

References (23)

1. Bryant, D., and P. Waddell.: Rapid evaluation of least-squares and minimum evolution criteria on phylogenetic trees. Mol. Biol. Evol. 15 (1998) 1346-1359
2. Buneman, P.: A note on metric properties of trees. Jl Comb. Theory B. 17 (1974) 48-50
3. Charleston, M. A.: Jungle: a new solution to the host/parasite phylogeny reconciliation problem. Math. Biosci. 149 (1998) 191-223
4. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J. and Zhang, L.: On distances between phylogenetic trees. Proc. 8th Annual ACM-SIAM Symposium on discrete Algorithms, SODA'97 (1997) 427-436
5. Delwiche, C.F. and Palmer, J.D.: Rampant horizontal transfer and duplication of Rubisco genes in Eubacteria and Plastids. Mol. Biol. Evol. 13(6) (1996) 873-882
6. Doolittle, W. F.: Phylogenetic classification and the universal tree. Science 284 (1999) 2124-2128
7. Felsenstein, J.: An alternating least-squares approach to inferring phylogenies from pairwise distances. Syst. Biol. 46 (1997) 101-111
8. Gascuel O.: BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data, Mol. Biol. Evol. 14(7) (1997) 685-695
9. Guig, R. I. Muchnik, and T.F. Smith.: Reconstruction of ancient molecular phylogenies. Mol. Phyl. Evol. 6,2 (1996) 189-213
10. Hallet, M., and Lagergreen, J.: Efficient algorithms for lateral gene transfer problems. RECOMB (2001) 149-156
11. Hein, J.: A heuristic method to reconstructing the evolution of sequences subject to recombination using parsimony. Math. Biosci. (1990) 185-200
12. Hein. J., Jiang, T., Wang, L. and Zhang, K.: On the complexity of comparing evolutionnary treees. Combinatorial Pattern Matching (CPM)95, LLNCS 937 (1995) 177-190
13. Hein, J., Jiang, T., Wang, L. and Zhang, K.: On the complexity of comparing evolutionnary trees. Discr. Appl. Math. 71 (1996) 153-169
14. Maidak, B.L., Cole, J.R., Lilburn, T.G., Parker, C.T., Saxman, P.R., Farris, R.J., Garrity, G.M., Olsen, G.J., Schmidt, T.M., and Tiedje, J.M.: The RDP-II (ribosomal database project). Nucleic Acids Research 29 (2001) 173-174
15. Makarenkov, V. and Leclerc, B.: An algorithm for the fitting of a phylogenetic tree according to a weighted least-squares criterion, J. of Classif. 16,1 (1999) 3-26
16. Makarenkov, V.: T-Rex: reconstructing and visualizing phylogenetic trees and reticulation networks. Bioinformatics, 17 (2001) 664-668
17. Olsen, G. J. and Woese, C. R.: Archael genomics an overview. Cell 89 (1997) 991-994
18. Page, R. D. M.: Maps between trees and cladistic analysis of historical associations among genes, organism and areas. Syst. Biol. 43 (1994) 58-77
19. Page, R. D. M. and Charleston, M. A.: From gene to organismal phylogeny: Reconciled trees. Bioinformatics 14 (1998) 819-820
20. Saitou, N. and Nei, M.: The neighbour-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4 (1987) 406-425
21. Sneath, P. H.: Reticulate evolution in bacteria and other organisms: How can we study it? J. Classif. 17 (2000) 159-163
22. The NCBI handbook [Internet]. Bethesda (MD): National Library of Medicine (US), National Center for Biotechnology Information; 2002 Oct. Chapter 17, The Reference Sequence (RefSeq) Project
23. von Haseler, A. and Churchill, G. A.: Network models for sequence evolution. J. Mol. Evol. 37 (1993) 77-85