An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
From MaRDI portal
Publication:2015811
DOI10.1007/s10878-012-9552-1zbMath1291.90283OpenAlexW2063096021MaRDI QIDQ2015811
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9552-1
Cites Work
- Unnamed Item
- A survey on tree edit distance and related problems
- Geometric applications of a matrix-searching algorithm
- A data structure for dynamic trees
- Decomposition algorithms for the tree edit distance problem
- An optimal decomposition algorithm for tree edit distance
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Efficient Parallel Algorithms for String Editing and Related Problems
- The Tree-to-Tree Correction Problem
- The String-to-String Correction Problem