Pages that link to "Item:Q5750416"
From MaRDI portal
The following pages link to Fast algorithms for the unit cost editing distance between trees (Q5750416):
Displaying 11 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- A parallel tree difference algorithm (Q673225) (← links)
- A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
- (Q5002720) (← links)
- A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression. (Q5090362) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)
- Approximation and special cases of common subtrees and editing distance (Q6487427) (← links)
