Tree edit distance and maximum agreement subtree (Q458389): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Tree-to-Tree Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some MAX SNP-hard results concerning unordered labeled trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the editing distance between unordered labeled trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS / rank | |||
Normal rank | |||
Revision as of 02:35, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tree edit distance and maximum agreement subtree |
scientific article |
Statements
Tree edit distance and maximum agreement subtree (English)
0 references
7 October 2014
0 references
graph algorithms
0 references
pattern recognition
0 references
tree edit distance
0 references
maximum agreement subtree
0 references
0 references
0 references
