On the public citation graph
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
0 signed · 197 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.1007/978-3-030-17083-7_10openalex-snapshot
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment
inferredcites →https://doi.org/10.1007/978-3-319-67428-5_24openalex-snapshot
A Self-index on Block Trees
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_8openalex-snapshot
Constructing Efficient Dictionaries in Close to Sorting Time
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1007/s00224-006-1198-xopenalex-snapshot
Compressed Suffix Trees with Full Functionality
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.1007/s11786-009-0007-8openalex-snapshot
Finding Range Minima in the Middle: Approximations and Applications
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1016/j.is.2016.04.002openalex-snapshot
Universal indexes for highly repetitive document collections
inferredcites →https://doi.org/10.1016/j.jda.2004.08.002openalex-snapshot
Space efficient linear time construction of suffix arrays
inferredcites →https://doi.org/10.1016/j.jda.2004.08.019openalex-snapshot
Constructing suffix arrays in linear time
inferredcites →https://doi.org/10.1016/j.jda.2014.10.003openalex-snapshot
Approximate pattern matching in LZ77-compressed texts
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.2009.09.012openalex-snapshot
Faster entropy-bounded compressed suffix trees
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.2013.07.024openalex-snapshot
Fast relative Lempel–Ziv self-index for similar sequences
inferredcites →https://doi.org/10.1016/j.tcs.2015.05.027openalex-snapshot
Approximation of grammar-based compression via recompression
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.032openalex-snapshot
A really simple approximation of smallest grammar
inferredcites →https://doi.org/10.1016/j.tcs.2017.12.021openalex-snapshot
Time–space trade-offs for Lempel–Ziv compressed indexing
inferredcites →https://doi.org/10.1016/j.tcs.2018.09.007openalex-snapshot
Universal compressed text indexing
inferredcites →https://doi.org/10.1016/j.tcs.2018.11.022openalex-snapshot
Document listing on repetitive collections with guaranteed performance
inferredcites →https://doi.org/10.1016/s0168-9525(00)02030-8openalex-snapshot
Adjusting the focus on human variation
inferredcites →https://doi.org/10.1016/s0304-3975(02)00777-6openalex-snapshot
Application of Lempel–Ziv factorization to the approximation of grammar-based compression
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1038/nmeth.1923openalex-snapshot
Fast gapped-read alignment with Bowtie 2
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1093/nar/gkr854openalex-snapshot
The sequence read archive: explosive growth of sequencing data
inferredcites →https://doi.org/10.1101/gr.114819.110openalex-snapshot
Efficient storage of high throughput DNA sequencing data using reference-based compression
inferredcites →https://doi.org/10.1109/18.841160openalex-snapshot
Grammar-based codes: a new class of universal lossless source codes
inferredcites →https://doi.org/10.1109/5.892708openalex-snapshot
Off-line dictionary-based compression
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/090779759openalex-snapshot
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
inferredcites →https://doi.org/10.1137/1.9781611975482.82openalex-snapshot
Optimal Construction of Compressed Indexes for Highly Repetitive Texts
inferredcites →https://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferredcites →https://doi.org/10.1137/140998949openalex-snapshot
Time-Optimal Top-$k$ Document Retrieval
inferredcites →https://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferredcites →https://doi.org/10.1145/1217856.1217858openalex-snapshot
Linear work suffix array construction
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1290672.1290680openalex-snapshot
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferredcites →https://doi.org/10.1145/1963190.2025378openalex-snapshot
Theory and practice of monotone minimal perfect hashing
inferredcites →https://doi.org/10.1145/2000807.2000821openalex-snapshot
Fully compressed suffix trees
inferredcites →https://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferredcites →https://doi.org/10.1145/2629339openalex-snapshot
Optimal Lower and Upper Bounds for Representing Sequences
inferredcites →https://doi.org/10.1145/2635816openalex-snapshot
Alphabet-Independent Compressed Text Indexing
inferredcites →https://doi.org/10.1145/2851495openalex-snapshot
Faster Compressed Suffix Trees for Repetitive Collections
inferredcites →https://doi.org/10.1145/28869.28873openalex-snapshot
Complete inverted files for efficient text retrieval and analysis
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/322344.322346openalex-snapshot
Data compression via textual substitution
inferredcites →https://doi.org/10.1145/355541.355547openalex-snapshot
On the sorting-complexity of suffix tree construction
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
inferredcites →https://doi.org/10.1186/gb-2009-10-3-r25openalex-snapshot
Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
inferredcites →https://doi.org/10.1371/journal.pbio.1002195openalex-snapshot
Big Data: Astronomical or Genomical?
inferredcites →https://doi.org/10.3389/fgene.2018.00035openalex-snapshot
Comparison of Burrows-Wheeler Transform-Based Mapping Algorithms Used in High-Throughput Whole-Genome Sequencing: Application to Illumina Data for Livestock Genomes1
inferredcites →https://doi.org/10.4230/lipics.cpm.2018.7openalex-snapshot
Online LZ77 Parsing and Matching Statistics with RLBWTs
inferredcites →https://doi.org/10.5555/1195881.1195885openalex-snapshot
Succinct suffix arrays based on run-length encoding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4809476openalex-extracted
Non-Overlapping Indexing in Bwt-Runs Bounded Space
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_1openalex-snapshot
Contextual Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_21openalex-snapshot
Tailoring r-index for Document Listing Towards Metagenomics Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_4openalex-snapshot
Smaller Fully-Functional Bidirectional BWT Indexes
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_7openalex-snapshot
Relative Lempel-Ziv Compression of Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_17openalex-snapshot
Towards a Definitive Measure of Repetitiveness
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_18openalex-snapshot
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
inferred← citeshttps://doi.org/10.1007/978-3-030-86692-1_9openalex-snapshot
An LMS-Based Grammar Self-index with Local Consistency Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_11openalex-snapshot
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_15openalex-snapshot
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_19openalex-snapshot
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_7openalex-snapshot
Accessing the Suffix Array via $$\phi ^{-1}$$-Forest
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-21534-6_14openalex-snapshot
Scalable Text Index Construction
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_13openalex-snapshot
Computing All-vs-All MEMs in Grammar-Compressed Text
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_21openalex-snapshot
Non-overlapping Indexing in BWT-Runs Bounded Space
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_26openalex-snapshot
Constant Time and Space Updates for the Sigma-Tau Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_8openalex-snapshot
Data Structures for SMEM-Finding in the PBWT
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_10openalex-snapshot
Space-Efficient Conversions from SLPs
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_5openalex-snapshot
Iterated Straight-Line Programs
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-032-01475-7_4openalex-snapshot
Universally Wheeler Languages
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_6openalex-snapshot
Prefix-Free Parsing for Merging Big BWTs
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_17openalex-snapshot
Efficient Computation of Discriminative Absent Words for String Collections
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_53-2openalex-snapshot
Compressed Indexes for Repetitive Textual Datasets
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_6openalex-snapshot
Information Processing on Compressed Data
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-025-10245-8openalex-snapshot
LZ78 Substring Compression in Compressed Space
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.1007/s00236-024-00467-7openalex-snapshot
Comparative genomics with succinct colored de Bruijn graphs
inferred← citeshttps://doi.org/10.1007/s00236-025-00481-3openalex-snapshot
Generalized straight-line programs
inferred← citeshttps://doi.org/10.1007/s00453-022-01007-wopenalex-snapshot
Algorithms and Complexity on Indexing Founder Graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00935-7openalex-snapshot
Text indexing for long patterns using locally consistent anchors
inferred← citeshttps://doi.org/10.1007/s10732-025-09548-3openalex-snapshot
Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem
inferred← citeshttps://doi.org/10.1007/s11047-022-09882-6openalex-snapshot
Computational graph pangenomics: a tutorial on data structures and their applications
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2025.108870openalex-snapshot
Measuring genomic data with prefix-free parsing
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104749openalex-snapshot
Faster repetition-aware compressed suffix trees based on Block Trees
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104999openalex-snapshot
Sensitivity of string compressors and repetitiveness measures
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105068openalex-snapshot
A new class of string transformations for compressed text indexing
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105088openalex-snapshot
Efficient construction of the BWT for repetitive text using string compression
inferred← citeshttps://doi.org/10.1016/j.is.2025.102624openalex-snapshot
Estimating the compressibility of raster data
inferred← citeshttps://doi.org/10.1016/j.isci.2021.102696openalex-snapshot
Pan-genomic matching statistics for targeted nanopore sequencing
inferred← citeshttps://doi.org/10.1016/j.isci.2025.114029openalex-snapshot
Run-length compressed metagenomic read classification with SMEM-finding and tagging
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.12.001openalex-snapshot
Grammar-compressed indexes with logarithmic search time
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.006openalex-snapshot
A combinatorial view on string attractors
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.034openalex-snapshot
Improved characters distance sampling for online and offline text searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114128openalex-snapshot
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115004openalex-snapshot
On the number of equal-letter runs of the bijective Burrows-Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115512openalex-snapshot
Non-overlapping indexing in BWT-runs bounded space
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115626openalex-snapshot
The Burrows-Wheeler transform of an elastic-degenerate string and its application to pattern matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115796openalex-snapshot
Matching statistics—a survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115824openalex-snapshot
Encodings for range minimum queries over bounded alphabets
inferred← citeshttps://doi.org/10.1038/s41592-022-01731-9openalex-snapshot
Haplotype-aware pantranscriptome analyses using spliced pangenome graphs
inferred← citeshttps://doi.org/10.1038/s41592-024-02407-2openalex-snapshot
Personalized pangenome references
inferred← citeshttps://doi.org/10.1038/s41592-025-02625-2openalex-snapshot
Efficient and robust search of microbial genomes via phylogenetic compression
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac656openalex-snapshot
GBZ file format for pangenome graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad552openalex-snapshot
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae213openalex-snapshot
Sigmoni: classification of nanopore signal with a compressed pangenome index
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae333openalex-snapshot
A survey of BWT variants for string collections
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae717openalex-snapshot
BWT construction and search at the terabase scale
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaf225openalex-snapshot
Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaf652openalex-snapshot
Columba: fast approximate pattern matching with optimized search schemes
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.1093/bioinformatics/btag362openalex-snapshot
Movi 2: fast and space-efficient queries on pangenomes
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf102openalex-snapshot
Engineering rank/select data structures for large-alphabet strings
inferred← citeshttps://doi.org/10.1101/2021.07.06.451246openalex-snapshot
MONI: A Pangenomics Index for Finding MEMs
inferred← citeshttps://doi.org/10.1101/2022.08.09.503358openalex-snapshot
MONI- k : An index for efficient pangenome-to-pangenome comparison
inferred← citeshttps://doi.org/10.1101/2022.09.16.508250openalex-snapshot
Compressed Data Structures for Population-Scale Positional Burrows–Wheeler Transforms
inferred← citeshttps://doi.org/10.1101/2023.02.15.528658openalex-snapshot
μ -PBWT: Enabling the Storage and Use of UK Biobank Data on a Commodity Laptop
inferred← citeshttps://doi.org/10.1101/2024.05.25.595899openalex-snapshot
Cliffy: robust 16S rRNA classification based on a compressed LCA index
inferred← citeshttps://doi.org/10.1101/2024.05.30.596587openalex-snapshot
b-move: faster bidirectional character extensions in a run-length compressed index
inferred← citeshttps://doi.org/10.1101/2025.10.04.680405openalex-snapshot
RawBench: A Comprehensive Benchmarking Framework for Raw Nanopore Signal Analysis Techniques
inferred← citeshttps://doi.org/10.1101/gr.279846.124openalex-snapshot
Robust 16S rRNA classification based on a compressed LCA index
inferred← citeshttps://doi.org/10.1101/gr.281245.125openalex-snapshot
Building genomic data structures from compressed representations using prefix-free parsing
inferred← citeshttps://doi.org/10.1109/access.2022.3221520openalex-snapshot
Compressing and Querying Integer Dictionaries Under Linearities and Repetitions
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00016openalex-snapshot
A grammar compressor for collections of reads with applications to the construction of the BWT
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00027openalex-snapshot
PHONI: Streamed Matching Statistics with Multi-Genome References
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00028openalex-snapshot
Efficiently Merging r-indexes
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00017openalex-snapshot
CSTs for Terabyte-Sized Data
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00032openalex-snapshot
Converting RLBWT to LZ77 in smaller space
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00016openalex-snapshot
Bit-Parallel (Compressed) Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00024openalex-snapshot
Contextual Pattern Matching in Less Space
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00035openalex-snapshot
Augmented Thresholds for MONI
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00020openalex-snapshot
Faster Maximal Exact Matches with Lazy LCP Evaluation
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00030openalex-snapshot
Faster Wavelet Tree Queries
inferred← citeshttps://doi.org/10.1109/dcc62719.2025.00021openalex-snapshot
LZHV: Accelerating LZ77 Compression Algorithm with Hash Verification
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00097openalex-snapshot
Resolution of the Burrows-Wheeler Transform Conjecture
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00114openalex-snapshot
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00367openalex-snapshot
Space-Efficient Indexes for Uncertain Strings
inferred← citeshttps://doi.org/10.1109/icdm65498.2025.00015openalex-snapshot
Resilient Pattern Mining
inferred← citeshttps://doi.org/10.1109/tit.2020.3042746openalex-snapshot
On the Approximation Ratio of Ordered Parsings
inferred← citeshttps://doi.org/10.1109/tit.2022.3224382openalex-snapshot
Toward a Definitive Compressibility Measure for Repetitive Sequences
inferred← citeshttps://doi.org/10.1109/tkde.2022.3231780openalex-snapshot
Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search
inferred← citeshttps://doi.org/10.1111/cgf.70116openalex-snapshot
Random Access Segmentation Volume Compression for Interactive Volume Rendering
inferred← citeshttps://doi.org/10.1142/s0218195922410047openalex-snapshot
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
inferred← citeshttps://doi.org/10.1145/3416971openalex-snapshot
Three success stories about compact data structures
inferred← citeshttps://doi.org/10.1145/3432999openalex-snapshot
Indexing Highly Repetitive String Collections, Part II
inferred← citeshttps://doi.org/10.1145/3434399openalex-snapshot
Indexing Highly Repetitive String Collections, Part I
inferred← citeshttps://doi.org/10.1145/3519935.3520061openalex-snapshot
Dynamic suffix array with polylogarithmic queries and updates
inferred← citeshttps://doi.org/10.1145/3531445openalex-snapshot
Resolution of the burrows-wheeler transform conjecture
inferred← citeshttps://doi.org/10.1145/3607471openalex-snapshot
Co-lexicographically Ordering Automata and Regular Languages - Part I
inferred← citeshttps://doi.org/10.1145/3677608openalex-snapshot
Tight Bounds for Monotone Minimal Perfect Hashing
inferred← citeshttps://doi.org/10.1145/3701561openalex-snapshot
Computing MEMs and Relatives on Repetitive Text Collections
inferred← citeshttps://doi.org/10.1145/3717823.3718291openalex-snapshot
On the Hardness Hierarchy for the 𝑂(𝑛 √log 𝑛) Complexity in the Word RAM
inferred← citeshttps://doi.org/10.1145/3725232openalex-snapshot
Differentially Private Substring and Document Counting
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1145/3807503.3819488openalex-snapshot
Generic and Easy Method to Update Static Text Indexes
inferred← citeshttps://doi.org/10.1186/s12859-020-03586-3openalex-snapshot
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform
inferred← citeshttps://doi.org/10.1186/s12859-023-05531-6openalex-snapshot
Pan-genome de Bruijn graph using the bidirectional FM-index
inferred← citeshttps://doi.org/10.1186/s13015-023-00245-zopenalex-snapshot
Suffix sorting via matching statistics
inferred← citeshttps://doi.org/10.1186/s13015-024-00255-5openalex-snapshot
Finding maximal exact matches in graphs
inferred← citeshttps://doi.org/10.1186/s13015-024-00260-8openalex-snapshot
Pfp-fm: an accelerated FM-index
inferred← citeshttps://doi.org/10.1186/s13015-025-00281-xopenalex-snapshot
b-move: faster lossless approximate pattern matching in a run-length compressed index
inferred← citeshttps://doi.org/10.1186/s13015-026-00301-4openalex-snapshot
Lossless pangenome indexing using tag arrays
inferred← citeshttps://doi.org/10.1186/s13059-023-02958-1openalex-snapshot
SPUMONI 2: improved classification using a pangenome index of minimizer digests.
inferred← citeshttps://doi.org/10.1186/s13059-025-03606-6openalex-snapshot
A survey of sequence-to-graph mapping algorithms in the pangenome era
inferred← citeshttps://doi.org/10.14778/3598581.3598586openalex-snapshot
Text Indexing for Long Patterns: Anchors are All you Need
inferred← citeshttps://doi.org/10.3390/a14010014openalex-snapshot
Subpath Queries on Compressed Graphs: A Survey
inferred← citeshttps://doi.org/10.3390/math13071070openalex-snapshot
Compression Sensitivity of the Burrows–Wheeler Transform and Its Bijective Variant
inferred← citeshttps://doi.org/10.6084/m9.figshare.22949448openalex-snapshot
Additional file 2 of SPUMONI 2: improved classification using a pangenome index of minimizer digests
inferred← citeshttps://doi.org/10.6084/m9.figshare.26632834openalex-snapshot
Additional file 1 of Pan-genome de Bruijn graph using the bidirectional FM-index
inferred← citeshttps://doi.org/10.70675/a61f77f4z0662z41e2z8db6zc2604537b1c1openalex-snapshot
Sketch-based approaches to process massive string data
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.