Abstract is missing.
- Algorithms for Forest Pattern MatchingKaizhong Zhang, Yunkun Zhu. 1-12 [doi]
- Affine Image Matching Is Uniform TC:::0:::-CompleteChristian Hundt. 13-25 [doi]
- Old and New in StringologyZvi Galil. 26 [doi]
- Small-Space 2D Compressed Dictionary MatchingShoshana Neuburger, Dina Sokol. 27-39 [doi]
- Bidirectional Search in a String with Wavelet TreesThomas Schnattinger, Enno Ohlebusch, Simon Gog. 40-50 [doi]
- A Minimal Periods Algorithm with ApplicationsZhi Xu. 51-62 [doi]
- The Property Suffix Tree with Dynamic PropertiesTsvi Kopelowitz. 63-75 [doi]
- Approximate All-Pairs Suffix/Prefix OverlapsNiko Välimäki, Susana Ladra, Veli Mäkinen. 76-87 [doi]
- Succinct Dictionary Matching with No SlowdownDjamal Belazzougui. 88-100 [doi]
- Pseudo-realtime Pattern Matching: Closing the GapRaphaël Clifford, Benjamin Sach. 101-111 [doi]
- Breakpoint Distance and PQ-TreesHaitao Jiang, Cedric Chauve, Binhai Zhu. 112-124 [doi]
- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval GraphsMinghui Jiang. 125-137 [doi]
- Succinct Representations of Separable GraphsGuy E. Blelloch, Arash Farzan. 138-150 [doi]
- Implicit Hitting Set Problems and Multi-genome AlignmentRichard M. Karp. 151 [doi]
- Bounds on the Minimum Mosaic of Population Sequences under RecombinationYufeng Wu. 152-163 [doi]
- The Highest Expected Reward Decoding for HMMs with Application to Recombination DetectionMichal Nánási, Tomás Vinar, Brona Brejová. 164-176 [doi]
- Phylogeny- and Parsimony-Based Haplotype Inference with ConstraintsMichael Elberfeld, Till Tantau. 177-189 [doi]
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic NetworksTetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente. 190-201 [doi]
- Mod/Resc Parsimony InferenceIgor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron, Marie-France Sagot. 202-213 [doi]
- Extended Islands of Tractability for Parsimony HaplotypingRudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu. 214-226 [doi]
- Sampled Longest Common Prefix ArrayJouni Sirén. 227-237 [doi]
- Verifying a Parameterized Border Array in ::::O::::(::::n:::::::1.5:::) TimeTomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 238-250 [doi]
- Cover Array String ReconstructionMaxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler. 251-259 [doi]
- Compression, Indexing, and Retrieval for Massive String DataWing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter. 260-274 [doi]
- Building the Minimal Automaton of ::::A:::::::*:::::::X:::: in Linear Time, When ::::X:::: Is of Bounded CardinalityOmar AitMous, Frédérique Bassino, Cyril Nicaud. 275-287 [doi]
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel ApproachDomenico Cantone, Simone Faro, Emanuele Giaquinta. 288-298 [doi]
- Algorithms for Three Versions of the Shortest Common Superstring ProblemMaxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 299-309 [doi]
- Finding Optimal Alignment and Consensus of Circular StringsTaehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim. 310-322 [doi]
- Optimizing Restriction Site Placement for Synthetic GenomesPablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena. 323-337 [doi]
- Extension and Faster Implementation of the GRP Transform for Lossless CompressionHidetoshi Yokoo. 338-347 [doi]
- Parallel and Distributed Compressed IndexesLuís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira. 348-360 [doi]