No. Title Author Year
1 Approximating Longest Common Substring with k mismatches: Theory and Practice Gourdel, Garance et al. 2020
2 Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP Matsuda, Kotaro et al. 2020
3 Generalised Pattern Matching Revisited Dudek, Bartłomiej et al. 2020
4 Quasi-Periodicity in Streams Gawrychowski, Pawel et al. 2019
5 Sliding Window Property Testing for Regular Languages Ganardi, Moses et al. 2019
6 Streaming Dictionary Matching with Mismatches Gawrychowski, Pawel et al. 2019
7 Fast Entropy-Bounded String Dictionary Look-Up with Mismatches Gawrychowski, Pawel et al. 2018
8 Upper and Lower Bounds for Dynamic Data Structures on Strings Clifford, Raphaël et al. 2018
9 Communication and Streaming Complexity of Approximate Pattern Matching Starikovskaya, Tatiana 2017
10 Approximate Hamming Distance in a Stream Clifford, Raphaël et al. 2016
11 Longest Common Substring with Approximately k Mismatches Starikovskaya, Tatiana 2016
Current Page :
Number of result pages: 1
Number of documents: 11


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