An algorithm to find agreement subtrees

DOI10.1007/BF01202269zbMATH Open0825.68493OpenAlexW1970802957MaRDI QIDQ1901396FDOQ1901396

Authors: Ewa Kubicka, Grzegorz Kubicki, F. R. McMorris 

Publication date: 13 December 1995

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202269

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
• Kaikoura tree theorems: Computing the maximum agreement subtree
• From constrained to unconstrained maximum agreement subtree in linear time
• An improved bound on the maximum agreement subtree problem
• The agreement metric for labeled binary trees
• Computing the unrooted maximum agreement subtree in sub-quadratic time
• On the agreement of many trees
• An improved algorithm for the maximum agreement subtree problem

This page was built for publication: An algorithm to find agreement subtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901396)