Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Horiyama, Takashi"'
A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The notion of closed words was introduced by [Fici, WORDS 2011]. Recently, t
Externí odkaz:
http://arxiv.org/abs/2409.19576
This paper investigates the (quasi-)periodicity of a string when the string is edited. A string $C$ is called a cover (as known as a quasi-period) of a string $T$ if each character of $T$ lies within some occurrence of $C$. By definition, a cover of
Externí odkaz:
http://arxiv.org/abs/2402.17428
The uniqueness of an optimal solution to a combinatorial optimization problem attracts many fields of researchers' attention because it has a wide range of applications, it is related to important classes in computational complexity, and an instance
Externí odkaz:
http://arxiv.org/abs/2312.10599
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 application to biology. The longest palindrome problem is one of the
Externí odkaz:
http://arxiv.org/abs/2210.02000
Autor:
Minato, Shin-ichi, Kawahara, Jun, Banbara, Mutsunori, Horiyama, Takashi, Takigawa, Ichigaku, Yamaguchi, Yutaro
Publikováno v:
In Discrete Applied Mathematics 15 January 2025 360:467-486
Grammar-based compression is a loss-less data compression scheme that represents a given string $w$ by a context-free grammar that generates only $w$. While computing the smallest grammar which generates a given string $w$ is NP-hard in general, a nu
Externí odkaz:
http://arxiv.org/abs/2202.08447
Autor:
Minato, Shin-ichi, Banbara, Mutsunori, Horiyama, Takashi, Kawahara, Jun, Takigawa, Ichigaku, Yamaguchi, Yutaro
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 backtracking for a given decision diagram which represents all the feasible sol
Externí odkaz:
http://arxiv.org/abs/2201.08118
Autor:
Banbara, Mutsunori, Hashimoto, Kenji, Horiyama, Takashi, Minato, Shin-ichi, Nakamura, Kakeru, Nishino, Masaaki, Sakai, Masahiko, Uehara, Ryuhei, Uno, Yushi, Yasuda, Norihito
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit squares edge to edge. These two notions were first introduced and invest
Externí odkaz:
http://arxiv.org/abs/2110.05184
The advanced data structure of the zero-suppressed binary decision diagram (ZDD) enables us to efficiently enumerate nonequivalent substitutional structures. Not only can the ZDD store a vast number of structures in a compressed manner, but also can
Externí odkaz:
http://arxiv.org/abs/2107.07683
We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra, also known
Externí odkaz:
http://arxiv.org/abs/2105.14305