No. Title Author Year
1 Computing longest common square subsequences Inoue, Takafumi et al. 2018
2 Faster Online Elastic Degenerate String Matching Aoyama, Kotaro et al. 2018
3 Longest Lyndon Substring After Edit Urabe, Yuki et al. 2018
4 Longest substring palindrome after edit Funakoshi, Mitsuru et al. 2018
5 Lyndon Factorization of Grammar Compressed Texts Revisited Furuya, Isamu et al. 2018
6 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings Fujishige, Yuta et al. 2017
7 Faster STR-IC-LCS Computation via RLE Kuboi, Keita et al. 2017
8 Small-Space LCE Data Structure with Constant-Time Queries Tanimura, Yuka et al. 2017
9 Tight Bounds on the Maximum Number of Shortest Unique Substrings Mieno, Takuya et al. 2017
10 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Fujishige, Yuta et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 15


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