89 search results - page 1 / 18 » Designing seeds for similarity search in genomic DNA |
RECOMB
2003
Springer
14 years 4 months ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
RECOMB
2004
Springer
14 years 4 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
BIBM
2009
IEEE
13 years 8 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
Growing interest in genomic research has resulted in the creation of huge biological sequence databases. In this paper, we present a hash-based pier model for efficient homology s...
BIRD
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...