3 citations · 8 across the 32 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022★ 1 cited
Faster Space-Efficient STR-IC-LCS Computation
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga +1
One of the most fundamental method for comparing two given strings and is the longest common subsequence (LCS), where the task is to find (the length) of an LCS of and…
cs.DS2022
Computing maximal palindromes in non-standard matching models
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima +3
Palindromes are popular and important objects in textual data processing, bioinformatics, and combinatorics on words. Let be a string where and are of the same le…
cs.DS2022
Minimal Absent Words on Run-Length Encoded Strings
Tooru Akagi, Kouta Okabe, Takuya Mieno +2
A string is called a minimal absent word (MAW) for another string if does not occur (as a substring) in and any proper substring of occurs in . State-of-the-…