Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network

  • Jesper JanssonEmail author
  • Wing-Kin Sung
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_92-2

Years and Authors of Summarized Original Work

2006; Jansson, Sung

2006; Jansson, Nguyen, Sung

2006; He, Huynh, Jansson, Sung

2010; Byrka, Gawrychowski, Huber, Kelk

2011; van Iersel, Kelk

Problem Definition

A phylogenetic tree is a binary, rooted, unordered tree whose leaves are distinctly labeled. A phylogenetic network is a generalization of a phylogenetic tree formally defined as a rooted, connected, directed acyclic graph in which (1) each node has outdegree at most 2; (2) each node has indegree 1 or 2, except the root node which has indegree 0; (3) no node has both indegree 1 and outdegree 1; and (4) all nodes with outdegree 0 are labeled by elements from a finite set L in such a way that no two nodes are assigned the same label. Nodes of outdegree 0 are referred to as leaves and are identified with their corresponding elements in L. Nodes with indegree 2 are called reticulation nodes. For any phylogenetic network N, let \(\mathcal{U}(N)\)

Keywords

Dense set, Galled phylogenetic network, Phylogenetic tree, Polynomial-time approximation algorithm, Rooted triplet 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

JJ was funded by the Hakubi Project at Kyoto University and KAKENHI grant number 26330014.

Recommended Reading

  1. 1.
    Aho AV, Sagiv Y, Szymanski TG, Ullman JD (1981) Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J Comput 10(3):405–421MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Byrka J, Gawrychowski P, Huber KT, Kelk S (2010) Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J Discret Algorithms 8(1):65–75MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Byrka J, Guillemot S, Jansson J (2010) New results on optimizing rooted triplets consistency. Discret Appl Math 158(11):1136–1147MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chao K-M, Chu A-C, Jansson J, Lemence RS, Mancheron A (2012) Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics. In: Proceedings of the 9th annual conference on theory and applications of models of computation (TAMC 2012), Beijing, pp 177–188Google Scholar
  5. 5.
    Choy C, Jansson J, Sadakane K, Sung W-K (2005) Computing the maximum agreement of phylogenetic networks. Theor Comput Sci 335(1):93–107MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gusfield D, Eddhu S, Langley C (2003) Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proceedings of computational systems bioinformatics (CSB2003), Stanford, pp 363–374Google Scholar
  7. 7.
    Habib M, To T-H (2012) Constructing a minimum phylogenetic network from a dense triplet set. J Bioinform Comput Biol 10(5):1250013CrossRefGoogle Scholar
  8. 8.
    He Y-J, Huynh TND, Jansson J, Sung W-K (2006) Inferring phylogenetic relationships avoiding forbidden rooted triplets. J Bioinform Comput Biol 4(1):59–74CrossRefGoogle Scholar
  9. 9.
    Huber KT, van Iersel L, Kelk S, Suchecki R (2011) A practical algorithm for reconstructing level-1 phylogenetic networks. IEEE/ACM Trans Comput Biol Bioinform 8(3):635–649CrossRefGoogle Scholar
  10. 10.
    Jansson J, Sung W-K (2006) Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor Comput Sci 363(1):60–68MathSciNetCrossRefGoogle Scholar
  11. 11.
    Jansson J, Nguyen NB, Sung W-K (2006) Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J Comput 35(5):1098–1121MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Jiang T, Kearney P, Li M (2001) A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J Comput 30(6):1942–1961MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Kannan S, Lawler E, Warnow T (1996) Determining the evolutionary tree using experiments. J Algorithms 21(1):26–50MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    van Iersel L, Kelk S (2011) Constructing the simplest possible phylogenetic network from triplets. Algorithmica 60(2):207–235MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Wang L, Zhang K, Zhang L (2001) Perfect phylogenetic networks with recombination. J Comput Biol 8(1):69–78CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Laboratory of Mathematical BioinformaticsInstitute for Chemical Research, Kyoto UniversityGokasho, Uji, KyotoJapan
  2. 2.Department of Computer ScienceNational University of SingaporeSingaporeSingapore