Construction of Fundamental Data Structures for Strings by Felipe A. Louza & Simon Gog & Guilherme P. Telles

Author:Felipe A. Louza & Simon Gog & Guilherme P. Telles
Language: eng
Format: epub
ISBN: 9783030551087
Publisher: Springer International Publishing

4.2 Inducing the LCP Array

In this section we show how to modify algorithm SACA-K to also compute the LCP array, referred to as SACA-K+LCP [17]. It is noteworthy that SACA-K+LCP adapts Fischer’s [8] ideas proposed to compute the LCP array during algorithm SAIS.

We first recall the main steps of SACA-K (the same of IS algorithm, presented in Sect. 3.​3.​1 and shown again in Fig. 4.1).

Fig. 4.1IS algorithm

Also, recall that whenever a suffix position is inserted at the tail (or head) of a c-bucket in SA, the pointer bkt[c] is increased (or decreased) by one.

Example

Figure 4.2 shows a running example of algorithm SACA-K for the string T = banaananaanana$ (also presented in Sect. 3.​3.​1).

Fig. 4.2Running example of algorithm SACA-K for T = banaananaanana$ (refer to Sect. 3.​3.​1 for further examples)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.