| 965 | -- | 966 | Jan Holub. Foreword |
| 967 | -- | 984 | Simone Faro, Thierry Lecroq. Efficient Variants of the Backward-Oracle-Matching Algorithm |
| 985 | -- | 1004 | William F. Smyth, Shu Wang. An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings |
| 1005 | -- | 1023 | Pawel Baturo, Marcin Piatkowski, Wojciech Rytter. Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words |
| 1025 | -- | 1045 | Matthias Gallé, Pierre Peterlongo, François Coste. In-Place Update of Suffix Array while Recoding Words |
| 1047 | -- | 1068 | Manolis Christodoulakis, Gerhard Brey. Edit Distance with Combinations and Splits and its Applications in OCR Name Matching |
| 1069 | -- | 1086 | Wikus Coetser, Derrick G. Kourie, Bruce W. Watson. On Regular Expression Hashing to Reduce FA Size |
| 1087 | -- | 1108 | Domenico Cantone, Salvatore Cristofaro, Simone Faro. New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval |
| 1109 | -- | 1133 | Jie Lin, Yue Jiang, Don Adjeroh. The Virtual Suffix Tree |
| 1135 | -- | 1146 | Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara. Average Value of Sum of Exponents of Runs in a String |
| 1147 | -- | 1160 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang. Preemptive Scheduling Algorithms with Nested Processing Set restriction |