@Proceedings{gawrychowski_et_al:LIPIcs.CPM.2021,
title = {{LIPIcs, Volume 191, CPM 2021, Complete Volume}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {1--404},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021},
URN = {urn:nbn:de:0030-drops-139509},
doi = {10.4230/LIPIcs.CPM.2021},
annote = {Keywords: LIPIcs, Volume 191, CPM 2021, Complete Volume}
}
@InProceedings{gawrychowski_et_al:LIPIcs.CPM.2021.0,
author = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.0},
URN = {urn:nbn:de:0030-drops-139512},
doi = {10.4230/LIPIcs.CPM.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{bannai:LIPIcs.CPM.2021.1,
author = {Bannai, Hideo},
title = {{Repetitions in Strings: A "Constant" Problem}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.1},
URN = {urn:nbn:de:0030-drops-139523},
doi = {10.4230/LIPIcs.CPM.2021.1},
annote = {Keywords: Maximal repetitions, Squares, Lyndon words}
}
@InProceedings{koucky:LIPIcs.CPM.2021.2,
author = {Kouck\'{y}, Michal},
title = {{Computing Edit Distance}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.2},
URN = {urn:nbn:de:0030-drops-139534},
doi = {10.4230/LIPIcs.CPM.2021.2},
annote = {Keywords: edit distance, streaming algorithms, approximation algorithms, sketching}
}
@InProceedings{pisanti:LIPIcs.CPM.2021.3,
author = {Pisanti, Nadia},
title = {{On-Line Pattern Matching on D-Texts}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {3:1--3:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.3},
URN = {urn:nbn:de:0030-drops-139548},
doi = {10.4230/LIPIcs.CPM.2021.3},
annote = {Keywords: pattern matching, elastic-degenerate string, matrix multiplication}
}
@InProceedings{adamson_et_al:LIPIcs.CPM.2021.4,
author = {Adamson, Duncan and Gusev, Vladimir V. and Potapov, Igor and Deligkas, Argyrios},
title = {{Ranking Bracelets in Polynomial Time}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.4},
URN = {urn:nbn:de:0030-drops-139554},
doi = {10.4230/LIPIcs.CPM.2021.4},
annote = {Keywords: Bracelets, Ranking, Necklaces}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2021.5,
author = {Amir, Amihood and Boneh, Itai and Kondratovsky, Eitan},
title = {{The k-Mappability Problem Revisited}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.5},
URN = {urn:nbn:de:0030-drops-139566},
doi = {10.4230/LIPIcs.CPM.2021.5},
annote = {Keywords: Pattern Matching, Hamming Distance, Suffix Tree, Suffix Array}
}
@InProceedings{badkobeh_et_al:LIPIcs.CPM.2021.6,
author = {Badkobeh, Golnaz and Charalampopoulos, Panagiotis and Pissis, Solon P.},
title = {{Internal Shortest Absent Word Queries}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.6},
URN = {urn:nbn:de:0030-drops-139570},
doi = {10.4230/LIPIcs.CPM.2021.6},
annote = {Keywords: string algorithms, internal queries, shortest absent word, bit parallelism}
}
@InProceedings{bannai_et_al:LIPIcs.CPM.2021.7,
author = {Bannai, Hideo and K\"{a}rkk\"{a}inen, Juha and K\"{o}ppl, Dominik and Pi\k{a}tkowski, Marcin},
title = {{Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.7},
URN = {urn:nbn:de:0030-drops-139588},
doi = {10.4230/LIPIcs.CPM.2021.7},
annote = {Keywords: Burrows-Wheeler Transform, Lyndon words, Circular Suffix Array, Suffix Array Construction Algorithm}
}
@InProceedings{belazzougui_et_al:LIPIcs.CPM.2021.8,
author = {Belazzougui, Djamal and Kosolobov, Dmitry and Puglisi, Simon J. and Raman, Rajeev},
title = {{Weighted Ancestors in Suffix Trees Revisited}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.8},
URN = {urn:nbn:de:0030-drops-139594},
doi = {10.4230/LIPIcs.CPM.2021.8},
annote = {Keywords: suffix tree, weighted ancestors, irreducible LCP, deterministic substring hashing}
}
@InProceedings{bernardini_et_al:LIPIcs.CPM.2021.9,
author = {Bernardini, Giulia and Marchetti-Spaccamela, Alberto and Pissis, Solon P. and Stougie, Leen and Sweering, Michelle},
title = {{Constructing Strings Avoiding Forbidden Substrings}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.9},
URN = {urn:nbn:de:0030-drops-139604},
doi = {10.4230/LIPIcs.CPM.2021.9},
annote = {Keywords: string algorithms, forbidden strings, de Bruijn graphs, data sanitization}
}
@InProceedings{bille_et_al:LIPIcs.CPM.2021.10,
author = {Bille, Philip and G{\o}rtz, Inge Li and Pedersen, Max Rish{\o}j and Steiner, Teresa Anna},
title = {{Gapped Indexing for Consecutive Occurrences}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.10},
URN = {urn:nbn:de:0030-drops-139615},
doi = {10.4230/LIPIcs.CPM.2021.10},
annote = {Keywords: String indexing, two patterns, consecutive occurrences, conditional lower bound}
}
@InProceedings{bulteau_et_al:LIPIcs.CPM.2021.11,
author = {Bulteau, Laurent and Giraudo, Samuele and Vialette, St\'{e}phane},
title = {{Disorders and Permutations}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.11},
URN = {urn:nbn:de:0030-drops-139628},
doi = {10.4230/LIPIcs.CPM.2021.11},
annote = {Keywords: Permutation, Algorithm}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2021.12,
author = {Charalampopoulos, Panagiotis and Radoszewski, Jakub and Rytter, Wojciech and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Computing Covers of 2D-Strings}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.12},
URN = {urn:nbn:de:0030-drops-139635},
doi = {10.4230/LIPIcs.CPM.2021.12},
annote = {Keywords: 2D-string, cover, dynamic Klee’s measure problem}
}
@InProceedings{cobas_et_al:LIPIcs.CPM.2021.13,
author = {Cobas, Dustin and Gagie, Travis and Navarro, Gonzalo},
title = {{A Fast and Small Subsampled R-Index}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.13},
URN = {urn:nbn:de:0030-drops-139647},
doi = {10.4230/LIPIcs.CPM.2021.13},
annote = {Keywords: Pattern matching, r-index, compressed text indexing, repetitive text collections}
}
@InProceedings{dondi_et_al:LIPIcs.CPM.2021.14,
author = {Dondi, Riccardo and Sikora, Florian},
title = {{The Longest Run Subsequence Problem: Further Complexity Results}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.14},
URN = {urn:nbn:de:0030-drops-139652},
doi = {10.4230/LIPIcs.CPM.2021.14},
annote = {Keywords: Parameterized complexity, Kernelization, Approximation Hardness, Longest Subsequence}
}
@InProceedings{he_et_al:LIPIcs.CPM.2021.15,
author = {He, Meng and Kazi, Serikzhan},
title = {{Data Structures for Categorical Path Counting Queries}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.15},
URN = {urn:nbn:de:0030-drops-139662},
doi = {10.4230/LIPIcs.CPM.2021.15},
annote = {Keywords: data structures, weighted trees, path queries, categorical queries, coloured queries, categorical path counting, categorical path range counting}
}
@InProceedings{italiano_et_al:LIPIcs.CPM.2021.16,
author = {Italiano, Giuseppe F. and Prezza, Nicola and Sinaimeri, Blerina and Venturini, Rossano},
title = {{Compressed Weighted de Bruijn Graphs}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.16},
URN = {urn:nbn:de:0030-drops-139675},
doi = {10.4230/LIPIcs.CPM.2021.16},
annote = {Keywords: weighted de Bruijn graphs, k-mer annotation, compressed data structures, partial sums}
}
@InProceedings{khan:LIPIcs.CPM.2021.17,
author = {Khan, Shahbaz},
title = {{Optimal Construction of Hierarchical Overlap Graphs}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {17:1--17:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.17},
URN = {urn:nbn:de:0030-drops-139683},
doi = {10.4230/LIPIcs.CPM.2021.17},
annote = {Keywords: Hierarchical Overlap Graphs, String algorithms, Genome assembly}
}
@InProceedings{kim_et_al:LIPIcs.CPM.2021.18,
author = {Kim, Sung-Hwan and Cho, Hwan-Gue},
title = {{A Compact Index for Cartesian Tree Matching}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.18},
URN = {urn:nbn:de:0030-drops-139699},
doi = {10.4230/LIPIcs.CPM.2021.18},
annote = {Keywords: String Matching, Suffix Array, FM-index, Compact Index, Cartesian Tree Matching}
}
@InProceedings{mieno_et_al:LIPIcs.CPM.2021.19,
author = {Mieno, Takuya and Pissis, Solon P. and Stougie, Leen and Sweering, Michelle},
title = {{String Sanitization Under Edit Distance: Improved and Generalized}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.19},
URN = {urn:nbn:de:0030-drops-139709},
doi = {10.4230/LIPIcs.CPM.2021.19},
annote = {Keywords: string algorithms, data sanitization, edit distance, dynamic programming}
}
@InProceedings{nellore_et_al:LIPIcs.CPM.2021.20,
author = {Nellore, Abhinav and Nguyen, Austin and Thompson, Reid F.},
title = {{An Invertible Transform for Efficient String Matching in Labeled Digraphs}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.20},
URN = {urn:nbn:de:0030-drops-139717},
doi = {10.4230/LIPIcs.CPM.2021.20},
annote = {Keywords: pattern matching, string matching, Burrows-Wheeler transform, labeled graphs}
}
@InProceedings{nishimoto_et_al:LIPIcs.CPM.2021.21,
author = {Nishimoto, Takaaki and Tabei, Yasuo},
title = {{R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {21:1--21:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.21},
URN = {urn:nbn:de:0030-drops-139723},
doi = {10.4230/LIPIcs.CPM.2021.21},
annote = {Keywords: Enumeration algorithm, Burrows-Wheeler transform, Maximal repeats, Minimal unique substrings, Minimal absent words}
}
@InProceedings{park_et_al:LIPIcs.CPM.2021.22,
author = {Park, Sangsoo and Park, Sung Gwan and Cazaux, Bastien and Park, Kunsoo and Rivals, Eric},
title = {{A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {22:1--22:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.22},
URN = {urn:nbn:de:0030-drops-139736},
doi = {10.4230/LIPIcs.CPM.2021.22},
annote = {Keywords: overlap graph, hierarchical overlap graph, shortest superstring problem, border array}
}
@InProceedings{popa_et_al:LIPIcs.CPM.2021.23,
author = {Popa, Andrei and Popa, Alexandru},
title = {{Efficient Algorithms for Counting Gapped Palindromes}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {23:1--23:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.23},
URN = {urn:nbn:de:0030-drops-139746},
doi = {10.4230/LIPIcs.CPM.2021.23},
annote = {Keywords: pattern matching, gapped palindromes, suffix tree}
}
@InProceedings{sobel_et_al:LIPIcs.CPM.2021.24,
author = {Sobel, Joshua and Bertram, Noah and Ding, Chen and Nargesian, Fatemeh and Gildea, Daniel},
title = {{AWLCO: All-Window Length Co-Occurrence}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {24:1--24:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.24},
URN = {urn:nbn:de:0030-drops-139759},
doi = {10.4230/LIPIcs.CPM.2021.24},
annote = {Keywords: Itemsets, Data Sequences, Co-occurrence}
}
@InProceedings{yao_et_al:LIPIcs.CPM.2021.25,
author = {Yao, Keegan and Bansal, Mukul S.},
title = {{Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance}},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)},
pages = {25:1--25:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-186-3},
ISSN = {1868-8969},
year = {2021},
volume = {191},
editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.25},
URN = {urn:nbn:de:0030-drops-139769},
doi = {10.4230/LIPIcs.CPM.2021.25},
annote = {Keywords: Phylogenetic tree comparison, Robinson-Foulds Distance, Optimal tree completion, Algorithms, Dynamic programming}
}
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