Reconstructing a phylogenetic level-1 network from quartets
From MaRDI portal
Publication:486621
DOI10.1007/S11538-014-0022-ZzbMath1330.92087arXiv1308.5206OpenAlexW1967944500WikidataQ46836926 ScholiaQ46836926MaRDI QIDQ486621
J. C. M. Keijsper, Rudi A. Pendavingh
Publication date: 16 January 2015
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5206
quartetspolynomial time algorithmphylogenetic networkscyclic orderinglevel-1 networkssupernetwork method
Related Items (5)
Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ Phylogenetic Networks ⋮ Identifying species network features from gene tree quartets under the coalescent model ⋮ Quarnet inference rules for level-1 networks ⋮ Treewidth of display graphs: bounds, brambles and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- Constructing the simplest possible phylogenetic network from triplets
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Two novel closure rules for constructing phylogenetic super-networks
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets
- The complexity of reconstructing trees from qualitative characters and subtrees
- Inferring evolutionary trees with strong combinatorial evidence
- Cyclic permutations and evolutionary trees
- Algebraic Cryptanalysis
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- Solving sparse linear equations over finite fields
- A few logs suffice to build (almost) all trees (I)
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
This page was built for publication: Reconstructing a phylogenetic level-1 network from quartets
