Tight lower bounds for the longest common extension problem

Show simple item record

dc.contributor University of Helsinki, Department of Computer Science en
dc.contributor.author Kosolobov, Dmitry
dc.date.accessioned 2019-11-27T13:41:01Z
dc.date.available 2019-11-27T13:41:01Z
dc.date.issued 2017-09
dc.identifier.citation Kosolobov , D 2017 , ' Tight lower bounds for the longest common extension problem ' , Information Processing Letters , vol. 125 , pp. 26-29 . https://doi.org/10.1016/j.ipl.2017.05.003 en
dc.identifier.issn 0020-0190
dc.identifier.other PURE: 99511524
dc.identifier.other PURE UUID: b5f20143-17b0-45e4-8e68-4abe9112caf7
dc.identifier.other WOS: 000403743400006
dc.identifier.other Scopus: 85019589481
dc.identifier.other ORCID: /0000-0002-2909-2952/work/42136063
dc.identifier.uri http://hdl.handle.net/10138/307544
dc.description.abstract The longest common extension problem is to preprocess a given string of length n into a data structure that uses S(n) bits on top of the input and answers in T(n) time the queries LCE(i, j) computing the length of the longest string that occurs at both positions i and j in the input. We prove that the trade-off S (n)T (n) = (it logn) holds in the non-uniform cell-probe model provided that the input string is read-only, each letter occupies a separate memory cell, S(n) = Omega(n), and the size of the input alphabet is at least 2(8inverted right perpendicularS(n)/ninverted left perpendicular). It is known that this trade-off is tight. (C) 2017 Elsevier B.V. All rights reserved. en
dc.format.extent 4
dc.language.iso eng
dc.relation.ispartof Information Processing Letters
dc.rights en
dc.subject Longest common extension en
dc.subject Data structures en
dc.subject Trade-off en
dc.subject Lower bounds en
dc.subject Cell-probe model en
dc.subject 113 Computer and information sciences en
dc.title Tight lower bounds for the longest common extension problem en
dc.type Article
dc.description.version Peer reviewed
dc.identifier.doi https://doi.org/10.1016/j.ipl.2017.05.003
dc.type.uri info:eu-repo/semantics/other
dc.type.uri info:eu-repo/semantics/acceptedVersion

Files in this item

Total number of downloads: Loading...

Files Size Format View
1611.02891.pdf 110.3Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record