Constructing the simplest possible phylogenetic network from triplets
From MaRDI portal
Publication:534764
DOI10.1007/s00453-009-9333-0zbMath1215.92052OpenAlexW2886143626MaRDI QIDQ534764
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
Problems related to evolution (92D15) Applications of graph theory (05C90) Nonnumerical algorithms (68W05) Directed graphs (digraphs), tournaments (05C20)
Related Items (14)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Encoding and constructing 1-nested phylogenetic networks with trinets ⋮ Reconstruction of LGT networks from tri-LGT-nets ⋮ The hybrid number of a ploidy profile ⋮ On the complexity of computing the temporal hybridization number for two phylogenies ⋮ Caterpillars on three and four leaves are sufficient to binary normal networks ⋮ Computing the rooted triplet distance between galled trees by counting triangles ⋮ Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable ⋮ Reconstructing a phylogenetic level-1 network from quartets ⋮ Trinets encode orchard phylogenetic networks ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ When two trees go to war ⋮ NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization ⋮ Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
Cites Work
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- A framework for representing reticulate evolution
- Computing the maximum agreement of phylogenetic networks
- 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
- Bounding the number of hybridisation events for a consistent evolutionary history
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Research in Computational Molecular Biology
This page was built for publication: Constructing the simplest possible phylogenetic network from triplets
