Literature DB >> 27800561

On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters.

Philippe Gambette1, K T Huber2, S Kelk3.   

Abstract

Phylogenetic networks have gained prominence over the years due to their ability to represent complex non-treelike evolutionary events such as recombination or hybridization. Popular combinatorial objects used to construct them are triplet systems and cluster systems, the motivation being that any network N induces a triplet system [Formula: see text] and a softwired cluster system [Formula: see text]. Since in real-world studies it cannot be guaranteed that all triplets/softwired clusters induced by a network are available, it is of particular interest to understand whether subsets of [Formula: see text] or [Formula: see text] allow one to uniquely reconstruct the underlying network N. Here we show that even within the highly restricted yet biologically interesting space of level-1 phylogenetic networks it is not always possible to uniquely reconstruct a level-1 network N, even when all triplets in [Formula: see text] or all clusters in [Formula: see text] are available. On the positive side, we introduce a reasonably large subclass of level-1 networks the members of which are uniquely determined by their induced triplet/softwired cluster systems. Along the way, we also establish various enumerative results, both positive and negative, including results which show that certain special subclasses of level-1 networks N can be uniquely reconstructed from proper subsets of [Formula: see text] and [Formula: see text]. We anticipate these results to be of use in the design of algorithms for phylogenetic network inference.

Entities:  

Keywords:  92D15; O5C05

Mesh:

Year:  2016        PMID: 27800561      PMCID: PMC5420025          DOI: 10.1007/s00285-016-1068-3

Source DB:  PubMed          Journal:  J Math Biol        ISSN: 0303-6812            Impact factor:   2.259


  14 in total

1.  Optimal, efficient reconstruction of phylogenetic networks with constrained recombination.

Authors:  Dan Gusfield; Satish Eddhu; Charles Langley
Journal:  J Bioinform Comput Biol       Date:  2004-03       Impact factor: 1.122

2.  When two trees go to war.

Authors:  Leo van Iersel; Steven Kelk
Journal:  J Theor Biol       Date:  2010-10-31       Impact factor: 2.691

3.  Hybrids in real time.

Authors:  Mihaela Baroni; Charles Semple; Mike Steel
Journal:  Syst Biol       Date:  2006-02       Impact factor: 15.683

4.  All that glisters is not galled.

Authors:  Francesc Rosselló; Gabriel Valiente
Journal:  Math Biosci       Date:  2009-07-02       Impact factor: 2.144

5.  Properties of normal phylogenetic networks.

Authors:  Stephen J Willson
Journal:  Bull Math Biol       Date:  2009-09-30       Impact factor: 1.758

6.  On encodings of phylogenetic networks of bounded level.

Authors:  Philippe Gambette; Katharina T Huber
Journal:  J Math Biol       Date:  2011-07-14       Impact factor: 2.259

7.  Reconstructing evolution of sequences subject to recombination using parsimony.

Authors:  J Hein
Journal:  Math Biosci       Date:  1990-03       Impact factor: 2.144

8.  A practical algorithm for reconstructing level-1 phylogenetic networks.

Authors:  Katharina T Huber; Leo van Iersel; Steven Kelk; Radosław Suchecki
Journal:  IEEE/ACM Trans Comput Biol Bioinform       Date:  2011 May-Jun       Impact factor: 3.710

9.  Trinets encode tree-child and level-2 phylogenetic networks.

Authors:  Leo van Iersel; Vincent Moulton
Journal:  J Math Biol       Date:  2013-05-17       Impact factor: 2.259

10.  A distance metric for a class of tree-sibling phylogenetic networks.

Authors:  Gabriel Cardona; Mercè Llabrés; Francesc Rosselló; Gabriel Valiente
Journal:  Bioinformatics       Date:  2008-05-12       Impact factor: 6.937

View more
  4 in total

1.  Level-1 phylogenetic networks and their balanced minimum evolution polytopes.

Authors:  Cassandra Durell; Stefan Forcey
Journal:  J Math Biol       Date:  2020-02-11       Impact factor: 2.259

2.  Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets.

Authors:  Hadi Poormohammadi; Mohsen Sardari Zarchi
Journal:  PLoS One       Date:  2020-09-18       Impact factor: 3.240

3.  Uprooted Phylogenetic Networks.

Authors:  P Gambette; K T Huber; G E Scholz
Journal:  Bull Math Biol       Date:  2017-07-31       Impact factor: 1.758

4.  Frin: An Efficient Method for Representing Genome Evolutionary History.

Authors:  Yan Hong; Juan Wang
Journal:  Front Genet       Date:  2019-12-06       Impact factor: 4.599

  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.