On the public citation graph

Resolution of the burrows-wheeler transform conjecture

https://doi.org/10.1145/3531445
0 signed · 33 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/047145916xopenalex-snapshot
Bioinformatics and Functional Genomics
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_3openalex-snapshot
Composite Repetition-Aware Data Structures
inferredcites →https://doi.org/10.1007/s00453-017-0327-zopenalex-snapshot
LZ77 Computation Based on the Run-Length Encoded BWT
inferredcites →https://doi.org/10.1016/j.ipl.2017.08.005openalex-snapshot
Two strings at Hamming distance 1 cannot be both quasiperiodic
inferredcites →https://doi.org/10.1016/j.jda.2018.09.002openalex-snapshot
A separation between RLSLPs and LZ77
inferredcites →https://doi.org/10.1016/j.jda.2018.11.002openalex-snapshot
A faster implementation of online RLBWT and its application to LZ77 parsing
inferredcites →https://doi.org/10.1016/j.tcs.2012.02.006openalex-snapshot
On compressing and indexing repetitive sequences
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.009openalex-snapshot
Tighter bounds for the sum of irreducible LCP values
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1137/1.9781611975482.82openalex-snapshot
Optimal Construction of Compressed Indexes for Highly Repetitive Texts
inferredcites →https://doi.org/10.1145/3188745.3188814openalex-snapshot
At the roots of dictionary compression: string attractors
inferredcites →https://doi.org/10.1145/3313276.3316368openalex-snapshot
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
inferredcites →https://doi.org/10.1145/3375890openalex-snapshot
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_9openalex-snapshot
Balancing Run-Length Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-33264-7_8openalex-snapshot
Bit Catastrophes for the Burrows-Wheeler Transform
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_14openalex-snapshot
Sublinear Time Lempel-Ziv (LZ77) Factorization
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_3openalex-snapshot
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_10openalex-snapshot
How to Find Long Maximal Exact Matches and Ignore Short Ones
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_2openalex-snapshot
Bijective BWT Based Compression Schemes
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_18openalex-snapshot
Smallest Suffixient Sets as a Repetitiveness Measure
inferred← citeshttps://doi.org/10.1007/s00224-024-10212-9openalex-snapshot
Bit Catastrophes for the Burrows-Wheeler Transform
inferred← citeshttps://doi.org/10.1007/s00224-026-10287-6openalex-snapshot
Suffixient Arrays: A New Efficient Suffix Array Compression Technique
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.129917openalex-snapshot
Enhancing storage efficiency for cloud-based vehicle data based on advanced lossless compression algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115259openalex-snapshot
Repetitiveness measures based on string morphisms
inferred← citeshttps://doi.org/10.1051/ita/2025020openalex-snapshot
Efficient k -mer dataset compression using Eulerian covers of de Bruijn graphs and BWT
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae333openalex-snapshot
A survey of BWT variants for string collections
inferred← citeshttps://doi.org/10.1093/bioinformatics/btag268openalex-snapshot
RLBWT-based LCP computation in compressed space for terabase-scale pangenome analysis
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00024openalex-snapshot
Contextual Pattern Matching in Less Space
inferred← citeshttps://doi.org/10.1109/scm62608.2024.10554194openalex-snapshot
Classification and Statistics of Application of Measurement Information Compression Methods
inferred← citeshttps://doi.org/10.17798/bitlisfen.1301546openalex-snapshot
Single and Binary Performance Comparison of Data Compression Algorithms for Text Files
inferred← citeshttps://doi.org/10.51382/978-3-96100-191-0openalex-snapshot
Combinatorial Properties of Periodic Patterns in Compressed Strings
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.