No. Title Author Year
1 Bidirectional String Anchors: A New String Sampling Mechanism Loukides, Grigorios et al. 2021
2 Constructing Strings Avoiding Forbidden Substrings Bernardini, Giulia et al. 2021
3 Faster Algorithms for Longest Common Substring Charalampopoulos, Panagiotis et al. 2021
4 Internal Shortest Absent Word Queries Badkobeh, Golnaz et al. 2021
5 String Sanitization Under Edit Distance: Improved and Generalized Mieno, Takuya et al. 2021
6 String Sanitization Under Edit Distance Bernardini, Giulia et al. 2020
7 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
8 Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication Bernardini, Giulia et al. 2019
9 LIPIcs, Volume 128, CPM'19, Complete Volume Pisanti, Nadia et al. 2019
10 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
11 Degenerate String Comparison and Applications Alzamel, Mai et al. 2018
12 Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line Pissis, Solon P. et al. 2018
13 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
14 Longest Unbordered Factor in Quasilinear Time Kociumaka, Tomasz et al. 2018
15 Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers Iliopoulos, Costas S. et al. 2017
16 LIPIcs, Volume 75, SEA'17, Complete Volume Iliopoulos, Costas S. et al. 2017
17 On-Line Pattern Matching on Similar Texts Grossi, Roberto et al. 2017
18 Optimal Computation of Overabundant Words Almirantis, Yannis et al. 2017
19 Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time Crochemore, Maxime et al. 2017
20 Efficient Index for Weighted Sequences Barton, Carl et al. 2016
21 Pattern Matching and Consensus Problems on Weighted Sequences and Profiles Kociumaka, Tomasz et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 21

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI