Basic Phylogenetic Combinatorics
From MaRDI portal
Publication:3559176
DOI10.1017/CBO9781139019767zbMath1298.92008OpenAlexW1520866265MaRDI QIDQ3559176
Huber Katharina T., Andreas W. M. Dress, Andreas Spillner, Jack H. Koolen, Vincent L. Moulton
Publication date: 12 May 2010
Full work available at URL: https://doi.org/10.1017/cbo9781139019767
Problems related to evolution (92D15) Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to biology (92-02)
Related Items (44)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Compatibility of partitions with trees, hierarchies, and split systems ⋮ Families of multiweights and pseudostars ⋮ On Computing the Hyperbolicity of Real-World Graphs ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ Weighted graphs with distances in given ranges ⋮ \(p\)-adic mathematical physics: the first 30 years ⋮ Tree Containment With Soft Polytomies ⋮ Reconstructing unrooted phylogenetic trees from symbolic ternary metrics ⋮ Lassoing and corralling rooted phylogenetic trees ⋮ Uprooted phylogenetic networks ⋮ On the weights of simple paths in weighted complete graphs ⋮ On tight spans for directed distances ⋮ Injective split systems ⋮ Convex Characters, Algorithms, and Matchings ⋮ Injective optimal realizations of finite metric spaces ⋮ Exact-2-relation graphs ⋮ Inclusion matrices for rainbow subsets ⋮ Phylogenetic Networks ⋮ Trees, tight-spans and point configurations ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ On the weighted quartet consensus problem ⋮ Species notions that combine phylogenetic trees and phenotypic partitions ⋮ Transit sets of -point crossover operators ⋮ A characterization of dissimilarity families of trees ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ A note on \(M\)-convexity in polyhedral split decomposition of distances ⋮ Cluster networks and Bruhat-Tits buildings ⋮ Quarnet inference rules for level-1 networks ⋮ A cognitive network for oracle bone characters related to animals ⋮ A note on convex characters, Fibonacci numbers and exponential-time algorithms ⋮ Searching for realizations of finite metric spaces in tight spans ⋮ Galois connections for phylogenetic networks and their polytopes ⋮ The Buneman index via polyhedral split decomposition ⋮ Unnamed Item ⋮ A note on completing quasi-distance and distance matrices ⋮ On Computing the Gromov Hyperbolicity ⋮ Treelike families of multiweights ⋮ Moduli space of families of positive \((n - 1)\)-weights ⋮ Two-dimensional partial cubes ⋮ Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution? ⋮ Distinguished Minimal Topological Lassos ⋮ Recognizing treelike \(k\)-dissimilarities
This page was built for publication: Basic Phylogenetic Combinatorics
