@Proceedings{grtz_et_al:LIPIcs.CPM.2020,
title = {{LIPIcs, Volume 161, CPM 2020, Complete Volume}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {1--418},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020},
URN = {urn:nbn:de:0030-drops-121245},
doi = {10.4230/LIPIcs.CPM.2020},
annote = {Keywords: LIPIcs, Volume 161, CPM 2020, Complete Volume}
}
@InProceedings{grtz_et_al:LIPIcs.CPM.2020.0,
author = {G{\o}rtz, Inge Li and Weimann, Oren},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.0},
URN = {urn:nbn:de:0030-drops-121252},
doi = {10.4230/LIPIcs.CPM.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{husfeldt:LIPIcs.CPM.2020.1,
author = {Husfeldt, Thore},
title = {{Algebraic Algorithms for Finding Patterns in Graphs}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.1},
URN = {urn:nbn:de:0030-drops-121261},
doi = {10.4230/LIPIcs.CPM.2020.1},
annote = {Keywords: paths, exterior algebra, wedge product, color-coding, parameterized complexity}
}
@InProceedings{alzamel_et_al:LIPIcs.CPM.2020.2,
author = {Alzamel, Mai and Conte, Alessio and Denzumi, Shuhei and Grossi, Roberto and Iliopoulos, Costas S. and Kurita, Kazuhiro and Wasa, Kunihiro},
title = {{Finding the Anticover of a String}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {2:1--2:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.2},
URN = {urn:nbn:de:0030-drops-121270},
doi = {10.4230/LIPIcs.CPM.2020.2},
annote = {Keywords: Anticover, String algorithms, Stringology, NP-complete}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2020.3,
author = {Amir, Amihood and Butman, Ayelet and Landau, Gad M. and Marcus, Shoshana and Sokol, Dina},
title = {{Double String Tandem Repeats}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {3:1--3:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.3},
URN = {urn:nbn:de:0030-drops-121283},
doi = {10.4230/LIPIcs.CPM.2020.3},
annote = {Keywords: double string, tandem repeat, 2-dimensional, scale}
}
@InProceedings{belazzougui_et_al:LIPIcs.CPM.2020.4,
author = {Belazzougui, Djamal and Kucherov, Gregory},
title = {{Efficient Tree-Structured Categorical Retrieval}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.4},
URN = {urn:nbn:de:0030-drops-121299},
doi = {10.4230/LIPIcs.CPM.2020.4},
annote = {Keywords: pattern matching, document retrieval, category tree, space-efficient data structures}
}
@InProceedings{bennun_et_al:LIPIcs.CPM.2020.5,
author = {Ben-Nun, Stav and Golan, Shay and Kociumaka, Tomasz and Kraus, Matan},
title = {{Time-Space Tradeoffs for Finding a Long Common Substring}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.5},
URN = {urn:nbn:de:0030-drops-121302},
doi = {10.4230/LIPIcs.CPM.2020.5},
annote = {Keywords: longest common substring, time-space tradeoff, local consistency, periodicity}
}
@InProceedings{bernardini_et_al:LIPIcs.CPM.2020.6,
author = {Bernardini, Giulia and Bonizzoni, Paola and Gawrychowski, Pawe{\l}},
title = {{On Two Measures of Distance Between Fully-Labelled Trees}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.6},
URN = {urn:nbn:de:0030-drops-121318},
doi = {10.4230/LIPIcs.CPM.2020.6},
annote = {Keywords: Tree distance, Cancer progression, Approximation algorithms, Fine-grained complexity}
}
@InProceedings{bernardini_et_al:LIPIcs.CPM.2020.7,
author = {Bernardini, Giulia and Chen, Huiping and Loukides, Grigorios and Pisanti, Nadia and Pissis, Solon P. and Stougie, Leen and Sweering, Michelle},
title = {{String Sanitization Under Edit Distance}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.7},
URN = {urn:nbn:de:0030-drops-121324},
doi = {10.4230/LIPIcs.CPM.2020.7},
annote = {Keywords: String algorithms, data sanitization, edit distance, dynamic programming, conditional lower bound}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2020.8,
author = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Mohamed, Manal and Radoszewski, Jakub and Rytter, Wojciech and Straszy\'{n}ski, Juliusz and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Counting Distinct Patterns in Internal Dictionary Matching}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.8},
URN = {urn:nbn:de:0030-drops-121336},
doi = {10.4230/LIPIcs.CPM.2020.8},
annote = {Keywords: dictionary matching, internal pattern matching, squares}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2020.9,
author = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Mozes, Shay},
title = {{Dynamic String Alignment}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {9:1--9:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.9},
URN = {urn:nbn:de:0030-drops-121344},
doi = {10.4230/LIPIcs.CPM.2020.9},
annote = {Keywords: string alignment, edit distance, longest common subsequence, (unit-)Monge matrices, (min,+)-product}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2020.10,
author = {Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Unary Words Have the Smallest Levenshtein k-Neighbourhoods}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.10},
URN = {urn:nbn:de:0030-drops-121359},
doi = {10.4230/LIPIcs.CPM.2020.10},
annote = {Keywords: combinatorics on words, Levenshtein distance, edit distance}
}
@InProceedings{commins_et_al:LIPIcs.CPM.2020.11,
author = {Commins, Patty and Liben-Nowell, David and Liu, Tina and Tomlinson, Kiran},
title = {{Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.11},
URN = {urn:nbn:de:0030-drops-121367},
doi = {10.4230/LIPIcs.CPM.2020.11},
annote = {Keywords: edit distance, tree reconstruction, information propagation, chain letters}
}
@InProceedings{funakoshi_et_al:LIPIcs.CPM.2020.12,
author = {Funakoshi, Mitsuru and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki and Shinohara, Ayumi},
title = {{Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {12:1--12:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.12},
URN = {urn:nbn:de:0030-drops-121375},
doi = {10.4230/LIPIcs.CPM.2020.12},
annote = {Keywords: string algorithms, pattern matching, bit parallelism, subsequences, cadences}
}
@InProceedings{ganguly_et_al:LIPIcs.CPM.2020.13,
author = {Ganguly, Arnab and Gibney, Daniel and Hooshmand, Sahar and K\"{u}lekci, M. O\u{g}uzhan and Thankachan, Sharma V.},
title = {{FM-Index Reveals the Reverse Suffix Array}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.13},
URN = {urn:nbn:de:0030-drops-121388},
doi = {10.4230/LIPIcs.CPM.2020.13},
annote = {Keywords: Data Structures, Suffix Trees, String Algorithms, Compression, Burrows - Wheeler transform, FM-Index}
}
@InProceedings{gawrychowski_et_al:LIPIcs.CPM.2020.14,
author = {Gawrychowski, Pawe{\l} and Ghazawi, Samah and Landau, Gad M.},
title = {{On Indeterminate Strings Matching}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.14},
URN = {urn:nbn:de:0030-drops-121393},
doi = {10.4230/LIPIcs.CPM.2020.14},
annote = {Keywords: string matching, indeterminate strings, Cartesian trees, order-preserving matching, parameterized matching}
}
@InProceedings{golan_et_al:LIPIcs.CPM.2020.15,
author = {Golan, Shay and Kociumaka, Tomasz and Kopelowitz, Tsvi and Porat, Ely},
title = {{The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.15},
URN = {urn:nbn:de:0030-drops-121406},
doi = {10.4230/LIPIcs.CPM.2020.15},
annote = {Keywords: Streaming pattern matching, Hamming distance, k-mismatch}
}
@InProceedings{gourdel_et_al:LIPIcs.CPM.2020.16,
author = {Gourdel, Garance and Kociumaka, Tomasz and Radoszewski, Jakub and Starikovskaya, Tatiana},
title = {{Approximating Longest Common Substring with k mismatches: Theory and Practice}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.16},
URN = {urn:nbn:de:0030-drops-121410},
doi = {10.4230/LIPIcs.CPM.2020.16},
annote = {Keywords: approximation algorithms, string similarity, LSH, conditional lower bounds}
}
@InProceedings{gruttemeier_et_al:LIPIcs.CPM.2020.17,
author = {Gr\"{u}ttemeier, Niels and Komusiewicz, Christian and Morawietz, Nils and Sommer, Frank},
title = {{String Factorizations Under Various Collision Constraints}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.17},
URN = {urn:nbn:de:0030-drops-121428},
doi = {10.4230/LIPIcs.CPM.2020.17},
annote = {Keywords: NP-hard problem, fixed-parameter algorithms, collision-aware string partitioning}
}
@InProceedings{kedzierski_et_al:LIPIcs.CPM.2020.18,
author = {K\k{e}dzierski, Aleksander and Radoszewski, Jakub},
title = {{k-Approximate Quasiperiodicity under Hamming and Edit Distance}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.18},
URN = {urn:nbn:de:0030-drops-121437},
doi = {10.4230/LIPIcs.CPM.2020.18},
annote = {Keywords: approximate cover, approximate seed, enhanced cover, Hamming distance, edit distance}
}
@InProceedings{kipouridis_et_al:LIPIcs.CPM.2020.19,
author = {Kipouridis, Evangelos and Tsichlas, Kostas},
title = {{Longest Common Subsequence on Weighted Sequences}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.19},
URN = {urn:nbn:de:0030-drops-121443},
doi = {10.4230/LIPIcs.CPM.2020.19},
annote = {Keywords: WLCS, LCS, weighted sequences, approximation algorithms, lower bound}
}
@InProceedings{koana_et_al:LIPIcs.CPM.2020.20,
author = {Koana, Tomohiro and Froese, Vincent and Niedermeier, Rolf},
title = {{Parameterized Algorithms for Matrix Completion with Radius Constraints}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.20},
URN = {urn:nbn:de:0030-drops-121456},
doi = {10.4230/LIPIcs.CPM.2020.20},
annote = {Keywords: fixed-parameter tractability, consensus string problems, Closest String, Closest String with Wildcards}
}
@InProceedings{koppl_et_al:LIPIcs.CPM.2020.21,
author = {K\"{o}ppl, Dominik and Hashimoto, Daiki and Hendrian, Diptarama and Shinohara, Ayumi},
title = {{In-Place Bijective Burrows-Wheeler Transforms}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.21},
URN = {urn:nbn:de:0030-drops-121463},
doi = {10.4230/LIPIcs.CPM.2020.21},
annote = {Keywords: In-Place Algorithms, Burrows-Wheeler transform, Lyndon words}
}
@InProceedings{lafond_et_al:LIPIcs.CPM.2020.22,
author = {Lafond, Manuel and Zhu, Binhai and Zou, Peng},
title = {{Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.22},
URN = {urn:nbn:de:0030-drops-121471},
doi = {10.4230/LIPIcs.CPM.2020.22},
annote = {Keywords: Computational genomics, cancer genomics, copy number profiles, NP-hardness, approximation algorithms, FPT algorithms}
}
@InProceedings{matsuda_et_al:LIPIcs.CPM.2020.23,
author = {Matsuda, Kotaro and Sadakane, Kunihiko and Starikovskaya, Tatiana and Tateshita, Masakazu},
title = {{Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {23:1--23:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.23},
URN = {urn:nbn:de:0030-drops-121482},
doi = {10.4230/LIPIcs.CPM.2020.23},
annote = {Keywords: Orthogonal Range Search, Succinct Data Structure, Suffix Array}
}
@InProceedings{munro_et_al:LIPIcs.CPM.2020.24,
author = {Munro, J. Ian and Navarro, Gonzalo and Nekrich, Yakov},
title = {{Text Indexing and Searching in Sublinear Time}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.24},
URN = {urn:nbn:de:0030-drops-121497},
doi = {10.4230/LIPIcs.CPM.2020.24},
annote = {Keywords: data structures, string indexes}
}
@InProceedings{makinen_et_al:LIPIcs.CPM.2020.25,
author = {M\"{a}kinen, Veli and Sahlin, Kristoffer},
title = {{Chaining with Overlaps Revisited}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {25:1--25:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.25},
URN = {urn:nbn:de:0030-drops-121500},
doi = {10.4230/LIPIcs.CPM.2020.25},
annote = {Keywords: Sparse Dynamic Programming, Chaining, Maximal Exact Matches, Longest Common Subsequence}
}
@InProceedings{nakashima_et_al:LIPIcs.CPM.2020.26,
author = {Nakashima, Katsuhito and Fujisato, Noriki and Hendrian, Diptarama and Nakashima, Yuto and Yoshinaka, Ryo and Inenaga, Shunsuke and Bannai, Hideo and Shinohara, Ayumi and Takeda, Masayuki},
title = {{DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.26},
URN = {urn:nbn:de:0030-drops-121512},
doi = {10.4230/LIPIcs.CPM.2020.26},
annote = {Keywords: parameterized matching, suffix trees, DAWGs, suffix automata}
}
@InProceedings{papelange:LIPIcs.CPM.2020.27,
author = {Pape-Lange, Julian},
title = {{On Extensions of Maximal Repeats in Compressed Strings}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.27},
URN = {urn:nbn:de:0030-drops-121523},
doi = {10.4230/LIPIcs.CPM.2020.27},
annote = {Keywords: Maximal repeats, Extensions of maximal repeats, Combinatorics on compressed strings, LZ77, Burrows-Wheeler transform, Burrows-Wheeler transform conjecture, Compact suffix automata, CDAWGs}
}
@InProceedings{schaar_et_al:LIPIcs.CPM.2020.28,
author = {Schaar, Nathan and Froese, Vincent and Niedermeier, Rolf},
title = {{Faster Binary Mean Computation Under Dynamic Time Warping}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.28},
URN = {urn:nbn:de:0030-drops-121538},
doi = {10.4230/LIPIcs.CPM.2020.28},
annote = {Keywords: consensus string problems, time series averaging, minimum 1-separated sum, sparse strings}
}
@InProceedings{uznanski:LIPIcs.CPM.2020.29,
author = {Uzna\'{n}ski, Przemys{\l}aw},
title = {{Approximating Text-To-Pattern Distance via Dimensionality Reduction}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {29:1--29:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {G{\o}rtz, Inge Li and Weimann, Oren},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.29},
URN = {urn:nbn:de:0030-drops-121542},
doi = {10.4230/LIPIcs.CPM.2020.29},
annote = {Keywords: Approximate Pattern Matching, 𝓁₂ Distance, 𝓁₁ Distance, Hamming Distance, Approximation Algorithms, Combinatorial Algorithms}
}
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