An absent word of a word y is a word that does not occur in y. It is then called minimal if all its proper factors occur in y. In fact, minimal absent words (MAWs) provide useful information about y and thus have several applications. In this paper, we propose an algorithm that maintains the set of MAWs of a fixed-length window sliding over y online. Our algorithm represents MAWs through nodes of the suffix tree. Specifically, the suffix tree of the sliding window is maintained using modified Senft's algorithm (Senft, 2005), itself generalizing Ukkonen's online algorithm (Ukkonen, 1995). We then apply this algorithm to the approximate pattern-matching problem under the Length Weighted Index distance (Chairungsee and Crochemore, 2012). This results in an online O(σ|y|)-time algorithm for finding approximate occurrences of a word x in y, |x|≤|y|, where σ is the alphabet size.

Additional Metadata
Persistent URL dx.doi.org/10.1016/j.ic.2019.104461
Journal Information and Computation
Citation
Crochemore, M, Heliou, A, Kucherov, G, Mouchard, L, Pissis, S, & Ramusat, Y. (2019). Absent words in a sliding window with applications. Information and Computation, 270. doi:10.1016/j.ic.2019.104461