Optimal Suffix Sorting And Lcp Array Construction For Constant Alphabets

dc.creatorLouza
dc.creatorFelipe A.; Gog
dc.creatorSimon; Telles
dc.creatorGuilherme P.
dc.date2017
dc.datefev
dc.date2017-11-13T11:31:51Z
dc.date2017-11-13T11:31:51Z
dc.date.accessioned2018-03-29T05:46:38Z
dc.date.available2018-03-29T05:46:38Z
dc.identifierInformation Processing Letters. Elsevier Science Bv, v. 118, p. 30 - 34, 2017.
dc.identifier0020-0190
dc.identifier1872-6119
dc.identifierWOS:000389094200008
dc.identifier10.1016/j.ipl.2016.09.010
dc.identifierhttp://www-sciencedirect-com.ez88.periodicos.capes.gov.br/science/article/pii/S0020019016301375
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/325974
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1362980
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionWe show how the longest common prefix (LCP) array can be generated as a by-product of the suffix array construction algorithm SACA-K (Nong, 2013). Our algorithm builds on Fischer's proposal (Fischer, WADS'11), and also runs in linear time, but uses only constant extra memory for constant alphabets. (C) 2016 Elsevier B.V. All rights reserved.
dc.description118
dc.description30
dc.description34
dc.descriptionCAPES
dc.descriptionCNPq [162338/2015-5]
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.languageEnglish
dc.publisherElsevier Science BV
dc.publisherAmsterdam
dc.relationInformation Processing Letters
dc.rightsfechado
dc.sourceWOS
dc.subjectData Structures
dc.subjectSuffix Array
dc.subjectLcp Array
dc.subjectLinear Time
dc.subjectConstant Space
dc.titleOptimal Suffix Sorting And Lcp Array Construction For Constant Alphabets
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución