@Proceedings{karkkainen_et_al:LIPIcs.CPM.2017,
title = {{LIPIcs, Volume 78, CPM'17, Complete Volume}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017},
URN = {urn:nbn:de:0030-drops-75091},
doi = {10.4230/LIPIcs.CPM.2017},
annote = {Keywords: Data Structures, Data Storage Representations, Coding and Information Theory, Theory of Computation, Discrete Mathematics, Information Systems,}
}
@InProceedings{karkkainen_et_al:LIPIcs.CPM.2017.0,
author = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
title = {{Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.0},
URN = {urn:nbn:de:0030-drops-73178},
doi = {10.4230/LIPIcs.CPM.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers}
}
@InProceedings{manzini:LIPIcs.CPM.2017.1,
author = {Manzini, Giovanni},
title = {{Wheeler Graphs: Variations on a Theme by Burrows and Wheeler}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.1},
URN = {urn:nbn:de:0030-drops-73343},
doi = {10.4230/LIPIcs.CPM.2017.1},
annote = {Keywords: compressed data structures, pattern matching}
}
@InProceedings{jez:LIPIcs.CPM.2017.2,
author = {Jez, Artur},
title = {{Recompression of SLPs}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.2},
URN = {urn:nbn:de:0030-drops-73475},
doi = {10.4230/LIPIcs.CPM.2017.2},
annote = {Keywords: Straight Line Programs, smallest grammar problem, compression, pro- cessing compressed data, recompression}
}
@InProceedings{mucha:LIPIcs.CPM.2017.3,
author = {Mucha, Marcin},
title = {{Shortest Superstring}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.3},
URN = {urn:nbn:de:0030-drops-73483},
doi = {10.4230/LIPIcs.CPM.2017.3},
annote = {Keywords: shortest superstring, approximation algorithms}
}
@InProceedings{navarro:LIPIcs.CPM.2017.4,
author = {Navarro, Gonzalo},
title = {{Document Listing on Repetitive Collections with Guaranteed Performance}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.4},
URN = {urn:nbn:de:0030-drops-73268},
doi = {10.4230/LIPIcs.CPM.2017.4},
annote = {Keywords: repetitive string collections, document listing, grammar compression, range minimum queries, succinct data structures}
}
@InProceedings{gagie_et_al:LIPIcs.CPM.2017.5,
author = {Gagie, Travis and He, Meng and Navarro, Gonzalo},
title = {{Path Queries on Functions}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.5},
URN = {urn:nbn:de:0030-drops-73274},
doi = {10.4230/LIPIcs.CPM.2017.5},
annote = {Keywords: succinct data structures, integer functions, range queries, trees and permutations}
}
@InProceedings{bille_et_al:LIPIcs.CPM.2017.6,
author = {Bille, Philip and G{\o}rtz, Inge Li and Skjoldjensen, Frederik Rye},
title = {{Deterministic Indexing for Packed Strings}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {6:1--6:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.6},
URN = {urn:nbn:de:0030-drops-73351},
doi = {10.4230/LIPIcs.CPM.2017.6},
annote = {Keywords: suffix tree, suffix array, deterministic algorithm, word packing}
}
@InProceedings{belazzougui_et_al:LIPIcs.CPM.2017.7,
author = {Belazzougui, Djamal and Cunial, Fabio},
title = {{Representing the Suffix Tree with the CDAWG}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.7},
URN = {urn:nbn:de:0030-drops-73402},
doi = {10.4230/LIPIcs.CPM.2017.7},
annote = {Keywords: CDAWG, suffix tree, heavy path decomposition, maximal repeat, context-free grammar}
}
@InProceedings{diptarama_et_al:LIPIcs.CPM.2017.8,
author = {Diptarama, Diptarama and Katsura, Takashi and Otomo, Yuhei and Narisawa, Kazuyuki and Shinohara, Ayumi},
title = {{Position Heaps for Parameterized Strings}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.8},
URN = {urn:nbn:de:0030-drops-73396},
doi = {10.4230/LIPIcs.CPM.2017.8},
annote = {Keywords: string matching, indexing structure, parameterized pattern matching, position heap}
}
@InProceedings{grossi_et_al:LIPIcs.CPM.2017.9,
author = {Grossi, Roberto and Iliopoulos, Costas S. and Liu, Chang and Pisanti, Nadia and Pissis, Solon P. and Retha, Ahmad and Rosone, Giovanna and Vayani, Fatima and Versari, Luca},
title = {{On-Line Pattern Matching on Similar Texts}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.9},
URN = {urn:nbn:de:0030-drops-73379},
doi = {10.4230/LIPIcs.CPM.2017.9},
annote = {Keywords: string algorithms, pattern matching, degenerate strings, elastic-degenerate strings, on-line algorithms}
}
@InProceedings{dudek_et_al:LIPIcs.CPM.2017.10,
author = {Dudek, Bartlomiej and Gawrychowski, Pawel and Ostropolski-Nalewaja, Piotr},
title = {{A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.10},
URN = {urn:nbn:de:0030-drops-73458},
doi = {10.4230/LIPIcs.CPM.2017.10},
annote = {Keywords: approximation scheme, minimum common string partition, local search}
}
@InProceedings{komusiewicz_et_al:LIPIcs.CPM.2017.11,
author = {Komusiewicz, Christian and de Oliveira Oliveira, Mateus and Zehavi, Meirav},
title = {{Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.11},
URN = {urn:nbn:de:0030-drops-73436},
doi = {10.4230/LIPIcs.CPM.2017.11},
annote = {Keywords: comparative genomics, parameterized complexity, kernelization}
}
@InProceedings{bringmann_et_al:LIPIcs.CPM.2017.12,
author = {Bringmann, Karl and Wellnitz, Philip},
title = {{Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.12},
URN = {urn:nbn:de:0030-drops-73329},
doi = {10.4230/LIPIcs.CPM.2017.12},
annote = {Keywords: conditional lower bounds, k-Clique, parsing, tree-adjoining grammars}
}
@InProceedings{starikovskaya:LIPIcs.CPM.2017.13,
author = {Starikovskaya, Tatiana},
title = {{Communication and Streaming Complexity of Approximate Pattern Matching}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {13:1--13:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.13},
URN = {urn:nbn:de:0030-drops-73206},
doi = {10.4230/LIPIcs.CPM.2017.13},
annote = {Keywords: approximate pattern matching, edit distance, randomised algorithms, streaming algorithms, communication complexity}
}
@InProceedings{castelli_et_al:LIPIcs.CPM.2017.14,
author = {Castelli, Mauro and Dondi, Riccardo and Mauri, Giancarlo and Zoppis, Italo},
title = {{The Longest Filled Common Subsequence Problem}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.14},
URN = {urn:nbn:de:0030-drops-73293},
doi = {10.4230/LIPIcs.CPM.2017.14},
annote = {Keywords: longest common subsequence, approximation algorithms, computational complexity, fixed-parameter algorithms}
}
@InProceedings{bille_et_al:LIPIcs.CPM.2017.15,
author = {Bille, Philip and Cording, Patrick Hagge and Fischer, Johannes and G{\o}rtz, Inge Li},
title = {{Lempel-Ziv Compression in a Sliding Window}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {15:1--15:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.15},
URN = {urn:nbn:de:0030-drops-73316},
doi = {10.4230/LIPIcs.CPM.2017.15},
annote = {Keywords: Lempel-Ziv parsing, sliding window, rightmost matching}
}
@InProceedings{bille_et_al:LIPIcs.CPM.2017.16,
author = {Bille, Philip and Ettienne, Mikko Berggren and G{\o}rtz, Inge Li and Vildh{\o}j, Hjalte Wedel},
title = {{Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.16},
URN = {urn:nbn:de:0030-drops-73254},
doi = {10.4230/LIPIcs.CPM.2017.16},
annote = {Keywords: compressed indexing, pattern matching, LZ77, prefix search}
}
@InProceedings{policriti_et_al:LIPIcs.CPM.2017.17,
author = {Policriti, Alberto and Prezza, Nicola},
title = {{From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {17:1--17:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.17},
URN = {urn:nbn:de:0030-drops-73215},
doi = {10.4230/LIPIcs.CPM.2017.17},
annote = {Keywords: Lempel-Ziv, Burrows-Wheeler transform, compressed computation, repetitive text collections}
}
@InProceedings{i:LIPIcs.CPM.2017.18,
author = {I, Tomohiro},
title = {{Longest Common Extensions with Recompression}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.18},
URN = {urn:nbn:de:0030-drops-73234},
doi = {10.4230/LIPIcs.CPM.2017.18},
annote = {Keywords: Longest Common Extension (LCE) queries, compressed data structure, grammar compressed strings, Straight-Line Program (SLP)}
}
@InProceedings{cunha_et_al:LIPIcs.CPM.2017.19,
author = {Cunha, Lu{\'\i}s and Dantas, Simone and Gagie, Travis and Wittler, Roland and Kowada, Luis and Stoye, Jens},
title = {{Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {19:1--19:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.19},
URN = {urn:nbn:de:0030-drops-73418},
doi = {10.4230/LIPIcs.CPM.2017.19},
annote = {Keywords: string algorithms, indexing, jumbled pattern matching, run-length encoding}
}
@InProceedings{kuboi_et_al:LIPIcs.CPM.2017.20,
author = {Kuboi, Keita and Fujishige, Yuta and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Faster STR-IC-LCS Computation via RLE}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {20:1--20:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.20},
URN = {urn:nbn:de:0030-drops-73335},
doi = {10.4230/LIPIcs.CPM.2017.20},
annote = {Keywords: longest common subsequence, STR-IC-LCS, run-length encoding}
}
@InProceedings{duchon_et_al:LIPIcs.CPM.2017.21,
author = {Duchon, Philippe and Nicaud, Cyril and Pivoteau, Carine},
title = {{Gapped Pattern Statistics}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.21},
URN = {urn:nbn:de:0030-drops-73309},
doi = {10.4230/LIPIcs.CPM.2017.21},
annote = {Keywords: combinatorics on words, alpha-gapped repeats, random words, memoryless sources, analytic combinatorics}
}
@InProceedings{bannai_et_al:LIPIcs.CPM.2017.22,
author = {Bannai, Hideo and Inenaga, Shunsuke and K\"{o}ppl, Dominik},
title = {{Computing All Distinct Squares in Linear Time for Integer Alphabets}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.22},
URN = {urn:nbn:de:0030-drops-73224},
doi = {10.4230/LIPIcs.CPM.2017.22},
annote = {Keywords: tandem repeats, distinct squares, counting algorithms}
}
@InProceedings{borozdin_et_al:LIPIcs.CPM.2017.23,
author = {Borozdin, Kirill and Kosolobov, Dmitry and Rubinchik, Mikhail and Shur, Arseny M.},
title = {{Palindromic Length in Linear Time}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {23:1--23:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.23},
URN = {urn:nbn:de:0030-drops-73389},
doi = {10.4230/LIPIcs.CPM.2017.23},
annote = {Keywords: palindrome, palindromic length, palindromic factorization, online}
}
@InProceedings{mieno_et_al:LIPIcs.CPM.2017.24,
author = {Mieno, Takuya and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Tight Bounds on the Maximum Number of Shortest Unique Substrings}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {24:1--24:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.24},
URN = {urn:nbn:de:0030-drops-73460},
doi = {10.4230/LIPIcs.CPM.2017.24},
annote = {Keywords: shortest unique substrings, maximal unique substrings}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2017.25,
author = {Amir, Amihood and Levy, Avivit and Lewenstein, Moshe and Lubin, Ronit and Porat, Benny},
title = {{Can We Recover the Cover?}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.25},
URN = {urn:nbn:de:0030-drops-73190},
doi = {10.4230/LIPIcs.CPM.2017.25},
annote = {Keywords: periodicity, quasi-periodicity, cover, approximate cover, data recovery}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2017.26,
author = {Amir, Amihood and Levy, Avivit and Lubin, Ronit and Porat, Ely},
title = {{Approximate Cover of Strings}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.26},
URN = {urn:nbn:de:0030-drops-73189},
doi = {10.4230/LIPIcs.CPM.2017.26},
annote = {Keywords: periodicity, quasi-periodicity, cover, approximate cover}
}
@InProceedings{bulteau_et_al:LIPIcs.CPM.2017.27,
author = {Bulteau, Laurent and Fertin, Guillaume and Komusiewicz, Christian},
title = {{Beyond Adjacency Maximization: Scaffold Filling for New String Distances}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.27},
URN = {urn:nbn:de:0030-drops-73364},
doi = {10.4230/LIPIcs.CPM.2017.27},
annote = {Keywords: computational biology, strings, FPT algorithms, kernelization}
}
@InProceedings{lafond_et_al:LIPIcs.CPM.2017.28,
author = {Lafond, Manuel and Scornavacca, Celine},
title = {{On the Weighted Quartet Consensus Problem}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.28},
URN = {urn:nbn:de:0030-drops-73284},
doi = {10.4230/LIPIcs.CPM.2017.28},
annote = {Keywords: phylogenetic tree, consensus tree, quartets, complexity, fixed-parameter tractability}
}
@InProceedings{cairo_et_al:LIPIcs.CPM.2017.29,
author = {Cairo, Massimo and Medvedev, Paul and Obscura Acosta, Nidia and Rizzi, Romeo and Tomescu, Alexandru I.},
title = {{Optimal Omnitig Listing for Safe and Complete Contig Assembly}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {29:1--29:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.29},
URN = {urn:nbn:de:0030-drops-73423},
doi = {10.4230/LIPIcs.CPM.2017.29},
annote = {Keywords: genome assembly, graph algorithm, edge-covering walk, strong bridge}
}
@InProceedings{pibiri_et_al:LIPIcs.CPM.2017.30,
author = {Pibiri, Giulio Ermanno and Venturini, Rossano},
title = {{Dynamic Elias-Fano Representation}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.30},
URN = {urn:nbn:de:0030-drops-73244},
doi = {10.4230/LIPIcs.CPM.2017.30},
annote = {Keywords: succinct data structures, integer sets, predecessor problem, Elias-Fano}
}
@InProceedings{barbay_et_al:LIPIcs.CPM.2017.31,
author = {Barbay, J\'{e}r\'{e}my and Ochoa, Carlos and Satti, Srinivasa Rao},
title = {{Synergistic Solutions on MultiSets}},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-039-2},
ISSN = {1868-8969},
year = {2017},
volume = {78},
editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.31},
URN = {urn:nbn:de:0030-drops-73441},
doi = {10.4230/LIPIcs.CPM.2017.31},
annote = {Keywords: deferred data structure, multivariate analysis, quick sort, select}
}
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