No. |
Title |
Author |
Year |
1 |
Approximating Longest Common Substring with k mismatches: Theory and Practice |
Gourdel, Garance et al. |
2020 |
2 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |
3 |
Efficient Computation of 2-Covers of a String |
Radoszewski, Jakub et al. |
2020 |
4 |
k-Approximate Quasiperiodicity under Hamming and Edit Distance |
Kędzierski, Aleksander et al. |
2020 |
5 |
The Number of Repetitions in 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2020 |
6 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |
7 |
Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2019 |
8 |
Longest Common Substring Made Fully Dynamic |
Amir, Amihood et al. |
2019 |
9 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
10 |
Quasi-Periodicity in Streams |
Gawrychowski, Pawel et al. |
2019 |
11 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
12 |
String Periods in the Order-Preserving Model |
Gourdel, Garance et al. |
2018 |
13 |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers |
Kärkkäinen, Juha et al. |
2017 |
14 |
LIPIcs, Volume 78, CPM'17, Complete Volume |
Kärkkäinen, Juha et al. |
2017 |
15 |
Efficient Index for Weighted Sequences |
Barton, Carl et al. |
2016 |
16 |
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles |
Kociumaka, Tomasz et al. |
2016 |
17 |
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties |
Iliopoulos, Costas S. et al. |
2016 |
18 |
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries |
Kociumaka, Tomasz et al. |
2013 |