no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Computing the Burrows–Wheeler transform of a string and its reverse in parallel
|
Ohlebusch, Enno |
|
2014 |
25 |
C |
p. 21-33 13 p. |
article |
2 |
Computing the rooted triplet distance between galled trees by counting triangles
|
Jansson, Jesper |
|
2014 |
25 |
C |
p. 66-78 13 p. |
article |
3 |
Editorial
|
Stoye, Jens |
|
2014 |
25 |
C |
p. 1- 1 p. |
article |
4 |
Editorial Board
|
|
|
2014 |
25 |
C |
p. iii-iv nvt p. |
article |
5 |
Efficient exponential-time algorithms for edit distance between unordered trees
|
Akutsu, Tatsuya |
|
2014 |
25 |
C |
p. 79-93 15 p. |
article |
6 |
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms
|
Dondi, Riccardo |
|
2014 |
25 |
C |
p. 51-65 15 p. |
article |
7 |
Simple and efficient LZW-compressed multiple pattern matching
|
Gawrychowski, Paweł |
|
2014 |
25 |
C |
p. 34-41 8 p. |
article |
8 |
Time–space trade-offs for longest common extensions
|
Bille, Philip |
|
2014 |
25 |
C |
p. 42-50 9 p. |
article |
9 |
Wavelet trees for all
|
Navarro, Gonzalo |
|
2014 |
25 |
C |
p. 2-20 19 p. |
article |