Sampled longest common prefix array

Show simple item record

dc.contributor University of Helsinki, Department of Computer Science en Sirén, Jouni
dc.contributor.editor Amir, A.
dc.contributor.editor Parida, L. 2010-11-25T15:15:00Z 2010-11-25T15:15:00Z 2010
dc.identifier.citation Sirén , J 2010 , Sampled longest common prefix array . in A Amir & L Parida (eds) , Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010 . Lecture Notes in Computer Science , no. 6129 , Springer , pp. 227-237 , 21st Annual Symposium on Combinatorial Pattern Matching , New York , United States , 21/06/2010 . DOI: 10.1007/978-3-642-13509-5_21 en
dc.identifier.citation conference en
dc.identifier.isbn 978-3-642-13508-8
dc.identifier.other PURE: 9314008
dc.identifier.other PURE UUID: 9b1e0425-b09d-4a22-ae08-7aac61cc131b
dc.identifier.other WOS: 000279604400021
dc.identifier.other Scopus: 78449266657
dc.description.abstract When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that when used with a compressed suffix array (CSA), the sampled LCP array often offers better time/space trade-offs than the existing alternatives. We also show how to construct the compressed representations of the LCP array directly from a CSA en
dc.format.extent 11
dc.language.iso eng
dc.publisher Springer
dc.relation.ispartof Combinatorial Pattern Matching 21st Annual Symposium, CPM 2010
dc.relation.ispartofseries Lecture Notes in Computer Science
dc.rights en
dc.subject 113 Computer and information sciences en
dc.title Sampled longest common prefix array en
dc.type Conference contribution
dc.type.uri info:eu-repo/semantics/other

Files in this item

Total number of downloads: Loading...

Files Size Format View
paper.pdf 311.0Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record