Skip to main content
SpringerLink
Log in

New Efficient Algorithm for Detection of Horizontal Gene Transfer Events

  • Conference paper
Algorithms in Bioinformatics (WABI 2003)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 2812))

Included in the following conference series:

Abstract

This article addresses the problem of detection of horizontal gene transfers (HGT) in evolutionary data. We describe a new method allowing to predict the ways of possible HGT events which may have occurred during the evolution of a group of considered organisms. The proposed method proceeds by establishing differences between topologies of species and gene phylogenetic trees. Then, it uses a least-squares optimization procedure to test the possibility of horizontal gene transfers between any couple of branches of the species tree. In the application section we show how the introduced method can be used to predict eventual transfers of the rubisco rbcL gene in the molecular phylogeny including plastids, cyanobacteria, and proteobacteria.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bryant, D., Waddell, P.: Rapid evaluation of least-squares and minimum evolution criteria on phylogenetic trees. Mol. Biol. Evol. 15, 1346–1359 (1998)

    Google Scholar 

  2. Buneman, P.: A note on metric properties of trees. Jl Comb. Theory B. 17, 48–50 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  3. Charleston, M.A.: Jungle: a new solution to the host/parasite phylogeny reconciliation problem. Math. Biosci. 149, 191–223 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 8th Annual ACM-SIAM Symposium on discrete Algorithms, SODA 1997, pp. 427–436 (1997)

    Google Scholar 

  5. Delwiche, C.F., Palmer, J.D.: Rampant horizontal transfer and duplication of Rubisco genes in Eubacteria and Plastids. Mol. Biol. Evol. 13(6), 873–882 (1996)

    Google Scholar 

  6. Doolittle, W.F.: Phylogenetic classification and the universal tree. Science 284, 2124–2128 (1999)

    Article  Google Scholar 

  7. Felsenstein, J.: An alternating least-squares approach to inferring phylogenies from pairwise distances. Syst. Biol. 46, 101–111 (1997)

    Article  Google Scholar 

  8. Gascuel, O.: BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data, Mol. Mol. Biol. Evol. 14(7), 685–695 (1997)

    Google Scholar 

  9. Guig, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient molecular phylogenies. Mol. Phyl. Evol. 6(2), 189–213 (1996)

    Article  Google Scholar 

  10. Hallet, M., Lagergreen, J.: Efficient algorithms for lateral gene transfer problems. In: RECOMB, pp. 149–156 (2001)

    Google Scholar 

  11. Hein, J.: A heuristic method to reconstructing the evolution of sequences subject to recombination using parsimony. Math. Biosci., 185–200 (1990)

    Google Scholar 

  12. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionnary treees. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 177–190. Springer, Heidelberg (1995)

    Google Scholar 

  13. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionnary trees. Discr. Appl. Math. 71, 153–169 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  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., Tiedje, J.M.: The RDP-II (ribosomal database project). Nucleic Acids Research 29, 173–174 (2001)

    Article  Google Scholar 

  15. Makarenkov, V., Leclerc, B.: An algorithm for the fitting of a phylogenetic tree according to a weighted least-squares criterion. J. of Classif. 16(1), 3–26 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Makarenkov, V.: T-Rex: reconstructing and visualizing phylogenetic trees and reticulation networks. Bioinformatics 17, 664–668 (2001)

    Article  Google Scholar 

  17. Olsen, G.J., Woese, C.R.: Archael genomics an overview. Cell 89, 991–994 (1997)

    Article  Google Scholar 

  18. Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organism and areas. Syst. Biol. 43, 58–77 (1994)

    Google Scholar 

  19. Page, R.D.M., Charleston, M.A.: From gene to organismal phylogeny: Reconciled trees. Bioinformatics 14, 819–820 (1998)

    Article  Google Scholar 

  20. Saitou, N., Nei, M.: The neighbour-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406–425 (1987)

    Google Scholar 

  21. Sneath, P.H.: Reticulate evolution in bacteria and other organisms: How can we study it? J. Classif. 17, 159–163 (2000)

    Article  MathSciNet  Google Scholar 

  22. The NCBI handbook [Internet]. Bethesda (MD): National Library of Medicine (US), National Center for Biotechnology Information, Ch. 17, The Reference Sequence (RefSeq) Project (October 2002)

    Google Scholar 

  23. von Haseler, A., Churchill, G.A.: Network models for sequence evolution. J. Mol. Evol. 37, 77–85 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Informatique, Université du Québec à Montréal, C.P. 8888, Succ. Centre-Ville, Montréal (Québec), Canada, H3C 3P8

    Alix Boc & Vladimir Makarenkov

  2. Institute of Control Sciences, 65 Profsoyuznaya, Moscow, 117806, Russia

    Vladimir Makarenkov

Authors
  1. Alix Boc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Makarenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Biomathematical Sciences, The Mount Sinai School of Medicine, 10029-6574, New York, NY

    Gary Benson

  2. Institute of Biomedical and Life Sciences, Division of Environmental and Evolutionary Biology, University of Glasgow, G12 8QQ, Glasgow, Scotland

    Roderic D. M. Page

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boc, A., Makarenkov, V. (2003). New Efficient Algorithm for Detection of Horizontal Gene Transfer Events. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39763-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20076-5

  • Online ISBN: 978-3-540-39763-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation