Constrained tree editing
From MaRDI portal
Publication:1328503
DOI10.1016/0020-0255(94)90004-3zbMath0821.68100WikidataQ60328196 ScholiaQ60328196MaRDI QIDQ1328503
Publication date: 19 September 1995
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(94)90004-3
Cites Work
- Constrained string editing
- The tree-to-tree editing problem
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A Tree-Matching Algorithm Based on Node Splitting and Merging
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Recognition of Noisy Subsequences Using Constrained Edit Distances
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
- A common basis for similarity measures involving two strings†
- The Tree-to-Tree Correction Problem
- The String-to-String Correction Problem