Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73545-8_6 | COCOON |
Keywords | Field | DocType |
rna structure,seed-based exclusion method,conserved sequence,classical homology,target database,rna family,non-coding rna gene search,genomic database,rna search,consecutive seed,search method,rna stem-loops,nucleotides,non coding rna,stem loop | RNA,Conserved sequence,Combinatorics,Gene,Computer science,Heuristics,Preprocessor,Homology (biology),Bioinformatics,Computational biology,Partition (number theory),Non-coding RNA | Conference |
Volume | ISSN | ISBN |
4598 | 0302-9743 | 3-540-73544-5 |
Citations | PageRank | References |
2 | 0.37 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Eudes Duchesne | 1 | 5 | 0.80 |
| Mathieu Giraud | 2 | 124 | 15.28 |
| Nadia El-Mabrouk | 3 | 512 | 41.88 |