106 citations · 187 across the 45 of their papers we have counts for
4 papers · 1 filter
Order preserving pattern matching on trees and DAGs
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai +1
The order preserving pattern matching (OPPM) problem is, given a pattern string and a text string , find all substrings of which have the same relative orders as . In…
Faster STR-IC-LCS computation via RLE
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga +2
The constrained LCS problem asks one to find a longest common subsequence of two input strings and with some constraints. The STR-IC-LCS problem is a variant of the constra…
Small-space encoding LCE data structure with constant-time queries
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai +2
The \emph{longest common extension} (\emph{LCE}) problem is to preprocess a given string of length so that the length of the longest common prefix between suffixes of t…
Computing Abelian regularities on RLE strings
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga +2
Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is sai…