default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th CPM 2017: Warsaw, Poland
- Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter:
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017. LIPIcs 78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-039-2 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. 0:i-0:xvi
- Giovanni Manzini:
Wheeler Graphs: Variations on a Theme by Burrows and Wheeler. 1:1-1:1 - Artur Jez
:
Recompression of SLPs. 2:1-2:1 - Marcin Mucha:
Shortest Superstring. 3:1-3:1 - Gonzalo Navarro:
Document Listing on Repetitive Collections with Guaranteed Performance. 4:1-4:13 - Travis Gagie, Meng He, Gonzalo Navarro:
Path Queries on Functions. 5:1-5:15 - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. 6:1-6:11 - Djamal Belazzougui, Fabio Cunial:
Representing the Suffix Tree with the CDAWG. 7:1-7:13 - Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara:
Position Heaps for Parameterized Strings. 8:1-8:13 - Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. 9:1-9:14 - Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja:
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. 10:1-10:14 - Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. 11:1-11:17 - Karl Bringmann, Philip Wellnitz:
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. 12:1-12:14 - Tatiana Starikovskaya:
Communication and Streaming Complexity of Approximate Pattern Matching. 13:1-13:11 - Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The Longest Filled Common Subsequence Problem. 14:1-14:13 - Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz:
Lempel-Ziv Compression in a Sliding Window. 15:1-15:11 - Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. 16:1-16:17 - Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. 17:1-17:10 - Tomohiro I:
Longest Common Extensions with Recompression. 18:1-18:15 - Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis A. B. Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. 19:1-19:9 - Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS Computation via RLE. 20:1-20:12 - Philippe Duchon, Cyril Nicaud, Carine Pivoteau:
Gapped Pattern Statistics. 21:1-21:12 - Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. 22:1-22:18 - Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur:
Palindromic Length in Linear Time. 23:1-23:12 - Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. 24:1-24:11 - Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. 25:1-25:15 - Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. 26:1-26:14 - Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. 27:1-27:17 - Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus Problem. 28:1-28:18 - Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. 29:1-29:12 - Giulio Ermanno Pibiri, Rossano Venturini:
Dynamic Elias-Fano Representation. 30:1-30:14 - Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Solutions on MultiSets. 31:1-31:14
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-12-09 23:24 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:
