17 search results - page 2 / 4 » Linear work suffix array construction |
ENTCS
2006
13 years 4 months ago
2006
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
FOCS
2009
IEEE
13 years 8 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
DISOPT
2007
13 years 4 months ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...