Space efficient algorithms for ordered tree comparison

DOI10.1007/S00453-007-9100-ZzbMATH Open1203.68129OpenAlexW2171909018MaRDI QIDQ930598FDOQ930598

Kaizhong Zhang, Lusheng Wang

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

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

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)

Cites Work

• The Tree-to-Tree Correction Problem
• A survey on tree edit distance and related problems
• A linear space algorithm for computing maximal common subsequences
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Alignment of trees -- an alternative to tree edit
• Title not available (Why is that?)
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• 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)