Efficient Algorithms for Longest Closed Factor Array
Efficient Algorithms for Longest Closed Factor Array
复制标题
最长闭因子数组的高效算法
DOI：
10.1007/978-3-319-23826-5_10
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Shiho Sugimoto and Tomasz Walen
中科院分区：
文献类型：
--
作者：
Hideo Bannai;Shunsuke Inenaga;Tomasz Kociumaka;Arnaud Lefebvre;Jakub Radoszewski;Wojciech Rytter;Shiho Sugimoto and Tomasz Walen
We consider a family of strings called closed strings and a related array of Longest Closed Factors (LCF). We show that the reconstruction of a string from its LCF array is easier than the construction and verification of this array. Moreover, the reconstructed string is unique. We improve also the time of construction/verification, reducing it from(the best previously known) to. We use connections between the LCF array and the longest previous/next factor arrays.
