Normalized similarity of RNA sequences

Rolf Backofen, Dan Hermelin, Gad M. Landau, Oren Weimann

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

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.

Original languageEnglish GB
Pages (from-to)360-369
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOIs
StatePublished - 1 Dec 2005
Externally publishedYes
Event12th International Conference on String Processing and Information Retrieval, SPIRE 2005 - Buenos Aires, Argentina
Duration: 2 Nov 20054 Nov 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Normalized similarity of RNA sequences'. Together they form a unique fingerprint.

Cite this