Patching up \(X\)-trees
From MaRDI portal
Publication:1306736
DOI10.1007/BF01609870zbMath0933.05039OpenAlexW2578916005MaRDI QIDQ1306736
Andreas W. M. Dress, Sebastian Böcker, Mike A. Steel
Publication date: 4 April 2000
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01609870
Related Items (7)
Tree reconstruction from triplet cover distances ⋮ Linear pencils of tropical plane curves ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ Slim sets of binary trees ⋮ Patchworks ⋮ Hypothesis tests for phylogenetic quartets, with applications to coalescent-based species tree inference ⋮ Exponentially many supertrees
Cites Work
- Reconstructing the shape of a tree from observed dissimilarity data
- The complexity of reconstructing trees from qualitative characters and subtrees
- Tree structures for proximity data
- A few logs suffice to build (almost) all trees (I)
- Mathematical approaches to comparative linguistics
- Algorithmic Aspects of Tree Amalgamation
This page was built for publication: Patching up \(X\)-trees
