2 citations · 5 across the 26 of their papers we have counts for
8 papers · 1 filter
Computing palindromes on a trie in linear time
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
A trie is a rooted tree such that each edge is labeled by a single character from the alphabet, and the labels of out-going edges from the same node are mutually dist…
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…
Finding Top-k Longest Palindromes in Substrings
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto +1
Palindromes are strings that read the same forward and backward. Problems of computing palindromic structures in strings have been studied for many years with a motivation of their…
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 and , representing prefix and suffix conditions respectively, be given as input for preprocessing. For the query, let two positive intege…
Data structures for computing unique palindromes in static and non-static strings
Takuya Mieno, Mitsuru Funakoshi
A palindromic substring of a string is said to be a shortest unique palindromic substring (SUPS) in for an interval if is a shortest palindro…
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-…