41 search results - page 7 / 9 » Fast Algorithms for Sorting and Searching Strings |
ALGORITHMICA
2010
13 years 6 months ago
2010
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
SIGMOD
2011
ACM
12 years 9 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
COCO
2003
Springer
13 years 11 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...