Binary block order Rouen Transform
Authors:
- Jacqueline W. DaykinJDJacqueline W. Daykin
- Richard GroultRGRichard Groult
- Yannick GuesnetYGYannick Guesnet
- Thierry LecroqTLThierry Lecroq
- Arnaud LefebvreALArnaud Lefebvre
- Martine LéonardMLMartine Léonard
- Élise Prieur-GastonÉPÉlise Prieur-Gaston
- 1 December 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 656, 118-134
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A bijective variant of the Burrows–Wheeler Transform using V -orderTheoretical Computer Science, 2014
- On parsing optimality for dictionary-based text compression—the Zip caseJournal of Discrete Algorithms, 2013
- A four-stage algorithm for updating a Burrows–Wheeler transformTheoretical Computer Science, 2009
- Fast BWT in small space by blockwise suffix sortingTheoretical Computer Science, 2007
- Linear work suffix array constructionJournal of the ACM, 2006
- Universal Text Preprocessing for Data CompressionIEEE Transactions on Computers, 2005
- A note on the Burrows–Wheeler transformationTheoretical Computer Science, 2005
- Lyndon-like and V-order factorizations of stringsJournal of Discrete Algorithms, 2003
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958