106 citations · 239 across the 67 of their papers we have counts for
5 papers · 1 filter
Linear-time computation of generalized minimal absent words for multiple strings
Kouta Okabe, Takuya Mieno, Yuto Nakashima +2
A string is called a minimal absent word (MAW) for a string if does not occur as a substring in and all proper substrings of occur in . MAWs are well-studied…
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga +2
The directed acyclic word graph (DAWG) of a string of length is the smallest (partial) DFA which recognizes all suffixes of with only nodes and edges. In this pa…
Sliding suffix trees revisited
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai +1
The sliding suffix tree (Fiala \& Greene, 1989) is a suffix tree that is maintained for a sliding window of size that shifts over an input text of lengt…
Acceleration of FM-index Queries Through Prefix-free Parsing
Aaron Hong, Marco Oliva, Dominik Köppl +3
FM-indexes are a crucial data structure in DNA alignment, for example, but searching with them usually takes at least one random access per character in the query pattern. Ferragin…
Optimal LZ-End Parsing is Hard
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita +3
LZ-End is a variant of the well-known Lempel-Ziv parsing family such that each phrase of the parsing has a previous occurrence, with the additional constraint that the previous occ…