On the public citation graph
Post BWT stages of the Burrows–Wheeler compression algorithm
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-oopenalex-snapshot
Reducing the space requirement of suffix trees
inferredcites →https://doi.org/10.1002/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-dopenalex-snapshot
Improvements to Burrows-Wheeler compression algorithm
inferredcites →https://doi.org/10.1002/spe.426openalex-snapshot
Second step algorithms in the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1002/spe.484openalex-snapshot
Burrows–Wheeler compression with variable length integer codes
inferredcites →https://doi.org/10.1002/spe.763openalex-snapshot
Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm
inferredcites →https://doi.org/10.1007/11786986_49openalex-snapshot
The Myriad Virtues of Wavelet Trees
inferredcites →https://doi.org/10.1007/11841036_67openalex-snapshot
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferredcites →https://doi.org/10.1007/3-540-45749-6_61openalex-snapshot
Engineering a Lightweight Suffix Array Construction Algorithm
inferredcites →https://doi.org/10.1007/978-0-387-78909-5openalex-snapshot
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
inferredcites →https://doi.org/10.1007/978-0-387-78909-5_6openalex-snapshot
Variants of the Burrows-Wheeler Transform
inferredcites →https://doi.org/10.1007/978-1-4757-6048-4_31openalex-snapshot
Space Efficient Linear Time Computation of the Burrows and Wheeler-Transformation
inferredcites →https://doi.org/10.1007/978-3-540-73437-6_10openalex-snapshot
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.008openalex-snapshot
Context exhumation after the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.012openalex-snapshot
Burrows–Wheeler compression: Principles and reflections
inferredcites →https://doi.org/10.1093/comjnl/39.9.731openalex-snapshot
The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements
inferredcites →https://doi.org/10.1097/00006231-200304000-00005openalex-snapshot
Assessment of myocardial viability with a positron coincidence gamma camera using fluorodeoxyglucose in comparison with dedicated PET
inferredcites →https://doi.org/10.1109/12.888040openalex-snapshot
Universal data compression based on the Burrows-Wheeler transformation: theory and practice
inferredcites →https://doi.org/10.1109/dcc.1997.582009openalex-snapshot
Block sorting and compression
inferredcites →https://doi.org/10.1109/dcc.1997.582019openalex-snapshot
A corpus for the evaluation of lossless compression algorithms
inferredcites →https://doi.org/10.1109/dcc.1997.582137openalex-snapshot
A fast block-sorting algorithm for lossless data compression
inferredcites →https://doi.org/10.1109/dcc.1999.755668openalex-snapshot
Modifications of the Burrows and Wheeler data compression algorithm
inferredcites →https://doi.org/10.1109/dcc.1999.785693openalex-snapshot
Improving text compression ratios with the Burrows-Wheeler transform
inferredcites →https://doi.org/10.1109/dcc.2000.838157openalex-snapshot
On the performance of BWT sorting algorithms
inferredcites →https://doi.org/10.1109/dcc.2000.838158openalex-snapshot
Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data
inferredcites →https://doi.org/10.1109/dcc.2000.838159openalex-snapshot
Move-to-front and inversion coding
inferredcites →https://doi.org/10.1109/dcc.2001.917173openalex-snapshot
Can we do without ranks in Burrows Wheeler transform compression?
inferredcites →https://doi.org/10.1109/dcc.2001.917174openalex-snapshot
Parsing strategies for BWT compression
inferredcites →https://doi.org/10.1109/dcc.2004.1281451openalex-snapshot
Fast compression with a static model in high-order entropy
inferredcites →https://doi.org/10.1109/dcc.2004.1281497openalex-snapshot
Record preprocessing for data compression
inferredcites →https://doi.org/10.1109/dcc.2005.3openalex-snapshot
A Fast and Efficient Post BWT-Stage for the Burrows-Wheeler Compression Algorithm
inferredcites →https://doi.org/10.1109/spire.1999.796581openalex-snapshot
An efficient method for in memory construction of suffix arrays
inferredcites →https://doi.org/10.1109/tc.2005.85openalex-snapshot
Universal Text Preprocessing for Data Compression
inferredcites →https://doi.org/10.1109/tcom.1984.1096090openalex-snapshot
Data Compression Using Adaptive Coding and Partial String Matching
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.1987.1057251openalex-snapshot
Interval and recency rank source coding: Two on-line adaptive variable-length schemes
inferredcites →https://doi.org/10.1145/297096.297106openalex-snapshot
Power balance and apportionment algorithms for the United States Congress
inferredcites →https://doi.org/10.1145/563857.563817openalex-snapshot
Enhanced word-based block-sorting text compression
inferredcites →https://doi.org/10.1145/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferredcites →https://doi.org/10.12794/metadc2909openalex-snapshot
Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem
inferredcites →https://doi.org/10.13140/rg.2.1.1243.9521openalex-snapshot
UNIFYING TEXT SEARCH AND COMPRESSION –SUFFIX SORTING, BLOCK SORTING AND SUFFIX ARRAYS–
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2873openalex-snapshot
Burrows‐Wheeler post‐transformation with effective clustering and interpolative coding
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_34openalex-snapshot
Grammar Precompression Speeds Up Burrows–Wheeler Compression
inferred← citeshttps://doi.org/10.1007/s10586-018-1801-3openalex-snapshot
Near lossless medical image compression using block BWT–MTF and hybrid fractal compression techniques
inferred← citeshttps://doi.org/10.1007/s11042-016-3629-2openalex-snapshot
Lossless image compression: application of Bi-level Burrows Wheeler Compression Algorithm (BBWCA) to 2-D data
inferred← citeshttps://doi.org/10.1007/s11760-015-0783-3openalex-snapshot
Lossless colour image compression using RCT for bi-level BWCA
inferred← citeshttps://doi.org/10.1016/j.jvcir.2021.103050openalex-snapshot
Lossless chain code compression with an improved Binary Adaptive Sequential Coding of zero-runs
inferred← citeshttps://doi.org/10.1109/cscc58962.2023.00015openalex-snapshot
On Move-To-Front Implementation
inferred← citeshttps://doi.org/10.1109/dcc.2014.86openalex-snapshot
Better Compression through Better List Update Algorithms
inferred← citeshttps://doi.org/10.1109/incip64058.2025.11020095openalex-snapshot
Enhancing Data Compression Techniques for Optimization: A Novel Integration of Burrows-Wheeler Transform, Lempel-Ziv-Welch, Run-Length Encoding and Huffman Coding
inferred← citeshttps://doi.org/10.1109/wisa.2013.20openalex-snapshot
Compression and Indexing Based on BWT: A Survey
inferred← citeshttps://doi.org/10.20944/preprints202401.1432.v1openalex-snapshot
On Move with Interleaving (MwI) Implementation
inferred← citeshttps://doi.org/10.25439/rmt.27354450openalex-snapshot
Scalable succinct indexing for large text collections
inferred← citeshttps://doi.org/10.3390/app10030937openalex-snapshot
On the Utilization of Reversible Colour Transforms for Lossless 2-D Data Compression
inferred← citeshttps://doi.org/10.3390/e25121591openalex-snapshot
A New Transformation Technique for Reducing Information Entropy: A Case Study on Greyscale Raster Images
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.15openalex-snapshot
On the Complexity of BWT-Runs Minimization via Alphabet Reordering
inferred← citeshttps://doi.org/10.5772/intechopen.1008524openalex-snapshot
Programming Optimization of Move with Interleaving Transform
inferred← citeshttps://doi.org/10.70675/242e223fze6acz4b28z8fe7z050f699ec127openalex-snapshot
Lossless and nearly-lossless image compression based on combinatorial transforms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.