Constrained tree editing
From MaRDI portal
Publication:1328503
DOI10.1016/0020-0255(94)90004-3zbMATH Open0821.68100DBLPjournals/isci/OommenL94OpenAlexW2154035520WikidataQ60328196 ScholiaQ60328196MaRDI QIDQ1328503FDOQ1328503
Authors: V. Pereyra 
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
Recommendations
Cites Work
- The Tree-to-Tree Correction Problem
- The String-to-String Correction Problem
- A Tree-Matching Algorithm Based on Node Splitting and Merging
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The tree-to-tree editing problem
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- A common basis for similarity measures involving two strings†
- Recognition of Noisy Subsequences Using Constrained Edit Distances
- Constrained string editing
Cited In (7)
- Title not available (Why is that?)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Fast algorithms for the unit cost editing distance between trees
- Covering tree with stars
- A constrained edit distance algorithm between semi-ordered trees
- A new constrained edit distance between quotiented ordered trees
- A constrained edit distance between unordered labeled trees
This page was built for publication: Constrained tree editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328503)
