NDLI: Lazy Lempel-Ziv Factorization Algorithms

Please wait, while we are loading the content...

Journal of Experimental Algorithmics (JEA) : Volume 21, 2016

Issue (Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013), 2016

Editorial, SEA 2014 Special Issue

A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

Evaluation of Labeling Strategies for Rotating Maps

Customizable Contraction Hierarchies

Tree-Based Coarsening and Partitioning of Complex Networks

LCP Array Construction in External Memory

Faster Compressed Suffix Trees for Repetitive Collections

Practical Algorithms for Finding Extremal Sets

An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets

Numerical Algorithm for Pólya Enumeration Theorem

Implementing Efficient All Solutions SAT Solvers

ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks

Introduction to Special Issue ALENEX 2013

Short and Simple Cycle Separators in Planar Graphs

Inducing Suffix and LCP Arrays in External Memory

Lazy Lempel-Ziv Factorization Algorithms

In Memoriam: David S. Johnson

Lazy Lempel-Ziv Factorization Algorithms

Content Provider	ACM Digital Library
Author	Krkkinen, Juha Kempa, Dominik Puglisi, Simon J.
Copyright Year	2016
Description	Author Affiliation: Helsinki Institute of Information Technology, Department of Computer Science, University of Helsinki, Finland (Krkkinen, Juha; Kempa, Dominik; Puglisi, Simon J.)
Abstract	For decades the Lempel-Ziv (LZ77) factorization has been a cornerstone of data compression and string processing algorithms, and uses for it are still being uncovered. For example, LZ77 is central to several recent text indexing data structures designed to search highly repetitive collections. However, in many applications computation of the factorization remains a bottleneck in practice. In this article, we describe a number of simple and fast LZ77 factorization algorithms, which consistently outperform all previous methods in practice, use less memory, and still offer strong worst-case performance guarantees. A common feature of the new algorithms is that they compute longest common prefix information in a lazy fashion, with the degree of laziness in preprocessing characterizing different algorithms.
Starting Page	1
Ending Page	19
Page Count	19
File Format	PDF
ISSN	10846654
e-ISSN	10846654
DOI	10.1145/2699876
Journal	Journal of Experimental Algorithmics (JEA)
Volume Number	21
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Burrows-Wheeler transform LZ77 Lempel-Ziv factorization Lempel-Ziv parsing Data compression String processing Suffix array
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A comparison of index-based lempel-Ziv LZ77 factorization algorithms

Conversion from RLBWT to LZ77

A taxonomy of suffix array construction algorithms

Lempel–Ziv Factorization Using Less Time & Space

Indexing compressed text

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

An efficient, versatile approach to suffix sorting

Parallel and space-efficient construction of burrows-wheeler transform and suffix array for big genome data

Lazy Lempel-Ziv Factorization Algorithms

Similar Documents

A comparison of index-based lempel-Ziv LZ77 factorization algorithms

Conversion from RLBWT to LZ77

A taxonomy of suffix array construction algorithms

Lempel–Ziv Factorization Using Less Time & Space

Indexing compressed text

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

An efficient, versatile approach to suffix sorting

Parallel and space-efficient construction of burrows-wheeler transform and suffix array for big genome data

Lazy Lempel-Ziv Factorization Algorithms