Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 48–52Cite as

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network

  • Reference work entry
  • First Online:

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

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network, Fig. 1
figure 17 figure 17

A dense set \(\mathcal{T} =\{ ab\vert c,\,ab\vert d,\,cd\vert a,\,bc\vert d\}\) of rooted triplets with leaf set {a, b, c, d} and a galled phylogenetic network that is consistent with \(\mathcal{T}\). Note that this solution is not unique

Full size image

This is a preview of subscription content, 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   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Recommended Reading

  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–421

    Article  MathSciNet  MATH  Google Scholar 

  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–75

    Article  MathSciNet  MATH  Google Scholar 

  3. Byrka J, Guillemot S, Jansson J (2010) New results on optimizing rooted triplets consistency. Discret Appl Math 158(11):1136–1147

    Article  MathSciNet  MATH  Google Scholar 

  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–188

    Google Scholar 

  5. Choy C, Jansson J, Sadakane K, Sung W-K (2005) Computing the maximum agreement of phylogenetic networks. Theor Comput Sci 335(1):93–107

    Article  MathSciNet  MATH  Google Scholar 

  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–374

    Google Scholar 

  7. Habib M, To T-H (2012) Constructing a minimum phylogenetic network from a dense triplet set. J Bioinform Comput Biol 10(5):1250013

    Article  Google Scholar 

  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–74

    Article  Google Scholar 

  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–649

    Article  Google Scholar 

  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–68

    Article  MathSciNet  MATH  Google Scholar 

  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–1121

    Article  MathSciNet  MATH  Google Scholar 

  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–1961

    Article  MathSciNet  MATH  Google Scholar 

  13. Kannan S, Lawler E, Warnow T (1996) Determining the evolutionary tree using experiments. J Algorithms 21(1):26–50

    Article  MathSciNet  MATH  Google Scholar 

  14. van Iersel L, Kelk S (2011) Constructing the simplest possible phylogenetic network from triplets. Algorithmica 60(2):207–235

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. Laboratory of Mathematical Bioinformatics, Institute for Chemical Research, Kyoto University, 611-0011, Gokasho, Uji, Kyoto, Japan

    Jesper Jansson

  2. Department of Computer Science, National University of Singapore, Computing 1, 13 Computing Drive, 117417, Singapore, Singapore

    Wing-Kin Sung

Authors
  1. Jesper Jansson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wing-Kin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jesper Jansson or Wing-Kin Sung .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Jansson, J., Sung, WK. (2016). Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_92

Download citation

Publish with us

Policies and ethics

Search

Navigation