Constructing the simplest possible phylogenetic network from triplets

DOI10.1007/S00453-009-9333-0zbMATH Open1215.92052OpenAlexW2886143626MaRDI QIDQ534764FDOQ534764

Authors: Leo Van Iersel, Steven Kelk 

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9333-0

Recommendations

• Constructing the Simplest Possible Phylogenetic Network from Triplets
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Computing and Combinatorics
• Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
• On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters

zbMATH Keywords

phylogeneticsphylogenetic networkspolynomial-time algorithmtripletsminimising reticulations

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Directed graphs (digraphs), tournaments (05C20) Nonnumerical algorithms (68W05)

Cites Work

• A framework for representing reticulate evolution
• Bounding the number of hybridisation events for a consistent evolutionary history
• Computing the minimum number of hybridization events for a consistent evolutionary history
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Computing the maximum agreement of phylogenetic networks
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• Research in Computational Molecular Biology
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

Cited In (23)

• Computing and Combinatorics
• Restricted trees: simplifying networks with bottlenecks
• When is a phylogenetic network simply an amalgamation of two trees?
• The Structure of Level-k Phylogenetic Networks
• Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
• Trinets encode orchard phylogenetic networks
• Trinets encode tree-child and level-2 phylogenetic networks
• On the complexity of computing the temporal hybridization number for two phylogenies
• Encoding and constructing 1-nested phylogenetic networks with trinets
• When two trees go to war
• Computing the rooted triplet distance between galled trees by counting triangles
• Binets: fundamental building blocks for phylogenetic networks
• On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Constructing the Simplest Possible Phylogenetic Network from Triplets
• Research in Computational Molecular Biology
• Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
• The hybrid number of a ploidy profile
• Reconstructing a phylogenetic level-1 network from quartets
• Reconstruction of LGT networks from tri-LGT-nets
• Caterpillars on three and four leaves are sufficient to binary normal networks
• NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets

This page was built for publication: Constructing the simplest possible phylogenetic network from triplets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534764)