CPM 2016: Tel Aviv, Israel

• Roberto Grossi, Moshe Lewenstein:
  27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Front Matter, Table of Contents, Preface. 0:i-0:x
   download paper
• Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda:
  Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. 1:1-1:10
   download paper
• Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang:
  Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. 2:1-2:12
   download paper
• Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
  Encoding Two-Dimensional Range Top-k Queries. 3:1-3:11
   download paper
• Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski: Efficient Index for Weighted Sequences. 4:1-4:13
   download paper
• Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
  Faster Longest Common Extension Queries in Strings over General Alphabets. 5:1-5:13
   download paper
• Tsvi Kopelowitz, Ely Porat, Yaron Rozen:
  Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. 6:1-6:13
   download paper
• Guillaume Fertin, Christian Komusiewicz:
  Graph Motif Problems Parameterized by Dual. 7:1-7:12
   download paper
• Costas S. Iliopoulos, Jakub Radoszewski:
  Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. 8:1-8:12
   download paper
• Cyril Nicaud:
  Estimating Statistics on Words Using Ambiguous Descriptions. 9:1-9:12
   download paper
• Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták:
  Reconstruction of Trees from Jumbled and Weighted Subtrees. 10:1-10:13
   download paper
• Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer:
  A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem. 11:1-11:8
   download paper
• Yun Deng, David Fernández-Baca:
  Fast Compatibility Testing for Rooted Phylogenetic Trees. 12:1-12:12
   download paper
• Yi-Jun Chang:
  Hardness of RNA Folding Problem With Four Symbols. 13:1-13:12
   download paper
• Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk:
  Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. 14:1-14:12
   download paper
• Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu:
  Genomic Scaffold Filling Revisited. 15:1-15:13
   download paper
• Ron Shamir, Meirav Zehavi, Ron Zeira:
  A Linear-Time Algorithm for the Copy Number Transformation Problem. 16:1-16:13
   download paper
• Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson:
  On Almost Monge All Scores Matrices. 17:1-17:12
   download paper
• Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
  Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. 18:1-18:13
   download paper
• Sara Geizhals, Dina Sokol:
  Finding Maximal 2-Dimensional Palindromes. 19:1-19:12
   download paper
• Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj:
  Boxed Permutation Pattern Matching. 20:1-20:11
   download paper
• Tatiana A. Starikovskaya:
  Longest Common Substring with Approximately k Mismatches. 21:1-21:11
   download paper
• Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
  Fully-online Construction of Suffix Trees for Multiple Texts. 22:1-22:13
   download paper
• Uwe Baier:
  Linear-time Suffix Sorting - A New Approach for Suffix Array Construction. 23:1-23:12
   download paper
• Tsvi Kopelowitz, Robert Krauthgamer:
  Color-Distance Oracles and Snippets. 24:1-24:10
   download paper
• Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
  The Nearest Colored Node in a Tree. 25:1-25:12
   download paper
• Johannes Fischer, Dominik Köppl, Florian Kurpicz:
  On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. 26:1-26:11
   download paper
• Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
  Factorizing a String into Squares in Linear Time. 27:1-27:12
   download paper
• Tomasz Kociumaka:
  Minimal Suffix and Rotation of a Substring in Optimal Time. 28:1-28:12
   download paper
• Jérémy Barbay:
  Optimal Prefix Free Codes with Partial Sorting. 29:1-29:13
   download paper