On the public citation graph

Second step algorithms in the Burrows–Wheeler compression algorithm

https://doi.org/10.1002/spe.426
0 signed · 84 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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.1007/pl00009217openalex-snapshot
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
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.1093/comjnl/40.2_and_3.76openalex-snapshot
Semantically Motivated Improvements for PPM Variants
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/18.382011openalex-snapshot
A universal finite memory source
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/dcc.1997openalex-snapshot
Proceedings DCC '97. Data Compression Conference
inferredcites →https://doi.org/10.1109/dcc.1997.582009openalex-snapshot
Block sorting and compression
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.1998.672147openalex-snapshot
The context trees of block sorting compression
inferredcites →https://doi.org/10.1109/dcc.1998.672217openalex-snapshot
Switching between two universal source coding algorithms
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/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.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
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/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferredcites →https://doi.org/10.1287/opre.13.4.609openalex-snapshot
On Serial Files with Relocatable Records
inferredcites →https://doi.org/10.5555/314161.314180openalex-snapshot
Online list accessing algorithms and their applications: recent empirical evidence

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.943openalex-snapshot
An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees
inferred← citeshttps://doi.org/10.1002/spe.1112openalex-snapshot
Revisiting bounded context block‐sorting transformations
inferred← citeshttps://doi.org/10.1002/spe.2873openalex-snapshot
Burrows‐Wheeler post‐transformation with effective clustering and interpolative coding
inferred← citeshttps://doi.org/10.1002/spe.484openalex-snapshot
Burrows–Wheeler compression with variable length integer codes
inferred← citeshttps://doi.org/10.1002/spe.669openalex-snapshot
A comparison of BWT approaches to string pattern matching
inferred← citeshttps://doi.org/10.1002/spe.763openalex-snapshot
Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm
inferred← citeshttps://doi.org/10.1002/spe.982openalex-snapshot
Post BWT stages of the Burrows–Wheeler compression algorithm
inferred← citeshttps://doi.org/10.1007/11569596_79openalex-snapshot
Efficient Adaptive Data Compression Using Fano Binary Search Trees
inferred← citeshttps://doi.org/10.1007/11780441_26openalex-snapshot
A Simpler Analysis of Burrows-Wheeler Based Compression
inferred← citeshttps://doi.org/10.1007/11841036_67openalex-snapshot
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_10openalex-snapshot
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_13openalex-snapshot
Most Burrows-Wheeler Based Compressors Are Not Optimal
inferred← citeshttps://doi.org/10.1007/s00203-021-02278-7openalex-snapshot
Molecular profiling of microbial community structure and their CAZymes via metagenomics, from Tsomgo lake in the Eastern Himalayas
inferred← citeshttps://doi.org/10.1007/s00450-003-0139-zopenalex-snapshot
Grundlagen des Burrows-Wheeler-Kompressionsalgorithmus
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.1007/springerreference_64079openalex-snapshot
Indexing Compressed Text
inferred← citeshttps://doi.org/10.1016/b978-012620861-0/50008-5openalex-snapshot
Burrows—Wheeler Compression
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.01.003openalex-snapshot
The pseudo-distance technique for parallel lossless compression of color-mapped images
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.008openalex-snapshot
Context exhumation after the Burrows–Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.ipm.2004.08.009openalex-snapshot
Word-based text compression using the Burrows–Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103587openalex-snapshot
Concurrent encryption and lossless compression using inversion ranks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.012openalex-snapshot
Burrows–Wheeler compression: Principles and reflections
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.020openalex-snapshot
A simpler analysis of Burrows–Wheeler-based compression
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.024openalex-snapshot
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
inferred← citeshttps://doi.org/10.1080/00207160410001712279openalex-snapshot
Investigation of block-sorting of multiset permutations
inferred← citeshttps://doi.org/10.1080/02522667.2019.1619243openalex-snapshot
Enriched J-Bit encrypting technique using data compression algorithms in data warehouse
inferred← citeshttps://doi.org/10.1093/bioinformatics/bty619openalex-snapshot
CoMSA: compression of protein multiple sequence alignment files
inferred← citeshttps://doi.org/10.1109/aero.2005.1559440openalex-snapshot
CompreX: XML compression applied to the airborne Internet
inferred← citeshttps://doi.org/10.1109/ccp.2011.22openalex-snapshot
Combining Non-stationary Prediction, Optimization and Mixing for Data Compression
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281451openalex-snapshot
Fast compression with a static model in high-order entropy
inferred← citeshttps://doi.org/10.1109/dcc.2005.75openalex-snapshot
QLFC - A Compression Algorithm Using the Burrows-Wheeler Transform
inferred← citeshttps://doi.org/10.1109/dcc.2014.59openalex-snapshot
Lossless Compression of DNA Microarray Images with Inversion Coder
inferred← citeshttps://doi.org/10.1109/fit.2011.58openalex-snapshot
Gradient Adjusted Predictor with Pseudo-Distance Technique for Lossless Compression of Color-Mapped Images
inferred← citeshttps://doi.org/10.1109/honet.2012.6421452openalex-snapshot
Lossless compression of dithered images with the pseudo-distance technique
inferred← citeshttps://doi.org/10.1109/honet.2013.6729771openalex-snapshot
Parallel lossless compression of color-mapped images
inferred← citeshttps://doi.org/10.1109/honet.2014.7029387openalex-snapshot
Lossless compression of DNA Microarray images with Inversion Coder
inferred← citeshttps://doi.org/10.1109/honet.2017.8102221openalex-snapshot
Splitting bits for lossless compression of microarray images
inferred← citeshttps://doi.org/10.1109/icet.2010.5638494openalex-snapshot
Lossless image compression using kernel based Global Structure Transform (GST)
inferred← citeshttps://doi.org/10.1109/icmew.2013.6618253openalex-snapshot
An efficient representation for permutations
inferred← citeshttps://doi.org/10.1109/icsccw.2009.5379436openalex-snapshot
Lossless EEG signal compression
inferred← citeshttps://doi.org/10.1109/jphot.2013.2264276openalex-snapshot
Lossless Compression of Dithered Images
inferred← citeshttps://doi.org/10.1109/sahcn.2009.5168975openalex-snapshot
Stream-oriented Lossless Packet Compression in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/secon.2015.7132957openalex-snapshot
Improved distance coding of binary images by run length coding of the most probable interval
inferred← citeshttps://doi.org/10.1109/sitis.2008.40openalex-snapshot
Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques)
inferred← citeshttps://doi.org/10.1109/tbme.2006.888820openalex-snapshot
ECG Signal Compression Based on Burrows-Wheeler Transformation and Inversion Ranks of Linear Prediction
inferred← citeshttps://doi.org/10.1109/tc.2007.70762openalex-snapshot
Efficient Algorithms for the Inverse Sort Transform
inferred← citeshttps://doi.org/10.1109/tit.2006.878177openalex-snapshot
A Comparison of Methods for Redundancy Reduction in Recurrence Time Coding
inferred← citeshttps://doi.org/10.1109/wisa.2013.20openalex-snapshot
Compression and Indexing Based on BWT: A Survey
inferred← citeshttps://doi.org/10.1109/wnyipw.2011.6122887openalex-snapshot
Block-sorting transformations with pseudo-distance technique for lossless compression of color-mapped images
inferred← citeshttps://doi.org/10.1117/12.651697openalex-snapshot
The impact of lossless image compression to radiographs
inferred← citeshttps://doi.org/10.1117/12.929940openalex-snapshot
A new context-model for the pseudo-distance technique in lossless compression of color-mapped images
inferred← citeshttps://doi.org/10.1145/1082036.1082043openalex-snapshot
Boosting textual compression in optimal linear time
inferred← citeshttps://doi.org/10.1145/1198513.1198521openalex-snapshot
When indexing equals compression
inferred← citeshttps://doi.org/10.1145/1921659.1921673openalex-snapshot
Computing the inverse sort transform in linear time
inferred← citeshttps://doi.org/10.1177/1094342006074860openalex-snapshot
Lossless and Near-Lossless Compression of Ecg Signals with Block-Sorting Techniques
inferred← citeshttps://doi.org/10.1515/piko.2003.140openalex-snapshot
Verlustlose Datenkompression auf Grundlage der Burrows-Wheeler-Transformation
inferred← citeshttps://doi.org/10.21936/si2010_v31.n4b.338openalex-snapshot
Sekwencyjne i równolegle algorytmy znajdowania podciągów
inferred← citeshttps://doi.org/10.2298/csis110606004mopenalex-snapshot
Wavelet trees: A survey
inferred← citeshttps://doi.org/10.25439/rmt.27354450openalex-snapshot
Scalable succinct indexing for large text collections
inferred← citeshttps://doi.org/10.25439/rmt.27586407openalex-snapshot
Space efficient algorithms for string processing
inferred← citeshttps://doi.org/10.48550/arxiv.0711.3338openalex-snapshot
Bounds for Compression in Streaming Models
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1080openalex-snapshot
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
inferred← citeshttps://doi.org/10.5555/982792.982892openalex-snapshot
Compression boosting in optimal linear time using the Burrows-Wheeler 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.