Tree Compatibility and Inferring Evolutionary History
From MaRDI portal
Publication:4290914
DOI10.1006/jagm.1994.1018zbMath0804.68103OpenAlexW2071412858MaRDI QIDQ4290914
Publication date: 12 January 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1018
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (6)
A constructive algorithm for realizing a distance matrix ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ On the ancestral compatibility of two phylogenetic trees with nested taxa ⋮ From constrained to unconstrained maximum agreement subtree in linear time ⋮ On the complexity of comparing evolutionary trees ⋮ The asymmetric median tree. --- A new model for building consensus trees
This page was built for publication: Tree Compatibility and Inferring Evolutionary History
