scispace - formally typeset
Proceedings ArticleDOI

Edit distance between two RNA structures

TLDR
The notion of edit distance is proposed to measure the similarity between two RNA secondary and tertiary structures, by incorporating the various edit operations performing on both bases and arcs (base-pairs).
Abstract
Arc-annotated sequences are useful in representiug the structural information of RNA sequences. Typically, RNA secondary and tertiary structures could be represented by a set of nested arcs and a set of crossing arcs, respectively. As the specified RNA functions are determined by the specified molecular confirmation and therefore the specified secondary and tertiary structures, the comparison between RNA secondary and tertiary structures have received much attention recently. In this paper, we propose the notion of edit distance to measure the similarity between two RNA secondary and tertiary structures, by incorporating the various edit operations performing on both bases and arcs (base-pairs). Several algorithms are presented to compute the edit distance two RNA sequences with various arc structures and under various score schemes, either exactly or approximately. Preliminary experimental tests confirm that our definition of edit distance and the computation model are among the most reasonable ones ever studied in the literature.

read more

Citations
More filters
Journal ArticleDOI

MARNA: multiple alignment and consensus structure prediction of RNAs based on sequence structure comparisons

TL;DR: A novel approach for multiple alignment of RNAs (MARNA) taking into consideration both the primary and the secondary structures is described, based on pairwise sequence-structure comparisons of RN as well as a consistency based multiple alignment method.
Journal ArticleDOI

Variations on RNA folding and alignment: lessons from Benasque.

TL;DR: A series of variations on standard methods that implement refined biophysical models, such as a restriction of RNA folding to canonical structures, and an extension of structural alignments to an explicit scoring of stacking propensities are discussed.
Journal ArticleDOI

Analysis of the Internal Transcribed Spacer 2 (ITS2) Region of Scuticociliates and Related Taxa (Ciliophora, Oligohymenophorea) to Infer their Evolution and Phylogeny

TL;DR: The ITS2 (ITS--internal transcribed spacer) region of the rDNA in 11 representative scuticociliates and two ambiguously related genera was analyzed and found that the secondary structure information could help to improve alignment and utilize appropriately phylogenetic strategies.
Journal ArticleDOI

A method for aligning RNA secondary structures and its application to RNA motif detection

TL;DR: RSmatch compares favorably with other tools for RNA structure alignment and motif detection and shall be useful to researchers interested in comparing RNA structures obtained from wet lab experiments or RNA folding programs, particularly when the size of the structure dataset is large.
Journal ArticleDOI

DIAL: a web server for the pairwise alignment of two RNA three-dimensional structures using nucleotide, dihedral angle and base-pairing similarities

TL;DR: DIAL achieves quadratic time by performing an alignment that accounts for pseudo-dihedral and/or dihedral angle similarity, nucleotide sequence similarity and nucleotide base-pairing similarity.
References
More filters
Journal ArticleDOI

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

TL;DR: This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
Book

Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology

TL;DR: In this paper, the authors introduce suffix trees and their use in sequence alignment, core string edits, alignments and dynamic programming, and extend the core problems to extend the main problems.

Algorithms on strings, trees, and sequences

Dan Gusfield
TL;DR: Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand.
Related Papers (5)