List of Accepted Papers (in no particular order)

Jing Xiao, Lusheng Wang, Xiaowen Liu and Tao Jiang.
Finding Additive Biclusters with Random Background.

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy and Ely Porat.
Approximate String Matching with Address Bit Errors.

Bin Ma.
Why Greed Works for Shortest Common Superstring Problem.

Zvi Gotthilf, Danny Hermelin and Moshe Lewenstein.
Constrained LCS: Hardness and Approximation.

Leszek Gasieniec, Cindy Y. Li and Meng Zhang.
Faster algorithm for the set variant of the string barcoding problem.

Johannes Fischer, Veli Mäkinen and Gonzalo Navarro.
An(other) Entropy-Bounded Compressed Suffix Tree.

Mathias Möhl, Sebastian Will and Rolf Backofen.
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots.

Luis M. S. Russo, Gonzalo Navarro and Arlindo Oliveira.
Dynamic Fully-Compressed Suffix Trees.

Roman Kolpakov and Gregory Kucherov.
Searching for Gapped Palindromes.

Ge Nong, Sen Zhang and Wai Hong Chan.
Computing Inverse ST In Linear Complexity.

Igor Nitto and Rossano Venturini.
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices.

Christian Hundt and Maciej Liskiewicz.
Two-dimensional pattern matching with combined scaling and rotation.

Shuai Cheng Li, Dongbo Bu, Jinbo Xu and Ming Li.
Finding Largest Well-predicted Subset of Protein Structure Models.

Wojciech Fraczak, Wojciech Rytter and Mohammadreza Yazdani.
Matching Integer Intervals by Minimal Sets of Binary Words with "don't cares".

Martin Farach-Colton and Yang Huang.
A Linear Delay Algorithm for Building Concept Lattices.

Shay Mozes, Dekel Tsur, Oren Weimann and Michal Ziv-Ukelson.
Fast Algorithms for Computing Tree LCS.

Christian Komusiewicz, Rolf Niedermeier, Nadja Betzler and Michael Fellows.
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.

Marcos Kiwi, Gonzalo Navarro and Claudio Telha.
On-line Approximate String Matching with Bounded Errors.

Raphael Clifford, Klim Efremenko, Benny Porat and Ely Porat.
A black box for online approximate pattern matching.

Orgad Keller, Tsvi Kopelowitz and Moshe Lewenstein.
On the Longest Common Parameterized Subsequence.

Tobias Marschall and Sven Rahmann.
Probabilistic Arithmetic Automata and their Application to Pattern Matching Statistics.

Diego Arroyuelo.
An Improved Succinct Representation for Dynamic k-ary Trees.

Anne Bergeron, Julia Mixtacki and Jens Stoye.
HP Distance via Double Cut and Join Distance.

Julien Fayolle.
Analysis of the Size of the Antidictionary in DCA.

Maxime Crochemore, Lucian Ilie and Liviu Tinta.
Towards a solution to the "runs" conjecture.