default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th CPM 2016: Tel Aviv, Israel
- Roberto Grossi, Moshe Lewenstein:
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. LIPIcs 54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-012-5 - Front Matter, Table of Contents, Preface. 0:i-0:x
- 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 - 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 - Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries. 3:1-3:11 - Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. 4:1-4:13 - Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. 5:1-5:13 - Tsvi Kopelowitz, Ely Porat, Yaron Rozen:
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. 6:1-6:13 - Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. 7:1-7:12 - Costas S. Iliopoulos, Jakub Radoszewski:
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. 8:1-8:12 - Cyril Nicaud:
Estimating Statistics on Words Using Ambiguous Descriptions. 9:1-9:12 - Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták:
Reconstruction of Trees from Jumbled and Weighted Subtrees. 10:1-10:13 - 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 - Yun Deng, David Fernández-Baca:
Fast Compatibility Testing for Rooted Phylogenetic Trees. 12:1-12:12 - Yi-Jun Chang:
Hardness of RNA Folding Problem With Four Symbols. 13:1-13:12 - Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk:
Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost. 14:1-14:12 - Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu:
Genomic Scaffold Filling Revisited. 15:1-15:13 - Ron Shamir, Meirav Zehavi, Ron Zeira:
A Linear-Time Algorithm for the Copy Number Transformation Problem. 16:1-16:13 - Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson:
On Almost Monge All Scores Matrices. 17:1-17:12 - Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski:
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. 18:1-18:13 - Sara H. Geizhals, Dina Sokol:
Finding Maximal 2-Dimensional Palindromes. 19:1-19:12 - Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Boxed Permutation Pattern Matching. 20:1-20:11 - Tatiana Starikovskaya:
Longest Common Substring with Approximately k Mismatches. 21:1-21:11 - Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online Construction of Suffix Trees for Multiple Texts. 22:1-22:13 - Uwe Baier:
Linear-time Suffix Sorting - A New Approach for Suffix Array Construction. 23:1-23:12 - Tsvi Kopelowitz, Robert Krauthgamer:
Color-Distance Oracles and Snippets. 24:1-24:10 - Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The Nearest Colored Node in a Tree. 25:1-25:12 - Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. 26:1-26:11 - Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
Factorizing a String into Squares in Linear Time. 27:1-27:12 - Tomasz Kociumaka:
Minimal Suffix and Rotation of a Substring in Optimal Time. 28:1-28:12 - Jérémy Barbay:
Optimal Prefix Free Codes with Partial Sorting. 29:1-29:13
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 00:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
