The tree-to-tree editing problem (Q1251477): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching Sequences under Deletion/Insertion Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for the String Editing Problem / rank | |||
Normal rank | |||
Latest revision as of 23:39, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tree-to-tree editing problem |
scientific article |
Statements
The tree-to-tree editing problem (English)
0 references
1977
0 references
Algorithmic Theory of Measure
0 references
Recursive Algorithms
0 references
Edit Operations
0 references
