Efficient algorithms for longest closed factor array

Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Waleń

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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 (image found) (n log n/ log log n) (the best previously known) to (image found) (n √log n).We use connections between the LCF array and the longest previous/next factor arrays.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings
EditorsSimon J. Puglisi, Costas S. Iliopoulos, Emine Yilmaz
PublisherSpringer Verlag
Number of pages8
ISBN (Print)9783319238258
Publication statusPublished - 2015
Event22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 - London, United Kingdom
Duration: Sept 1 2015Sept 4 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015
Country/TerritoryUnited Kingdom

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Efficient algorithms for longest closed factor array'. Together they form a unique fingerprint.

Cite this