List of Accepted Papers

Haitao Jiang, Cedric Chauve and Binhai Zhu. Breakpoint distance and PQ-trees
Maxime Crochemore, Costas Iliopoulos, Solon Pissis and German Tischler. Cover array string reconstruction
Michael Elberfeld and Till Tantau. Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
Zhi Xu. A Minimal Periods Algorithm with Applications
Mathias Weller, Johannes Uhlmann, Rudolf Fleischer, Yihui Wang, Xi Wu, Jiong Guo and Rolf Niedermeier. Extended Islands of Tractability for Pasimony Haplotyping
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara and Gabriel Valiente. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
Christian Hundt. Affine Image Matching is uniform TC0-complete
Shoshana Neuburger and Dina Sokol. Small-Space 2D Compressed Dictionary Matching
Hidetoshi Yokoo. Extension and Faster Implementation of the GRP Transform for Lossless Compression
Minghui Jiang. On the parameterized complexity of some optimization problems related to multiple-interval graphs
Omar AitMous, Frédérique Bassino and Cyril Nicaud. Building the Minimal Automaton of A^*X in Linear Time, When X Is of Bounded Cardinality
Jouni Sirén. Sampled Longest Common Prefix Array
Luis M. S. Russo and Arlindo Oliveira. Parallel and Distributed Compressed Indexes
Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Verifying a Parameterized Border Array in O(n^{1.5}) Time
Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Algorithms for Three Versions of the Shortest Common Superstring Problem
Djamal Belazzougui. Succinct Dictionary Matching With No Slowdown
Yufeng Wu. Bounds on the Minimum Mosaic of Population Sequences Under Recombination
Thomas Schnattinger, Enno Ohlebusch and Simon Gog. Bidirectional search in a string with wavelet trees
Benjamin Sach and Raphael Clifford. Pseudo-realtime Pattern Matching: Closing the Gap
Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park and Jeong Seop Sim. Finding Optimal Alignment and Consensus of Circular Strings
Michal Nanasi, Tomas Vinar and Brona Brejova. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Marie-France Sagot, Igor Nor and Danny Hermelin. Mod/Resc Parsimony Inference
Simone Faro, Domenico Cantone and Emanuele Giaquinta. A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
Tsvi Kopelowitz. The Property Suffix Tree with Dynamic Properties
Kaizhong Zhang and Yunkun Zhu. Algorithms for Forest Pattern Matching
Arash Farzan and Guy Blelloch. Succinct Representations of Separable Graphs
Pablo Montes, Heraldo Memelli, Charles Ward and Steven Skiena. Optimizing Restriction Site Placement for Synthetic Genomes
Niko Välimäki and Veli Mäkinen. Approximate All-Pairs Suffix/Prefix Overlaps