Faster MEM-finding in space
T Gagie - arXiv preprint arXiv:2403.02008, 2024 - arxiv.org
Suppose we are given a text $ T [1.. n] $, a straight-line program with $ g $ rules for $ T $
and an assignment of tags to the characters in $ T $ such that the Burrows-Wheeler …
and an assignment of tags to the characters in $ T $ such that the Burrows-Wheeler …