Faster lyndon factorization algorithms for SLP and LZ78 compressed text

Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

8 Citations (Scopus)

Abstract

We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight line program (SLP) S of size n and height h that describes w, the first algorithm runs in O(nh(n + log N log n)) time and O(n2) space. Given the Lempel-Ziv 78 encoding of size s for w, the second algorithm runs in O(s log s) time and space.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Proceedings
PublisherSpringer Verlag
Pages174-185
Number of pages12
ISBN (Print)9783319024318
DOIs
Publication statusPublished - 2013
Event20th International Symposium on String Processing and Information Retrieval, SPIRE 2013 - Jerusalem, Israel
Duration: Oct 7 2013Oct 9 2013

Publication series

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

Other

Other20th International Symposium on String Processing and Information Retrieval, SPIRE 2013
CountryIsrael
CityJerusalem
Period10/7/1310/9/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Faster lyndon factorization algorithms for SLP and LZ78 compressed text'. Together they form a unique fingerprint.

Cite this