Journal of Discrete Algorithms, Volume 3

Volume 3, Number 1, March 2005

Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich:
Optimizing a constrained convex polygonal annulus. 1-26
Electronic Edition (link) BibTeX
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Partially dynamic maintenance of minimum weight hyperpaths. 27-46
Electronic Edition (link) BibTeX
Xiao Zhou, Yuki Matsuo, Takao Nishizeki:
List total colorings of series-parallel graphs. 47-60
Electronic Edition (link) BibTeX
Ingo Wegener, Carsten Witt:
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. 61-78
Electronic Edition (link) BibTeX
William Duckworth, David Manlove, Michele Zito:
On the approximability of the maximum induced matching problem. 79-91
Electronic Edition (link) BibTeX
Tomasz Luczak, Eric Vigoda:
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. 92-100
Electronic Edition (link) BibTeX
David Peleg, Uri Pincas:
Virtual path layouts optimizing total hop count on ATM tree networks. 101-112
Electronic Edition (link) BibTeX
Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Efficient algorithms for Koblitz curves over fields of characteristic three. 113-124
Electronic Edition (link) BibTeX

Combinatorial Pattern Matching (CPM) Special Issue

Indexing strings

Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Constructing suffix arrays in linear time. 126-142
Electronic Edition (link) BibTeX
Pang Ko, Srinivas Aluru:
Space efficient linear time construction of suffix arrays. 143-156
Electronic Edition (link) BibTeX
Gonzalo Navarro, Erkki Sutinen, Jorma Tarhio:
Indexing text with approximate q-grams. 157-175
Electronic Edition (link) BibTeX
Raphaël Clifford:
Distributed suffix trees. 176-197
Electronic Edition (link) BibTeX

String matching

Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata. 198-214
Electronic Edition (link) BibTeX
Heikki Hyyrö:
Bit-parallel approximate string matching algorithms with transposition. 215-229
Electronic Edition (link) BibTeX
Nadia Nedjah, Luiza de Macedo Mourelle:
More efficient left-to-right matching for overlapping pattern. 230-247
Electronic Edition (link) BibTeX
Kjell Lemström, Veli Mäkinen:
On minimizing pattern splitting in multi-track string matching. 248-266
Electronic Edition (link) BibTeX
Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzon:
Practical algorithms for transposition-invariant string-matching. 267-292
Electronic Edition (link) BibTeX

Algorithms for bioinformatics

Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre:
Extracting approximate patterns. 293-320
Electronic Edition (link) BibTeX
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Chaining algorithms for multiple genome comparison. 321-341
Electronic Edition (link) BibTeX
Maria Emilia Telles Walter, Mauro C. Sobrinho, Eugenia T. G. Oliveira, Lorena S. Soares, Adilton G. Oliveira, Thelmo E. S. Martins, Tiago M. Fonseca:
Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach. 342-361
Electronic Edition (link) BibTeX
Olivier Elemento, Olivier Gascuel:
An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees. 362-374
Electronic Edition (link) BibTeX
Behshad Behzadi, Jean-Marc Steyaert:
An improved algorithm for generalized comparison of minisatellites. 375-389
Electronic Edition (link) BibTeX