Abstract
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2m 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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Backofen, R., Hermelin, D., Landau, G. M., & Weimann, O. (2005). Normalized similarity of RNA sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3772 LNCS, pp. 360–369). https://doi.org/10.1007/11575832_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
