A note on the Burrows–Wheeler transformation
- 21 December 2004
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 332 (1-3) , 567-572
- https://doi.org/10.1016/j.tcs.2004.11.014
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Simple Linear Work Suffix Array ConstructionPublished by Springer Nature ,2003
- Burrows–Wheeler transform and Sturmian wordsInformation Processing Letters, 2003
- Space Efficient Linear Time Construction of Suffix ArraysPublished by Springer Nature ,2003
- Linear-Time Construction of Suffix ArraysPublished by Springer Nature ,2003
- Inferring Strings from Graphs and ArraysPublished by Springer Nature ,2003
- Words over an ordered alphabet and suffix permutationsRAIRO - Theoretical Informatics and Applications, 2002
- An analysis of the Burrows—Wheeler transformJournal of the ACM, 2001
- Counting permutations with given cycle structure and descent setJournal of Combinatorial Theory, Series A, 1993