Editing Suffix array (section)

== Constructing a child table ==
The child table ''cldtab'' is composed of three n arrays, ''up'', ''down'' and ''nextlIndex''. The information about the edges of the corresponding suffix tree is stored and maintained by the ''up'' and ''down'' arrays. The ''nextlIndex'' array stores the links in the linked list used for node branching the suffix tree.

The ''up'', ''down'' and ''nextlIndex'' array are defined as follows:

# The element ''up[i]'' records the starting index of the longest lcp-second interval’s child interval, which ends at index ''i-1''.
# The initial index of the second child interval of the longest lcp-interval, starting at index ''i'' is stored in the element ''down[i]''.
# If and only if the interval is neither the first child nor the final child of its parent, the element ''nextlIndex[i]'' contains the first index of the next sibling interval of the longest lcp-interval, starting at index ''i''.

By performing a bottom-up traversal of the lcp-interval of the tree, the child table can be constructed in linear time. The ''up/down'' values and the ''nextlIndex'' values can be computed separately by using two distinct algorithms.