166 search results - page 23 / 34 » Suffix trees for very large genomic sequences |
SIGMOD
2004
ACM
15 years 12 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...
116
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are signif...
109
click to vote
DASFAA
2003
IEEE
15 years 5 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
81
Voted
ECCB
2005
IEEE
15 years 5 months ago
2005
IEEE
Similarity Matrix of Proteins (SIMAP) (http://mips.gsf. 10 de/simap) provides a database based on a precomputed similarity matrix covering the similarity space formed by .4 millio...
98
Voted
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...