A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Compressed text indexing with wildcards
2013
Journal of Discrete Algorithms
Let T = T1φ k 1 T2φ k 2 · · · φ k d T d+1 be a text of total length n, where characters of each Ti 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
doi:10.1016/j.jda.2012.12.003
fatcat:snw2ro2ofzf2tdhgovwfmdac6y