On the approximation of largest common subtrees and largest common point sets

DOI10.1016/S0304-3975(97)00278-8zbMath0952.68163OpenAlexW2054729486MaRDI QIDQ1575954

Tatsuya Akutsu, Magnús M. Halldórsson

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00278-8

zbMATH Keywords

largest common subtree problem

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Approximation algorithms (68W25)

Related Items (3)

On the parameterized complexity of the multi-MCT and multi-MCST problems ⋮ The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

Cites Work

• Congruence, similarity, and symmetries of geometric objects
• Backtrack search algorithms and the maximal common subgraph problem
• An Analysis of a Good Algorithm for the Subtree Problem
• The Complexity of Some Problems on Subsequences and Supersequences
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Unnamed Item
• Unnamed Item

This page was built for publication: On the approximation of largest common subtrees and largest common point sets