Tight lower bounds for the longest common extension problem

Show full item record



Permalink

http://hdl.handle.net/10138/307544

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

Title: Tight lower bounds for the longest common extension problem
Author: Kosolobov, Dmitry
Contributor organization: Department of Computer Science
Genome-scale Algorithmics research group / Veli Mäkinen
Date: 2017-09
Language: eng
Number of pages: 4
Belongs to series: Information Processing Letters
ISSN: 0020-0190
DOI: https://doi.org/10.1016/j.ipl.2017.05.003
URI: http://hdl.handle.net/10138/307544
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.
Subject: Longest common extension
Data structures
Trade-off
Lower bounds
Cell-probe model
113 Computer and information sciences
Peer reviewed: Yes
Rights: other
Usage restriction: openAccess
Self-archived version: 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 full item record