| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 439123 | Theoretical Computer Science | 2009 | 9 Pages |
Abstract
The investigation of the extremal case of the Burrows–Wheeler transform leads to study the words w over an ordered alphabet A={a1,a2,…,ak}, with a1
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
