1623 search results - page 325 / 325 » No Sorting |
COCO
2003
Springer
13 years 10 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...
BMCBI
2011
13 years 12 days ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...