Encoding and constructing 1-nested phylogenetic networks with trinets
From MaRDI portal
Publication:2375949
DOI10.1007/s00453-012-9659-xzbMath1267.05240arXiv1110.0728OpenAlexW1964226922MaRDI QIDQ2375949
Katharina T. Huber, Vincent L. Moulton
Publication date: 25 June 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.0728
Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (22)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ An algorithm for reconstructing level-2 phylogenetic networks from trinets ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Uprooted phylogenetic networks ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ Reconstruction of LGT networks from tri-LGT-nets ⋮ The hybrid number of a ploidy profile ⋮ Autopolyploidy, allopolyploidy, and phylogenetic networks with horizontal arcs ⋮ Computing consensus networks for collections of 1-nested phylogenetic networks ⋮ Beyond representing orthology relations by trees ⋮ Caterpillars on three and four leaves are sufficient to binary normal networks ⋮ Trinets encode orchard phylogenetic networks ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ A cubic-time algorithm for computing the trinet distance between level-1 networks ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ Phylogenetic networks that are their own fold-ups ⋮ Quarnet inference rules for level-1 networks ⋮ Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
Uses Software
Cites Work
- On encodings of phylogenetic networks of bounded level
- Constructing the simplest possible phylogenetic network from triplets
- New results on optimizing rooted triplets consistency
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- On the complexity of constructing evolutionary trees
- A supertree method for rooted trees
- Constructing the maximum consensus tree from rooted Triples
- Computing the maximum agreement of phylogenetic networks
- Tripartitions do not always discriminate phylogenetic networks
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- A fast algorithm for finding dominators in a flowgraph
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Encoding and constructing 1-nested phylogenetic networks with trinets
