CPM
2009
Springer
14 years 18 days ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
COCOON
2009
Springer
14 years 18 days ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...
COCOON
2008
Springer
14 years 18 days ago
2008
Springer
CPM
2008
Springer
14 years 1 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
CPM
2008
Springer
14 years 1 months ago
2008
Springer
CPM
2008
Springer
14 years 1 months ago
2008
Springer
CPM
2008
Springer
14 years 1 months ago
2008
Springer
CPM
2008
Springer
14 years 1 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
CPM
2008
Springer
14 years 1 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
CPM
2008
Springer
14 years 1 months ago
2008
Springer