LCP array
In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest common prefixes (LCPs) between all pairs of consecutive suffixes in a sorted suffix array. For example, if A := [aab, ab, abaab, b, baab] is a suffix array, the longest common prefix between A[1] = aab and A[2] = ab is a which has length 1, so H[2] = 1 in the LCP array H. Likewise, the LCP of A[2] = ab and A[3] = abaab is ab, so H[3] = 2.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
LCP array
In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest common prefixes (LCPs) between all pairs of consecutive suffixes in a sorted suffix array. For example, if A := [aab, ab, abaab, b, baab] is a suffix array, the longest common prefix between A[1] = aab and A[2] = ab is a which has length 1, so H[2] = 1 in the LCP array H. Likewise, the LCP of A[2] = ab and A[3] = abaab is ab, so H[3] = 2.
has abstract
In computer science, the longe ...... e for compressed suffix trees.
@en
Link from a Wikipage to an external page
Wikipage page ID
36,849,795
page length (characters) of wiki page
Wikipage revision ID
1,018,461,104
Link from a Wikipage to another Wikipage
date
June 2016
@en
reason
this section is a straight up ...... form of a reply to a question.
@en
wikiPageUsesTemplate
comment
In computer science, the longe ...... 3] = abaab is ab, so H[3] = 2.
@en
label
LCP array
@en
LCP 배열
@ko
LCP-Array
@de