Sciweavers

55 search results - page 10 / 11
» Fast index for approximate string matching
Sort
View
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
14 years 27 days ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
EDBT
2004
ACM
121views Database» more  EDBT 2004»
14 years 6 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
BMCBI
2008
123views more  BMCBI 2008»
13 years 6 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...