Seed-Based Exclusion Method for Non-coding RNA Gene Search
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-based heuristics have been proved very efficient to accelerate the classical homology based search methods such as BLAST, we use a similar idea for RNA structures. We present an exclusion method for RNA search allowing for possible nucleotide insertion, deletion and substitution. It is based on a partition of the RNA stem-loops into consecutive seeds and a preprocessing of the target database. This algorithm can be used to improve time efficiency of current methods, and is guaranteed to find all occurrences that contain at least one exact seed.
Unable to display preview. Download preview PDF.
- 1.Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology 215, 403–410 (1990)Google Scholar
- 2.Bafna, V., Zhang, S.: FastR: Fast database search tool for non-coding RNA. In: Proceedings of IEEE Computational Systems Bioinformatics (CSB) Conference, pp. 52–61 (2004)Google Scholar
- 3.Eddy, S.R.: RNABOB: a program to search for RNA secondary structure motifs in sequence databases (1992), http://bioweb.pasteur.fr/docs/man/man/rnabob.1.html#toc1
- 7.Gautheret, D., Major, F., Cedergren, R.: Pattern searching/alignment with RNA primary and secondary structures. Comput. Appl. Biosci. 6(4), 325–331 (1990)Google Scholar
- 8.Klein, R., Eddy, S.: RESEARCH: Finding homologs of single structured RNA sequences (2003)Google Scholar
- 15.Sagot, M.F., Viari, A.: Flexible identification of structural objects in nucleic acid sequences: palindromes, mirror repeats, pseudoknots and triple helices. In: Hein, J., Apostolico, A. (eds.) Combinatorial Pattern Matching. LNCS, vol. 1264, pp. 224–246. Springer, Heidelberg (1997)Google Scholar