6 citations · 18 across the 13 of their papers we have counts for
3 papers · 1 filter
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…
RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
Grammar-based compression is a loss-less data compression scheme that represents a given string by a context-free grammar that generates only . While computing the smallest…
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions
Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama +3
In this paper, we propose a fast method for exactly enumerating a very large number of all lower cost solutions for various combinatorial problems. Our method is based on backtrack…