Factorizing Strings into Repetitions
Factorizing Strings into Repetitions
复制标题
将字符串分解为重复项
DOI:
10.1007/s00224-022-10070-3
复制
发表时间:
2022
影响因子:
0.5
通讯作者:
Masayuki Takeda
中科院分区:
文献类型:
--
作者:
Hiroe Inoue;Yoshiaki Matsuoka;Yuto Nakashima;Shunsuke Inenaga;Hideo Bannai;Masayuki Takeda
A factorizationf1,…,fmof a stringwis called arepetition factorizationofwif each factorfiis a repetition, namely,for some non-empty stringx, an integerk≥ 2, andbeing a proper prefix ofx. Dumitran et al. (Proc. SPIRE 2015) proposed an algorithm which computes an arbitrary repetition factorization of a given stringwinO(n) time, wherenis the length ofw. The number of factors (i.e. repetitions) contained in the output of their algorithm is not known or guaranteed. In this paper, we propose two algorithms for computing smallest/largest repetition factorizations intime, which respectively consist of the smallest/largest number of factors. The first algorithm is a simple-space algorithm based on a reduction of the problem to the shortest/longest path problem on the DAG of size. The second one simulates the dynamic programming algorithm for shortest/longest path problem withinO(n) space based on the idea of the first algorithm. Moreover, we discuss combinatorial structures of smallest/largest repetition factorizations of Fibonacci strings.
登录
查看更多内容
DOI:
--
发表时间:
2015
期刊:
SPIRE
影响因子:
--
作者:
Marius Dumitran;F. Manea;Dirk Nowotka
通讯作者:
Dirk Nowotka
DOI:
--
发表时间:
2013
期刊:
J. Discrete Algorithms
影响因子:
--
作者:
R. Kolpakov;Mikhail Podolskiy;M. Posypkin;Nickolay Khrapov
通讯作者:
Nickolay Khrapov
影响因子:
1.1
作者:
M. Crochemore;W. Rytter
通讯作者:
W. Rytter
DOI:
--
发表时间:
2009
期刊:
Prague Stringology Conference
影响因子:
--
作者:
Manfred Kufleitner
通讯作者:
Manfred Kufleitner
DOI:
10.4230/lipics.icalp.2021.63
发表时间:
2021
期刊:
The New England journal of medicine
影响因子:
--
作者:
J. Ellert;J. Fischer
通讯作者:
J. Fischer