On the public citation graph

Burrows-Wheeler Transform for Terabases

https://doi.org/10.1109/dcc.2016.17
0 signed · 43 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.1007/978-3-319-02432-5_5openalex-snapshot
Space-Efficient Construction of the Burrows-Wheeler Transform
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_28openalex-snapshot
From Theory to Practice: Plug and Play with Succinct Data Structures
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_28openalex-snapshot
Parallel External Memory Suffix Sorting
inferredcites →https://doi.org/10.1007/978-3-319-20119-1_13openalex-snapshot
BWTCP: A Parallel Method for Constructing BWT in Large Collection of Genomic Reads
inferredcites →https://doi.org/10.1007/978-3-642-03784-9_7openalex-snapshot
Compressed Suffix Arrays for Massive Data
inferredcites →https://doi.org/10.1007/978-3-642-03784-9_9openalex-snapshot
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
inferredcites →https://doi.org/10.1007/s00453-006-1228-8openalex-snapshot
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
inferredcites →https://doi.org/10.1007/s00453-011-9535-0openalex-snapshot
Lightweight Data Indexing and Compression in External Memory
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.018openalex-snapshot
Fast BWT in small space by blockwise suffix sorting
inferredcites →https://doi.org/10.1016/j.tcs.2012.02.002openalex-snapshot
Lightweight algorithms for constructing and inverting the BWT of string collections
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1038/nature15393openalex-snapshot
A global reference for human genetic variation
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1093/bioinformatics/bts173openalex-snapshot
Large-scale compression of genomic sequence databases with the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1093/bioinformatics/btu541openalex-snapshot
Fast construction of FM-index for long sequence reads
inferredcites →https://doi.org/10.1101/gr.126953.111openalex-snapshot
Efficient de novo assembly of large genomes using compressed data structures
inferredcites →https://doi.org/10.1109/tc.2010.188openalex-snapshot
Two Efficient Algorithms for Linear Time Suffix Array Construction
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/1240233.1240244openalex-snapshot
Compressed indexes for dynamic text collections
inferredcites →https://doi.org/10.1145/2518175openalex-snapshot
Suffix Array Construction in External Memory Using D-Critical Substrings
inferredcites →https://doi.org/10.1186/s13059-015-0587-3openalex-snapshot
Extending reference assembly models
inferredcites →https://doi.org/10.48550/arxiv.1401.7457openalex-snapshot
GPU-Accelerated BWT Construction for Large Collection of Short Reads
inferredcites →https://doi.org/10.48550/arxiv.1410.0562openalex-snapshot
A massively parallel algorithm for constructing the BWT of large string sets
inferredcites →https://doi.org/10.48550/arxiv.1502.03744openalex-snapshot
Correcting Illumina sequencing errors for human data

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-319-67428-5_15openalex-snapshot
Lightweight BWT and LCP Merging via the Gap Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-021-00855-2openalex-snapshot
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.021openalex-snapshot
A survey of string orderings and their application to the Burrows–Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.001openalex-snapshot
Lightweight merging of compressed indices based on BWT variants
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz350openalex-snapshot
Building large updatable colored de Bruijn graphs via merging
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz575openalex-snapshot
Haplotype-aware graph indexes
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00028openalex-snapshot
Efficiently Merging r-indexes
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00014openalex-snapshot
Recursive Prefix-Free Parsing for Building Big BWTs
inferred← citeshttps://doi.org/10.1109/ssd.2019.8893156openalex-snapshot
Compression's Methods based on Frequency and Time Frequency Transforms applied on DNA's images
inferred← citeshttps://doi.org/10.1145/3432999openalex-snapshot
Indexing Highly Repetitive String Collections, Part II
inferred← citeshttps://doi.org/10.1186/s13015-019-0148-5openalex-snapshot
Prefix-free parsing for building big BWTs
inferred← citeshttps://doi.org/10.21105/joss.04363openalex-snapshot
RedOak: a reference-free and alignment-free structure for indexing a collection of similar genomes
inferred← citeshttps://doi.org/10.3390/bdcc10050140openalex-snapshot
BWT-Enhanced Compression for GIS Raster Data: A Hybrid AV1-Inspired Approach with Burrows–Wheeler Transform
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.987504openalex-snapshot
Engineering augmented suffix sorting algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1610.03007openalex-snapshot
Scalable Construction of Text Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02781openalex-snapshot
Indexing Highly Repetitive String Collections
inferred← citeshttps://doi.org/10.70675/2927454bz0561z488bzace9zf596a2418430openalex-snapshot
Étude des différentes approches d’indexation du génome au pan-génome : application aux génomes de riz
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.