No. Title Author Year
1 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures Nakashima, Katsuhito et al. 2020
2 Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences Funakoshi, Mitsuru et al. 2020
3 An Improved Data Structure for Left-Right Maximal Generic Words Problem Fujishige, Yuta et al. 2019
4 Computing Runs on a Trie Sugahara, Ryo et al. 2019
5 Faster Queries for Longest Substring Palindrome After Block Edit Funakoshi, Mitsuru et al. 2019
6 On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations Urabe, Yuki et al. 2019
7 Computing longest common square subsequences Inoue, Takafumi et al. 2018
8 Faster Online Elastic Degenerate String Matching Aoyama, Kotaro et al. 2018
9 Longest Lyndon Substring After Edit Urabe, Yuki et al. 2018
10 Longest substring palindrome after edit Funakoshi, Mitsuru et al. 2018
11 Lyndon Factorization of Grammar Compressed Texts Revisited Furuya, Isamu et al. 2018
12 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings Fujishige, Yuta et al. 2017
13 Faster STR-IC-LCS Computation via RLE Kuboi, Keita et al. 2017
14 Small-Space LCE Data Structure with Constant-Time Queries Tanimura, Yuka et al. 2017
15 Tight Bounds on the Maximum Number of Shortest Unique Substrings Mieno, Takuya et al. 2017
16 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Fujishige, Yuta et al. 2016
17 Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction Tanimura, Yuka et al. 2016
18 Factorizing a String into Squares in Linear Time Matsuoka, Yoshiaki et al. 2016
19 Fully Dynamic Data Structure for LCE Queries in Compressed Space Nishimoto, Takaaki et al. 2016
20 Shortest Unique Substring Queries on Run-Length Encoded Strings Mieno, Takuya et al. 2016
21 Faster Compact On-Line Lempel-Ziv Factorization Yamamoto, Jun'ichi et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 21


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