Encoding and constructing 1-nested phylogenetic networks with trinets
From MaRDI portal
Publication:2375949
DOI10.1007/s00453-012-9659-xzbMath1267.05240arXiv1110.0728MaRDI 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
05C05: Trees
05C90: Applications of graph theory
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets, A cubic-time algorithm for computing the trinet distance between level-1 networks, Reconstruction of LGT networks from tri-LGT-nets, Beyond representing orthology relations by trees, Trinets encode tree-child and level-2 phylogenetic networks, On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters, Uprooted phylogenetic networks, Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
