Skip to main content
SpringerLink
Log in

Beyond evolutionary trees

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In Computational Biology, the notion of phylogeny has become synonymous with tree-like evolution. Recent advances in the Life Sciences have suggested that evolution has a much more diverse course. In this paper we will survey some of the models that have been proposed to overcome the limitations of using phylogenies to represent evolutionary histories.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Baroni M, Semple C, Steel M (2004) A framework for representing reticulate evolution. Ann Comb 8(4):391–408

    Article  MATH  MathSciNet  Google Scholar 

  • Bonizzoni P, Della Vedova G, Dondi R, Li J (2003) The haplotyping problem: an overview of computational models and solutions. J Comput Sci Technol 18(6):675–688

    Article  MATH  MathSciNet  Google Scholar 

  • Bonizzoni P, Della Vedova G, Dondi R (2005) Reconciling a gene tree to a species tree under the duplication cost model. Theor Comput Sci 347(1–2):192–216

    Article  MathSciNet  Google Scholar 

  • Bonizzoni P, Della Vedova G, Dondi R, Mauri G (2008) The comparison of phylogenetic networks: algorithms and complexity. In: Mandoiu I, Zelikovsky A (eds) Bioinformatics algorithms: techniques and applications. Wiley-Interscience Publisher, Hoboken, NJ, pp 143–173

    Google Scholar 

  • Burleigh JG, Bansal MS, Wehe A, Eulenstein O (2008) Locating multiple gene duplications through reconciled trees. In: Proceedings of the 12th conference on research in computational molecular biology, (RECOMB), pp 273–284

  • Chan BM-Y, Chan JW-T, Chin FYL, Fung SPY, Kao M-Y (2006) Linear-time haplotype inference on pedigrees without recombinations. In: Proceedings of the 6th workshop on algorithms in bioinformatics (WABI), pp 56–67

  • Chang W-C, Eulenstein O (2006) Reconciling gene trees with apparent polytomies. In: Proceedings of the 12th conference on computing and combinatorics (COCOON), pp 235–244

  • Dasgupta B, Ferrarini S, Gopalakrishnan U, Paryani NR (2006) Inapproximability results for the lateral gene transfer problem. J Comb Optim 11(4):387–405

    Article  MATH  MathSciNet  Google Scholar 

  • Doi K, Li J, Jiang T (2003) Minimum recombinant haplotype configuration on tree pedigrees. In: Proceedings of the 3rd workshop on algorithms in bioinformatics (WABI). Springer, pp 339–353

  • Finden C, Gordon A (1985) Obtaining common pruned trees. J Classif 2:255–276

    Article  Google Scholar 

  • Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G (1979) Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool 28(2):132–163

    Article  Google Scholar 

  • Gòrecki P (2004) Reconciliation problems for duplication, loss and horizontal gene transfer. In: Proceedings of 8th conference on research in computational molecular biology, (RECOMB), pp 316–325

  • Gòrecki P, Tiuryn J (2006) DLS-trees: a model of evolutionary scenarios. Theor Comput Sci 359(1–3):378–399

    Article  MATH  Google Scholar 

  • Guigò R, Muchnik I, Smith T (1996) Reconstruction of ancient molecular phylogeny. Mol Phylogenet Evol 6(2):189–213

    Article  Google Scholar 

  • Gupta A, Manuch J, Zhao X, Stacho L (2006) Characterization of the existence of galled-tree networks. J Bioinform Comput Biol 4(6):1

    Article  Google Scholar 

  • Gusfield D (1997) Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Gusfield D, Eddhu S, Langley CH (2004) Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J Bioinform Comput Biol 2(1):173–214

    Article  Google Scholar 

  • Gusfield D, Bansal V, Bafna V, Song YS (2007) A decomposition theory for phylogenetic networks and incompatible characters. J Comput Biol 14(10):1247–1272

    Article  MathSciNet  Google Scholar 

  • Hallett M, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. In: Proceedings of 5th annual international conference on research in computational molecular biology, (RECOMB), pp 149–156

  • Hallett M, Lagergren J, Tofigh A (2004) Simultaneous identification of duplications and lateral transfers. In: Proceedings of 8th annual international conference on research in computational molecular biology, (RECOMB), pp 347–356

  • Hamel A, Steel MA (1996) Finding a common compatible tree is NP-hard for sequences and trees. Appl Math Lett 9(2):55–60

    Article  MATH  MathSciNet  Google Scholar 

  • Li J, Jiang T (2003) Efficient inference of haplotypes from genotypes on a pedigree. J Bioinform Comput Biol 1(1):41–69

    Article  Google Scholar 

  • Liu L, Chen X, Xiao J, Jiang T (2007) Complexity and approximation of the minimum recombinant haplotype configuration problem. Theor Comput Sci 378(3):316–330

    Article  MATH  MathSciNet  Google Scholar 

  • Ma B, Li M, Zhang L (2000) From gene trees to species trees. SIAM J Comput 30(3):729–752

    Article  MATH  MathSciNet  Google Scholar 

  • Moret BME, Nakhleh L, Warnow T, Linder CR, Tholse A, Padolina A, Sun J, Timme RE (2004) Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE/ACM Trans Comput Biol Bioinform 1(1):13–23

    Article  Google Scholar 

  • Nakhleh L, Ruths DA, Wang L-S (2005a) RIATA-HGT: a fast and accurate heuristic for reconstructing horizontal gene transfer. In: Proceedings of the 11th conference on computing and combinatorics (COCOON), pp 84–93

  • Nakhleh L, Warnow T, Linder CR, John KS (2005b) Reconstructing reticulate evolution in species: theory and practice. J Comput Biol 12(6):796–811

    Article  Google Scholar 

  • Page R (1994) Maps between trees and cladistic analysis of historical associations among genes. Syst Biol 43:58–77

    Google Scholar 

  • Steel M, Böcker S, Dress A (2000) Simple but fundamental limits for supertree and consensus tree methods. Syst Biol 49(2):363–368

    Article  Google Scholar 

  • Than C, Nakhleh L (2008) SPR-based tree reconciliation: non-binary trees and multiple solutions. In: Proceedings of the 6th Asia-Pacific bioinformatics conference (APBC), pp 251–260

  • Than C, Ruths D, Innan H, Nakhleh L (2007) Confounding factors in HGT detection: statistical error, coalescent effects, and multiple solutions. J Comput Biol 14(4):517–535

    Article  MathSciNet  Google Scholar 

  • van Iersel L, Keijsper J, Kelk S, Stougie L, Hagen F, Boekhout T (2008) Constructing level-2 phylogenetic networks from triplets. In: Proceedings of 5th annual international conference on computational molecular biology, (RECOMB), pp 450–462

  • Wang L, Zhang K, Zhang L (2001) Perfect phylogenetic networks with recombination. J Comput Biol 8(1):69–78

    Article  Google Scholar 

  • Xiao J, Liu L, Xia L, Jiang T (2007) Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. In: Proceedings of the 18th symposium on discrete algorithms (SODA), pp 655–664

Download references

Acknowledgments

We would like to thank the anonymous referees, whose detailed suggestions have greatly contributed to the paper. GDV and YP have been partially supported by FAR grant “Computational models for phylogenetic analysis of gene variations”. TJ’s research is supported in part by NIH grant LM008991 and NSF grant IIS-0711129. LW is supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 121207).

Author information

Authors and Affiliations

  1. Dipartimento di Statistica, Università degli Studi di Milano-Bicocca, Milano, Italy

    Gianluca Della Vedova

  2. Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali, Università degli Studi di Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Department of Computer Science, University of California at Riverside, Riverside, CA, USA

    Tao Jiang

  4. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Milano, Italy

    Giulio Pavesi

  5. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy

    Yuri Pirola

  6. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Lusheng Wang

Authors
  1. Gianluca Della Vedova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Riccardo Dondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giulio Pavesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yuri Pirola
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gianluca Della Vedova.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Della Vedova, G., Dondi, R., Jiang, T. et al. Beyond evolutionary trees. Nat Comput 9, 421–435 (2010). https://doi.org/10.1007/s11047-009-9156-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-009-9156-6

Keywords

Search

Navigation