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 Dynamic String Alignment Charalampopoulos, Panagiotis et al. 2020
4 Improved Circular k-Mismatch Sketches Golan, Shay et al. 2020
5 The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time Golan, Shay et al. 2020
6 Time-Space Tradeoffs for Finding a Long Common Substring Ben-Nun, Stav et al. 2020
7 Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number Casel, Katrin et al. 2019
8 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
9 Quasi-Linear-Time Algorithm for Longest Common Circular Factor Alzamel, Mai et al. 2019
10 RLE Edit Distance in Near Optimal Time Clifford, Raphaƫl et al. 2019
11 Edit Distance with Block Operations Ganczorz, Michal et al. 2018
12 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
13 Longest Unbordered Factor in Quasilinear Time Kociumaka, Tomasz et al. 2018
14 String Periods in the Order-Preserving Model Gourdel, Garance et al. 2018
15 Efficient Index for Weighted Sequences Barton, Carl et al. 2016
16 Faster Longest Common Extension Queries in Strings over General Alphabets Gawrychowski, Pawel et al. 2016
17 Minimal Suffix and Rotation of a Substring in Optimal Time Kociumaka, Tomasz 2016
18 Pattern Matching and Consensus Problems on Weighted Sequences and Profiles Kociumaka, Tomasz et al. 2016
19 Approximating Upper Degree-Constrained Partial Orientations Cygan, Marek et al. 2015
20 Constant Factor Approximation for Capacitated k-Center with Outliers Cygan, Marek et al. 2014
21 Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries Kociumaka, Tomasz et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 21


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