Sciweavers

136 search results - page 3 / 28
» The ed-tree: An Index for Large DNA Sequence Databases
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
Ordered index seed algorithm for intensive DNA sequence comparison
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
Dominique Lavenier
BMCBI
2006
145views more  BMCBI 2006»
13 years 7 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 7 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
SIGMOD
2004
ACM
109views Database» more  SIGMOD 2004»
14 years 7 months ago
Piers: An Efficient Model for Similarity Search in DNA Sequence Databases
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...
Xia Cao, Shuai Cheng Li, Beng Chin Ooi, Anthony K....
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
13 years 11 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...