Abstract:The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches.The problem was lately tackled by Alzamel et al. [1]. For a text with constant alphabet Σ and k ∈ O(1), they present an algorithm with linear space and O(n log k+1 n) time. For the case in which k = 1 and a constant size alphabet, a faster algorithm with linear space and O(n log(n) log log(n)) time was presented i… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.