Compressed text indexing with wildcards ?
Let T=T1?k1T2?k2??kdTd+1 T = T 1 ? k 1 T 2 ? k 2 ? ? k d T d + 1 be a text of total length n , where characters of each Ti T i are chosen from an alphabet ? of size ?, and ? denotes a wildcard symbol. The text indexing with wildcards problem is to index T such that when we are given a query pattern P, we can locate the occurrences of P in T  efficiently. This problem has been applied in indexing genomic sequences that contain single-nucleotide polymorphisms (SNP) because SNP can be modeled as wildcards. Recently Tam et al. (2009) and Thachuk (2011) have proposed succinct indexes for this problem. In this paper, we present the first compressed index for this problem, which takes only n H h + o ( n log ? ) + O ( d log n ) bits of space, where Hh H h is the h th-order empirical entropy ( h = o ( log ? n ) ) of T.
compressed text indexing wildcards approximate pattern matching