Shape based indexing for faster search of RNA family databases

• Published in: BMC bioinformatics Vol. 9; no. 1; p. 131
• Main Authors: Janssen, Stefan, Reeder, Jens, Giegerich, Robert
• Format: Journal Article
• Language: English
• Published: London BioMed Central 29.02.2008; BioMed Central Ltd; BMC
• Subjects: Algorithms; Base Sequence; Bioinformatics; Biomedical and Life Sciences; Computational Biology/Bioinformatics; Computer Appl. in Life Sciences; Database Management Systems; Databases, Genetic; DNA sequencing; Information Storage and Retrieval - methods; Life Sciences; Microarrays; Molecular Sequence Data; Nucleotide sequencing; Research Article; RNA; RNA - genetics; Sequence Alignment - methods; Sequence Analysis, RNA - methods; Germany; Common Shape; Consensus Structure; Abstraction Level; Folding Energy; Hide Markov Model
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/1471-2105-9-131

Background 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 members using covariance models (CMs) is very time consuming. Filtering approaches that use the sequence conservation to reduce the number of CM searches, are fast, but it is unknown to which sacrifice. Results We present a new filtering approach, which exploits the family specific secondary structure and significantly reduces the number of CM searches. The filter eliminates approximately 85% of the queries and discards only 2.6% true positives when evaluating Rfam against itself. First results also capture previously undetected non-coding RNAs in a recent human RNAz screen. Conclusion The RNA s hape i ndex f ilter ( RNAsifter ) is based on the following rationale: An RNA family is characterised by structure, much more succinctly than by sequence content. Structures of individual family members, which naturally have different length and sequence composition, may exhibit structural variation in detail, but overall, they have a common shape in a more abstract sense. Given a fixed release of the Rfam data base, we can compute these abstract shapes for all families. This is called a shape index. If a query sequence belongs to a certain family, it must be able to fold into the family shape with reasonable free energy. Therefore, rather than matching the query against all families in the data base, we can first (and quickly) compute its feasible shape(s), and use the shape index to access only those families where a good match is possible due to a common shape with the query.