Shape based indexing for faster search of RNA family databases
<p>Abstract</p> <p>Background</p> <p>Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally annotated RNA families. Unfortunately, searching for new family me...
Main Authors: | Reeder Jens, Janssen Stefan, Giegerich Robert |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2008-02-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/9/131 |
Similar Items
-
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
by: Giegerich Robert, et al.
Published: (2004-08-01) -
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
by: Rognes Torbjørn
Published: (2011-06-01) -
Query-dependent banding (QDB) for faster RNA similarity searches.
by: Eric P Nawrocki, et al.
Published: (2007-03-01) -
Complete probabilistic analysis of RNA shapes
by: Voß Björn, et al.
Published: (2006-02-01) -
A Faster Quick Search Algorithm
by: Jie Lin, et al.
Published: (2014-06-01)