Fast comparison of evolutionary trees

From MaRDI portal

Revision as of 03:09, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2508335

Jump to:navigation, search

DOI10.1006/inco.1995.1155zbMath1096.92501OpenAlexW2019026763MaRDI QIDQ2508335

Mikkel Thorup, Martin Farach

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1155

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD ⋮ On finding the Adams consensus tree ⋮ An improved algorithm for the maximum agreement subtree problem

This page was built for publication: Fast comparison of evolutionary trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2508335&oldid=15221546"