Lempel-Ziv Factorization Revisited (Q3011840)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Lempel-Ziv Factorization Revisited	scientific article

Statements

scholarly article

0 references

Lempel-Ziv Factorization Revisited (English)

0 references

0 references

0 references

Combinatorial Pattern Matching

0 references

publication date

29 June 2011

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-21458-5_4

0 references

Replacing suffix trees with enhanced suffix arrays

0 references

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

0 references

Lempel-Ziv factorization using less time \& space

0 references

Computing longest previous factor in linear time and applications

0 references

LPF Computation Revisited

0 references

0 references

Linear time algorithms for finding and representing all the tandem repeats in a string

0 references

Permuted Longest-Common-Prefix Array

0 references

0 references

An Online Algorithm for Finding the Longest Previous Factors

0 references

Linear Algorithm for Data Compression via String Matching

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-21458-5_4

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3011840

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3011840&oldid=35235464"