|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 83 occurrences of 70 keywords
|
|
|
Results
Found 952 publication records. Showing 952 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Gonzalo Navarro 0001, Cristian Urbina |
L-Systems for Measuring Repetitiveness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 25:1-25:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
Optimal LZ-End Parsing Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 3:1-3:11, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gene Myers |
Merging Sorted Lists of Similar Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 22:1-22:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 0:1-0:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Köppl |
Encoding Hard String Problems with Answer Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 17:1-17:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
On the Impact of Morphisms on BWT-Runs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 10:1-10:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Bartlomiej Dudek 0001, Pawel Gawrychowski, Karol Pokorski |
Optimal Near-Linear Space Heaviest Induced Ancestors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 8:1-8:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Shunichi Tanaka |
Approximation Algorithms for the Longest Run Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 2:1-2:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba |
Suffix-Prefix Queries on a Dictionary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 21:1-21:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Cáceres |
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 7:1-7:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Bourhis, Aaron Boussidan, Philippe Gambette |
On Distances Between Words with Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 6:1-6:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen |
From Bit-Parallelism to Quantum String Matching for Labelled Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 9:1-9:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sung-Hwan Kim, Francisco Olivares, Nicola Prezza |
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 16:1-16:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner |
Compressed Indexing for Consecutive Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 12:1-12:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie |
MONI Can Find k-MEMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 26:1-26:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Diego Arroyuelo, Juan Pablo Castillo |
Trie-Compressed Adaptive Set Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 1:1-1:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau |
Order-Preserving Squares in Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 13:1-13:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Zsuzsanna Lipták (eds.) |
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 15:1-15:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gregory Kucherov, Steven Skiena |
Improving the Sensitivity of MinHash Through Hash-Value Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 20:1-20:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Johannes Fischer 0001, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen |
Sliding Window String Indexing in Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 4:1-4:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shinya Nagashita, Tomohiro I |
PalFM-Index: FM-Index for Palindrome Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 23:1-23:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag |
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 18:1-18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson 0001, Zara Lim, Wing-Kin Sung |
MUL-Tree Pruning for Consistency and Compatibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 14:1-14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Matan Kraus, Moshe Lewenstein, Alexandru Popa 0001, Ely Porat, Yonathan Sadia |
String Factorization via Prefix Free Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 19:1-19:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gonzalo Navarro 0001 |
Computing MEMs on Repetitive Text Collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 24:1-24:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa 0001 |
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 5:1-5:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba |
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France, pp. 11:1-11:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-276-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura |
Cartesian Tree Subsequence Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 14:1-14:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Rizzo 0001, Veli Mäkinen |
Indexable Elastic Founder Graphs of Minimum Height. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 19:1-19:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Diego Díaz-Domínguez, Gonzalo Navarro 0001 |
Efficient Construction of the BWT for Repetitive Text Using String Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 29:1-29:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski |
Longest Palindromic Substring in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 20:1-20:9, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette |
Permutation Pattern Matching for Doubly Partially Ordered Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 21:1-21:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Rectangular Tile Covers of 2D-Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 23:1-23:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Abhinav Nellore, Rachel A. Ward |
Arbitrary-Length Analogs to de Bruijn Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 9:1-9:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou |
Beyond the Longest Letter-Duplicated Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 7:1-7:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yuichi Asahiro, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Tadatoshi Utashima |
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 15:1-15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin 0001, Przemyslaw Uznanski |
The Dynamic k-Mismatch Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 18:1-18:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering |
On Strings Having the Same Length- k Substrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 16:1-16:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Mark Jones 0001, Rolf Niedermeier, Till Tantau |
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 6:1-6:11, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss |
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 17:1-17:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Linear-Time Computation of Shortest Covers of All Rotations of a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 22:1-22:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yuma Arakawa, Gonzalo Navarro 0001, Kunihiko Sadakane |
Bi-Directional r-Indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 11:1-11:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Avivit Levy, Ely Porat, B. Riva Shalom |
Partial Permutations Comparison, Maintenance and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 10:1-10:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 28:1-28:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann |
The Fine-Grained Complexity of Episode Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 4:1-4:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud |
Back-To-Front Online Lyndon Forest Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 13:1-13:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Jugé |
Reduction Ratio of the IS-Algorithm: Worst and Random Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 8:1-8:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Takehiro Ito |
Invitation to Combinatorial Reconfiguration (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 1:1-1:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering |
Making de Bruijn Graphs Eulerian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 12:1-12:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Davide Cenzato, Zsuzsanna Lipták |
A Theoretical and Experimental Analysis of BWT Variants for String Collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 25:1-25:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Jan Holub 0001 (eds.) |
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
1 | John M. Machacek |
Mechanical Proving with Walnut for Squares and Cubes in Partial Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 5:1-5:11, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jeffrey O. Shallit |
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 2:1-2:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sharma V. Thankachan |
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 3:1-3:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Philippe Gambette, Olga Seminck |
Reordering a Tree According to an Order on Its Leaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 24:1-24:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 0:1-0:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
Minimal Absent Words on Run-Length Encoded Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 27:1-27:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama |
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic., pp. 26:1-26:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-234-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nadia Pisanti |
On-Line Pattern Matching on D-Texts (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 3:1-3:2, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis |
Internal Shortest Absent Word Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 6:1-6:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dustin Cobas, Travis Gagie, Gonzalo Navarro 0001 |
A Fast and Small Subsampled R-Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 13:1-13:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski |
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 7:1-7:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals |
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 22:1-22:9, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Abhinav Nellore, Austin Nguyen, Reid F. Thompson |
An Invertible Transform for Efficient String Matching in Labeled Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 20:1-20:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Sobel, Noah Bertram, Chen Ding 0001, Fatemeh Nargesian, Daniel Gildea |
AWLCO: All-Window Length Co-Occurrence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 24:1-24:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 0:1-0:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Keegan Yao, Mukul S. Bansal |
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 25:1-25:23, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini |
Compressed Weighted de Bruijn Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 16:1-16:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas |
Ranking Bracelets in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 4:1-4:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Andrei Popa, Alexandru Popa 0001 |
Efficient Algorithms for Counting Gapped Palindromes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 23:1-23:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Itai Boneh, Eitan Kondratovsky |
The k-Mappability Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 5:1-5:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Shahbaz Khan 0004 |
Optimal Construction of Hierarchical Overlap Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 17:1-17:11, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai |
Repetitions in Strings: A "Constant" Problem (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 1:1-1:1, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michal Koucký 0001 |
Computing Edit Distance (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 2:1-2:1, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner |
Gapped Indexing for Consecutive Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 10:1-10:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sung-Hwan Kim, Hwan-Gue Cho |
A Compact Index for Cartesian Tree Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 18:1-18:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
Computing Covers of 2D-Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 12:1-12:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Tatiana Starikovskaya (eds.) |
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering |
String Sanitization Under Edit Distance: Improved and Generalized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 19:1-19:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Takaaki Nishimoto, Yasuo Tabei |
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 21:1-21:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering |
Constructing Strings Avoiding Forbidden Substrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 9:1-9:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Samuele Giraudo, Stéphane Vialette |
Disorders and Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 11:1-11:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Riccardo Dondi, Florian Sikora |
The Longest Run Subsequence Problem: Further Complexity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 14:1-14:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Meng He 0001, Serikzhan Kazi |
Data Structures for Categorical Path Counting Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 15:1-15:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman |
Weighted Ancestors in Suffix Trees Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland., pp. 8:1-8:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-186-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Nathan Schaar, Vincent Froese, Rolf Niedermeier |
Faster Binary Mean Computation Under Dynamic Time Warping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 28:1-28:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita |
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 23:1-23:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol |
Double String Tandem Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 3:1-3:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Paola Bonizzoni, Pawel Gawrychowski |
On Two Measures of Distance Between Fully-Labelled Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 6:1-6:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Lafond, Binhai Zhu, Peng Zou |
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 22:1-22:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed 0001, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Counting Distinct Patterns in Internal Dictionary Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 8:1-8:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 0:1-0:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
String Factorizations Under Various Collision Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 17:1-17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 26:1-26:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering |
String Sanitization Under Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 7:1-7:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Veli Mäkinen, Kristoffer Sahlin |
Chaining with Overlaps Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 25:1-25:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
Parameterized Algorithms for Matrix Completion with Radius Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 20:1-20:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya |
Approximating Longest Common Substring with k mismatches: Theory and Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 16:1-16:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 10:1-10:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 952 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|