L. Leonard

most citedSuffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems

1 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2023★ 1 cited

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 $W_{i} = T [i .. i + d - 1]$ of size $d$ that shifts over an input text $T$ of lengt…

cs.DS2022

Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai +1

Let two static sequences of strings $P$ and $S$ , representing prefix and suffix conditions respectively, be given as input for preprocessing. For the query, let two positive intege…

cs.DS2022★ 1 cited

Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems

Laurentius Leonard, Ken Tanaka

Given two strings $T$ and $S$ and a set of strings $P$ , for each string $p \in P$ , consider the unique substrings of $T$ that have $p$ as their prefix and $S$ as their suffix. Two…