Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4607965 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal decomposition algorithm for tree edit distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Full and Linear Index of a Tree for Tree Patterns / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The tree-to-tree editing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Tree-to-Tree Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the editing distance between unordered labeled trees / rank | |||
Normal rank | |||
Latest revision as of 17:14, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inexact tree pattern matching with 1-degree edit distance using finite automata |
scientific article |
Statements
Inexact tree pattern matching with 1-degree edit distance using finite automata (English)
0 references
13 March 2023
0 references
inexact tree pattern matching
0 references
approximate tree pattern matching
0 references
1-degree edit distance
0 references
finite automaton
0 references
dynamic programming
0 references
