Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet +6

A degenerate or indeterminate string on an alphabet $\Sigma$ is a sequence of non-empty subsets of $\Sigma$. Given a degenerate string $t$ of length $n$, we present a new method based on the…