1 paper
Christopher Pockrandt, Marcel Ehrhardt, Knut Reinert
We introduce a new, practical method for conducting an exact search in a uni- and bidirectional FM index in O(1) time per step while using O(logσ∗n)+o(logσ∗σ∗n) bits o…