Constructing the simplest possible phylogenetic network from triplets
From MaRDI portal
(Redirected from Publication:534764)
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
Cites work
- A framework for representing reticulate evolution
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Bounding the number of hybridisation events for a consistent evolutionary history
- Computing the maximum agreement of phylogenetic networks
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- On the minimum number of recombination events in the evolutionary history of DNA se\-quences
- Research in Computational Molecular Biology
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Cited in
(24)- Restricted trees: simplifying networks with bottlenecks
- Computing and Combinatorics
- When is a phylogenetic network simply an amalgamation of two trees?
- Trinets encode orchard phylogenetic networks
- The Structure of Level-k Phylogenetic Networks
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- 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
- An algorithm for reconstructing level-2 phylogenetic networks from trinets
- Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
- Reconstructing a phylogenetic level-1 network from quartets
- Research in Computational Molecular Biology
- The hybrid number of a ploidy profile
- 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)
