Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
From MaRDI portal
Publication:1293865
DOI10.1007/PL00009268zbMath0936.68026OpenAlexW3136367277MaRDI QIDQ1293865
Monika R. Henzinger, Valerie King, Tandy J. Warnow
Publication date: 29 June 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009268
Related Items
Incomplete directed perfect phylogeny in linear time ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ Best match graphs ⋮ Building a small and informative phylogenetic supertree ⋮ Orthology relations, symbolic ultrametrics, and cographs ⋮ The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets ⋮ New heuristics for rooted triplet consistency ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ New results on optimizing rooted triplets consistency ⋮ Fast compatibility testing for rooted phylogenetic trees ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Faster algorithms for computing the R* consensus tree ⋮ From Gene Trees to Species Trees through a Supertree Approach ⋮ Reconstructing minimal rooted trees. ⋮ Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time ⋮ Best match graphs with binary trees ⋮ Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study ⋮ Unnamed Item
