Correction
Open
Testing Suffixient Sets
ref [13] · 2506.08225 · notice #8878 · dispute
Raw extraction · bibliography line
Turnbull, C., et al.: The 100,000 genomes project: bringing whole genome sequenc- ing to the NHS. Br. Med. J.361(2018). https://doi.org/10.1136/bmj.k1687 A Deferred material from Section 2 Givenα, β∈Σ ∗, the lexicographic order< lex is defined as follows:α <lex β if and only if there existsj∈Nsuch thatα[1, j] =β[1, j]andj=|α|or α[j+ 1]̸=β[j+ 1]. GivenT∈Σ n, the suffix arraySA(T)ofTis a permutation of[n]such that for any1≤i < j≤nholdsT[SA(T)[i], n]< lex T[SA(T)[j], n]. Thelongestcommonprefixlcp(α, β)betweenαandβisdefinedaslcp(α, β) = λif and only if for everyi∈[λ]it holdsα[i] =β[i]andλ= min(|α|,|β|)or α[λ+ 1]̸=β[λ+ 1]. 14 Davide Cenzato, Francisco Olivares and Nicola Prezza The Longest Common Prefix arrayLCP(T)ofTis defined asLCP(T)[i] = lcp(T[SA(T)[i−1], n], T[SA(T)[i], n]), ifi∈[2, n], andLCP(T)[i] = 0, otherwise. The Burrows-Wheeler TransformBWT(T)is a permutation of the characters ofTsuch thatBWT(T)[i]the character inTto the left of the starting position of thei-th suffix ofT, namelyBWT(T)[i] =T[SA[i]−1], ifi∈[2, n], and BWT(T)[i] =T[n], otherwise. For simplicity, whenTis clear from context, we denote bySA,LCP, and BWTtoSA(T),BWT(T), andLCP(T), respectively