Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102345
Title: Faster lightweight Lempel-Ziv parsing
Authors: Kosolobov, D.
Issue Date: 2015
Publisher: Springer Verlag
Citation: Kosolobov D. Faster lightweight Lempel-Ziv parsing / D. Kosolobov. — DOI 10.1007/978-3-662-48054-0_36 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2015. — Vol. 9235. — P. 432-444.
Abstract: We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ + log log n)) time and n log σ + ɛn bits of space, where ϵ; is a constant rational parameter, n is the length of the input string, and σ is the alphabet size. The n log σ bits in the space bound are for the input string itself which is treated as read-only. © Springer-Verlag Berlin Heidelberg 2015.
Keywords: ARTIFICIAL INTELLIGENCE
COMPUTERS
ALPHABET SIZE
INPUT STRING
SPACE BOUNDS
ALGORITHMS
URI: http://hdl.handle.net/10995/102345
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84944620799
PURE ID: 559131
6abd2473-ec33-428e-b3de-3774073cc5f3
ISSN: 3029743
ISBN: 9783662480533
DOI: 10.1007/978-3-662-48054-0_36
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84944620799.pdf498,96 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.