LIPIcs, Volume 54, CPM 2016

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