No. Title Author Year
1 Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding Das, Debarati et al. 2022
2 The Dynamic k-Mismatch Problem Clifford, Raphaël et al. 2022
3 Faster Algorithms for Longest Common Substring Charalampopoulos, Panagiotis et al. 2021
4 Approximating Longest Common Substring with k mismatches: Theory and Practice Gourdel, Garance et al. 2020
5 Counting Distinct Patterns in Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2020
6 Dynamic String Alignment Charalampopoulos, Panagiotis et al. 2020
7 Improved Circular k-Mismatch Sketches Golan, Shay et al. 2020
8 Practical Performance of Space Efficient Data Structures for Longest Common Extensions Dinklage, Patrick et al. 2020
9 The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time Golan, Shay et al. 2020
10 Time-Space Tradeoffs for Finding a Long Common Substring Ben-Nun, Stav et al. 2020
11 Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number Casel, Katrin et al. 2019
12 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
13 Quasi-Linear-Time Algorithm for Longest Common Circular Factor Alzamel, Mai et al. 2019
14 RLE Edit Distance in Near Optimal Time Clifford, Raphaël et al. 2019
15 Edit Distance with Block Operations Ganczorz, Michal et al. 2018
16 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
17 Longest Unbordered Factor in Quasilinear Time Kociumaka, Tomasz et al. 2018
18 String Periods in the Order-Preserving Model Gourdel, Garance et al. 2018
19 Efficient Index for Weighted Sequences Barton, Carl et al. 2016
20 Faster Longest Common Extension Queries in Strings over General Alphabets Gawrychowski, Pawel et al. 2016
21 Minimal Suffix and Rotation of a Substring in Optimal Time Kociumaka, Tomasz 2016
22 Pattern Matching and Consensus Problems on Weighted Sequences and Profiles Kociumaka, Tomasz et al. 2016
23 Approximating Upper Degree-Constrained Partial Orientations Cygan, Marek et al. 2015
24 Constant Factor Approximation for Capacitated k-Center with Outliers Cygan, Marek et al. 2014
25 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: 25


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