nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A computational framework for determining run-maximal strings
|
Baker, Andrew |
|
2013 |
20 |
C |
p. 43-50 8 p. |
artikel |
2 |
A note on a simple computation of the maximal suffix of a string
|
Adamczyk, Zbigniew |
|
2013 |
20 |
C |
p. 61-64 4 p. |
artikel |
3 |
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
|
Moosa, Johra Muhammad |
|
2013 |
20 |
C |
p. 12-20 9 p. |
artikel |
4 |
Editorial Board
|
|
|
2013 |
20 |
C |
p. iii-iv nvt p. |
artikel |
5 |
Fine-tuning the search for microsatellites
|
de Ridder, C. |
|
2013 |
20 |
C |
p. 21-37 17 p. |
artikel |
6 |
Infinite words containing the minimal number of repetitions
|
Badkobeh, Golnaz |
|
2013 |
20 |
C |
p. 38-42 5 p. |
artikel |
7 |
On-line construction of position heaps
|
Kucherov, Gregory |
|
2013 |
20 |
C |
p. 3-11 9 p. |
artikel |
8 |
On parsing optimality for dictionary-based text compression—the Zip case
|
Langiu, Alessio |
|
2013 |
20 |
C |
p. 65-70 6 p. |
artikel |
9 |
StringMasters 2011 Special Issue
|
Crochemore, Maxime |
|
2013 |
20 |
C |
p. 1-2 2 p. |
artikel |
10 |
Tree template matching in unranked ordered trees
|
Christou, Michalis |
|
2013 |
20 |
C |
p. 51-60 10 p. |
artikel |