Titlebook: Construction of Fundamental Data Structures for Strings; Felipe A. Louza,Simon Gog,Guilherme P. Telles Book 2020 The Author(s), under excl

串通

SpringerBriefs in Computer Sciencehttp://image.papertrans.cn/c/image/236078.jpg

裝飾

NEEDY

知識(shí)分子

lipids

ConclusionsIn this section we review our contributions and outline trends in augmented suffix sorting.

Coterminous

Introductionications as building blocks of strategies that process text datasets efficiently. This chapter introduces ., a central problem in string processing. We also present other related problems and some data structures that were developed for their solution.

監(jiān)禁

garrulous

充足

Inducing the LCP Arrayrting algorithm . (Nong, 2013) that also computes the LCP array. This augmented algorithm, called . (Louza et al., 2017b), runs in .(.) time using 4.?+?.(1) words of workspace, which is optimal for strings from constant alphabets.

Provenance

Inducing the Document Arrayay, or alternatively, during suffix array construction. In this chapter we present algorithms g. and g. (Louza et al., 2017) that construct the suffix array for a string collection, and we show how to modify them to also compute the document array, with the same theoretical bounds.