Algorithms for finding a most similar subforest
type: Item
instance of: scholarly article
title: Algorithms for finding a most similar subforest
zbMATH Open document ID: 1217.68242
author: Jesper Jansson
author: Zeshan Peng
published in: Theory of Computing Systems
publication date: 2011-05-25T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 5899599
zbMATH Keywords: approximate pattern matching
zbMATH Keywords: forest edit distance
zbMATH Keywords: simple substructure
zbMATH Keywords: sibling substructure
zbMATH Keywords: closed subforest
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: s00224-010-9274-7
OpenAlex ID: W2136355740
cites work: A survey on tree edit distance and related problems
cites work: New algorithm for ordered tree-to-tree correction problem
cites work: Q4849531
cites work: An optimal decomposition algorithm for tree edit distance
cites work: Simple and efficient string matching with k mismatches
cites work: Q4432975
cites work: Algorithms and Computation
cites work: Alignment of trees -- an alternative to tree edit
cites work: Ordered and Unordered Tree Inclusion
cites work: Q4252025
cites work: Theoretical Computer Science
cites work: Computing similarity between RNA structures
cites work: Q4509227
cites work: The Tree-to-Tree Correction Problem
cites work: Comparing similar ordered trees in linear-time
cites work: Approximate string-matching with \(q\)-grams and maximal matches
cites work: Constrained tree inclusion
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
DOI: 10.1007/S00224-010-9274-7
description: scientific article; zbMATH DE number 5899599