Skip to main navigation Skip to search Skip to main content

LZ-End parsing in linear time

  • University of Helsinki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

We present a deterministic algorithm that constructs in linear time and space the LZ-End parsing (a variation of LZ77) of a given string over an integer polynomially bounded alphabet.

Original languageEnglish
Title of host publication25th European Symposium on Algorithms, ESA 2017
EditorsChristian Sohler, Kirk Pruhs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770491
DOIs
StatePublished - Sep 1 2017
Event25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria
Duration: Sep 4 2017Sep 6 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume87

Conference

Conference25th European Symposium on Algorithms, ESA 2017
Country/TerritoryAustria
CityVienna
Period09/4/1709/6/17

Keywords

  • Construction algorithm
  • LZ-End
  • LZ77
  • Linear time

Fingerprint

Dive into the research topics of 'LZ-End parsing in linear time'. Together they form a unique fingerprint.

Cite this