nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A brief history of parameterized matching problems
|
Mendivelso, Juan |
|
|
274 |
C |
p. 103-115 |
artikel |
2 |
Accelerated partial decoding in wavelet trees
|
Baruch, Gilad |
|
|
274 |
C |
p. 2-10 |
artikel |
3 |
A formal framework for Stringology
|
Soltys, Michael |
|
|
274 |
C |
p. 141-151 |
artikel |
4 |
A resource-frugal probabilistic dictionary and applications in bioinformatics
|
Marchet, Camille |
|
|
274 |
C |
p. 92-102 |
artikel |
5 |
Direct merging of delta encoded files
|
Shapira, Dana |
|
|
274 |
C |
p. 130-140 |
artikel |
6 |
Dynamic determination of variable sizes of chunks in a deduplication system
|
Hirsch, Michael |
|
|
274 |
C |
p. 81-91 |
artikel |
7 |
Dynamic index and LZ factorization in compressed space
|
Nishimoto, Takaaki |
|
|
274 |
C |
p. 116-129 |
artikel |
8 |
Editorial Board
|
|
|
|
274 |
C |
p. ii |
artikel |
9 |
Generating all minimal petri net unsolvable binary words
|
Erofeev, Evgeny |
|
|
274 |
C |
p. 35-53 |
artikel |
10 |
Improved online algorithms for jumbled matching
|
Ghuman, Sukhpal Singh |
|
|
274 |
C |
p. 54-66 |
artikel |
11 |
On approximate enhanced covers under Hamming distance
|
Guth, Ondřej |
|
|
274 |
C |
p. 67-80 |
artikel |
12 |
On the computational complexity of closest genome problems
|
Cunha, Luís Felipe I. |
|
|
274 |
C |
p. 26-34 |
artikel |
13 |
Preface: Stringology Algorithms
|
Holub, Jan |
|
|
274 |
C |
p. 1 |
artikel |
14 |
The order-preserving pattern matching problem in practice
|
Cantone, Domenico |
|
|
274 |
C |
p. 11-25 |
artikel |