5 citations · 9 across the 4 of their papers we have counts for
4 papers
Position Heaps for Parameterized Strings
Diptarama, Takashi Katsura, Yuhei Otomo +2
We propose a new indexing structure for parameterized strings, called parameterized position heap. Parameterized position heap is applicable for parameterized pattern matching prob…
Longest Common Subsequence in at Least Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara +6
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least length substrings. First, we show a…
Efficient computation of longest single-arm-gapped palindromes in a string
Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa +2
In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which…
Detecting regularities on grammar-compressed strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira +5
We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size that represents a s…