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