Sciweavers

192 search results - page 25 / 39
» Combinatorics of RNA Secondary Structures
Sort
View
ISMB
2004
13 years 8 months ago
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy
Motivation: Non-coding RNAs (ncRNAs)--functional RNA molecules not coding for proteins--are grouped into hundreds of families of homologs. To find new members of an ncRNA gene fam...
Zasha Weinberg, Walter L. Ruzzo
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 2 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 1 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
CSB
2004
IEEE
142views Bioinformatics» more  CSB 2004»
13 years 11 months ago
FastR: Fast Database Search Tool for Non-Coding RNA
The discovery of novel non-coding RNAs has been among the most exciting recent developments in Biology. Yet, many more remain undiscovered. It has been hypothesized that there is ...
Vineet Bafna, Shaojie Zhang
IPPS
2009
IEEE
14 years 2 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans