Space efficient algorithms for ordered tree comparison
From MaRDI portal
Publication:930598
DOI10.1007/s00453-007-9100-zzbMath1203.68129OpenAlexW2171909018MaRDI QIDQ930598
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
Cites Work
- Unnamed Item
- A survey on tree edit distance and related problems
- Alignment of trees -- an alternative to tree edit
- The tree-to-tree editing problem
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A linear space algorithm for computing maximal common subsequences
- The Tree-to-Tree Correction Problem
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
This page was built for publication: Space efficient algorithms for ordered tree comparison