Algorithms for finding a most similar subforest

DOI10.1007/s00224-010-9274-7zbMath1217.68242OpenAlexW2136355740MaRDI QIDQ538470

Jesper Jansson, Zeshan Peng

Publication date: 25 May 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9274-7

zbMATH Keywords

dynamic programmingapproximate pattern matchingclosed subforestforest edit distancesibling substructuresimple substructure

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Simple and efficient string matching with k mismatches
• Alignment of trees -- an alternative to tree edit
• Comparing similar ordered trees in linear-time
• Approximate string-matching with \(q\)-grams and maximal matches
• Computing similarity between RNA structures
• Constrained tree inclusion
• New Algorithm for Ordered Tree-to-Tree Correction Problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• Ordered and Unordered Tree Inclusion
• Theoretical Computer Science
• Algorithms and Computation

This page was built for publication: Algorithms for finding a most similar subforest