Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875898 | Theoretical Computer Science | 2017 | 25 Pages |
Abstract
We then rederive several variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Travis Gagie, Giovanni Manzini, Jouni Sirén,