19 citations · 19 across the 11 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
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…
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
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…