Quarnet inference rules for level-1 networks
From MaRDI portal
Publication:1786927
DOI10.1007/s11538-018-0450-2zbMath1398.92175arXiv1711.06720OpenAlexW2963639031WikidataQ64884675 ScholiaQ64884675MaRDI QIDQ1786927
Charles Semple, Taoyang Wu, Katharina T. Huber, Vincent L. Moulton
Publication date: 25 September 2018
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.06720
Related Items (6)
Identifiability of species network topologies from genomic sequences using the logDet distance ⋮ Combining Networks Using Cherry Picking Sequences ⋮ Phylogenetic Networks ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ Identifying species network features from gene tree quartets under the coalescent model ⋮ The tree of blobs of a species network: identifiability under the coalescent
Uses Software
Cites Work
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- Reconstructing a phylogenetic level-1 network from quartets
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Encoding phylogenetic trees in terms of weighted quartets
- A canonical decomposition theory for metrics on a finite set
- The complexity of reconstructing trees from qualitative characters and subtrees
- \(X\)-trees and weighted quartet systems
- Extension operations on sets of leaf-labelled trees
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Recovering a phylogenetic tree using pairwise closure operations
- Basic Phylogenetic Combinatorics
- Tree structures for proximity data
- Leaf-Reconstructibility of Phylogenetic Networks
- Computing and Combinatorics
This page was built for publication: Quarnet inference rules for level-1 networks
