No. |
Title |
Author |
Year |
1 |
String Sanitization Under Edit Distance |
Bernardini, Giulia et al. |
2020 |
2 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |
3 |
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication |
Bernardini, Giulia et al. |
2019 |
4 |
LIPIcs, Volume 128, CPM'19, Complete Volume |
Pisanti, Nadia et al. |
2019 |
5 |
Longest Common Substring Made Fully Dynamic |
Amir, Amihood et al. |
2019 |
6 |
Degenerate String Comparison and Applications |
Alzamel, Mai et al. |
2018 |
7 |
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line |
Pissis, Solon P. et al. |
2018 |
8 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
9 |
Longest Unbordered Factor in Quasilinear Time |
Kociumaka, Tomasz et al. |
2018 |
10 |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers |
Iliopoulos, Costas S. et al. |
2017 |
11 |
LIPIcs, Volume 75, SEA'17, Complete Volume |
Iliopoulos, Costas S. et al. |
2017 |
12 |
On-Line Pattern Matching on Similar Texts |
Grossi, Roberto et al. |
2017 |
13 |
Optimal Computation of Overabundant Words |
Almirantis, Yannis et al. |
2017 |
14 |
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time |
Crochemore, Maxime 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 |