Abstract: We introduce an extension of the Burrows-Wheeler transform supporting exact pattern matching on a string graph $G(V,\ E,\ N)$ and yielding polynomial time ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results