default search action
Journal of Discrete Algorithms, Volume 25
Volume 25, March 2014
- Jens Stoye, Juha Kärkkäinen:
Editorial. 1 - Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. 21-33 - Pawel Gawrychowski:
Simple and efficient LZW-compressed multiple pattern matching. 34-41 - Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-space trade-offs for longest common extensions. 42-50 - Riccardo Dondi, Nadia El-Mabrouk, Krister M. Swenson:
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms. 51-65 - Jesper Jansson, Andrzej Lingas:
Computing the rooted triplet distance between galled trees by counting triangles. 66-78 - Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu:
Efficient exponential-time algorithms for edit distance between unordered trees. 79-93
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.