Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315329zbMATH OpenFDO

Authors Jesper Jansson, Eva-Marta Lundell, Anders Dessmark, Andrzej Lingas

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Polynomial-time algorithms for the ordered maximum agreement subtree problem
• Linear time 3-approximation for the MAST problem
• On the agreement of many trees
• scientific article; zbMATH DE number 871929
• Rooted maximum agreement supertrees

Cited in

(6)

• Polynomial-time algorithms for the ordered maximum agreement subtree problem
• An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
• An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
• From constrained to unconstrained maximum agreement subtree in linear time
• Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
• On the agreement of many trees

This page was built for publication: Combinatorial Pattern Matching

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