Constrained tree editing

DOI10.1016/0020-0255(94)90004-3MaRDI QIDQ1328503zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

graphstreeswebsstrings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• A constrained edit distance between unordered labeled trees
• A survey on tree edit distance and related problems
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• scientific article; zbMATH DE number 1305084
• scientific article; zbMATH DE number 1796978

Cites work

• A Tree-Matching Algorithm Based on Node Splitting and Merging
• A Tree-to-Tree Distance and Its Application to Cluster Analysis
• A common basis for similarity measures involving two strings†
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• Constrained string editing
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The String-to-String Correction Problem
• The Tree-to-Tree Correction Problem
• The tree-to-tree editing problem

Cited in

(7)

• scientific article; zbMATH DE number 1796978 (Why is no real title available?)
• 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)