A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Constructing Antidictionaries in Output-Sensitive Space
2019 Data Compression Conference (DCC)
A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given a collection of k words y 1 , y 2 , . . . , y k over an alphabet Σ, we are asked to compute the set M y 1 #...#y k of minimal absent words of length at most of word y = y 1 #y 2 # . . . #y k , # / ∈ Σ. In data compression, this corresponds to computing the antidictionary of k documents. In bioinformatics, it corresponds to computing words that are absent from a genome of k chromosomes. Thisdoi:10.1109/dcc.2019.00062 dblp:conf/dcc/AyadBFHP19 fatcat:dx43qqxnbvbhvcuk5dbr64z5su