Space efficient algorithms for ordered tree comparison

DOI10.1007/S00453-007-9100-ZMaRDI QIDQ930598zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Kaizhong Zhang

Publication date 1 July 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9100-z

zbMATH Keywords

Alignment of treesConstrained tree edit distanceSpace efficient algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Algorithms and Computation
• Comparing similar ordered trees in linear-time
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• Algorithms and Computation
• More Efficient Algorithm for Ordered Tree Inclusion
• scientific article; zbMATH DE number 1615276
• Efficient search algorithm on compact S-trees
• Optimal algorithms for comparing trees with labeled leaves

Cites work

• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• A linear space algorithm for computing maximal common subsequences
• A survey on tree edit distance and related problems
• Alignment of trees -- an alternative to tree edit
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• The tree-to-tree editing problem

Cited in

(2)

• Algorithms and Computation
• More Efficient Algorithm for Ordered Tree Inclusion

This page was built for publication: Space efficient algorithms for ordered tree comparison

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