A bijective variant of the Burrows–Wheeler Transform using V -order
Authors:
- Jacqueline W. DaykinJDJacqueline W. Daykin
- W.F. SmythWSW.F. Smyth
- 1 April 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 531, 77-89
Abstract
No abstract availableFunding Information
- Natural Sciences and Engineering Research Council of Canada (8180-2012)
This publication has 15 references indexed in Scilit:
- A linear partitioning algorithm for Hybrid Lyndons using-orderTheoretical Computer Science, 2013
- Combinatorics of Unique Maximal Factorization Families (UMFFs)Fundamenta Informaticae, 2009
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGSInternational Journal of Foundations of Computer Science, 2008
- Universal Text Preprocessing for Data CompressionIEEE Transactions on Computers, 2005
- A note on the Burrows–Wheeler transformationTheoretical Computer Science, 2005
- Periodic musical sequences and Lyndon wordsSoft Computing, 2004
- Computation of words satisfying the “rhythmic oddity property” (after Simha Arom's works)Information Processing Letters, 2003
- Lyndon-like and V-order factorizations of stringsJournal of Discrete Algorithms, 2003
- Ordering Integer Vectors for Coordinate DeletionsJournal of the London Mathematical Society, 1997
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958