Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The Longest Common Subsequence Problem for Arc-Annotated Sequences
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Computing Similarity Between RNA Secondary Structures
INTSYS '98 Proceedings of the IEEE International Joint Symposia on Intelligence and Systems
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
A survey on tree edit distance and related problems
Theoretical Computer Science
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
| Hi-index | 0.00 |
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An $\mathcal{O}(n^{2}m{\rm lg}m)$ time algorithm is presented for computing the maximum normalized score of two RNA sequences, where n and m are the lengths of the sequences and n ≤ m. This algorithm has the same time complexity as the currently best known global LCS algorithm.