-
AFE
-
Lehre
-
Algorithmische Grundlagen
Theses
have that the number of equal letter runs of the BWT is 3 (2n, 1b, 3a) while the number of runs in the original text is 6 (1b, 1a, 1n, 1a, 1n, 1a). Powerful text indexes are based on the BWT, such as the FM-index [...] (or the newly-seen character). For example, the LZ parse of T = abaababaaabab is LZ(T) = (0,a)(0,b)(1,1)(1,3)(2,3)(4,4). The LZ factorization is widely known for achieving a strong compression ratio on a [...] (or the newly-seen character). For example, the LZ parse of T = abaababaaabab is LZ(T) = (0,a)(0,b)(1,1)(1,3)(2,3)(4,4). The LZ factorization is widely known for achieving a strong compression ratio on a …