1567 search results - page 277 / 314 » Compressing Relations and Indexes |
JCB
2006
13 years 10 months ago
2006
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
SIAMDM
1998
13 years 9 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
TSD
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
BMCBI
2010
13 years 7 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...