On the public citation graph
Indexing Highly Repetitive String Collections, Part II
0 signed · 150 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/11496656_5openalex-snapshot
Succinct Suffix Arrays Based on Run-Length Encoding
inferredcites →https://doi.org/10.1007/11780441_28openalex-snapshot
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
inferredcites →https://doi.org/10.1007/978-3-319-02432-5_25openalex-snapshot
Fully-Online Grammar Compression
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_15openalex-snapshot
Lempel Ziv Computation in Small Space (LZ-CISS)
inferredcites →https://doi.org/10.1007/978-3-319-23826-5_2openalex-snapshot
Fast Online Lempel-Ziv Factorization in Compressed Space
inferredcites →https://doi.org/10.1007/978-3-319-58741-7_17openalex-snapshot
Flexible Indexing of Repetitive Collections
inferredcites →https://doi.org/10.1007/978-3-319-67428-5_14openalex-snapshot
Fast Label Extraction in the CDAWG
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-319-67428-5_26openalex-snapshot
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
inferredcites →https://doi.org/10.1007/978-3-319-77404-6_25openalex-snapshot
Compressed Indexing with Signature Grammars
inferredcites →https://doi.org/10.1007/978-3-540-89097-3_17openalex-snapshot
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
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/978-3-642-03816-7_21openalex-snapshot
Self-indexed Text Compression Using Straight-Line Programs
inferredcites →https://doi.org/10.1007/978-3-642-21458-5_4openalex-snapshot
Lempel-Ziv Factorization Revisited
inferredcites →https://doi.org/10.1007/978-3-642-21458-5_6openalex-snapshot
Self-indexing Based on LZ77
inferredcites →https://doi.org/10.1007/978-3-642-34109-0_19openalex-snapshot
Improved Grammar-Based Compressed Indexes
inferredcites →https://doi.org/10.1007/978-3-642-38527-8_14openalex-snapshot
Lightweight Lempel-Ziv Parsing
inferredcites →https://doi.org/10.1007/978-3-642-54423-1_63openalex-snapshot
LZ77-Based Self-indexing with Faster Pattern Matching
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/978-3-662-07675-0_9openalex-snapshot
Automata for Matching Patterns
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_45openalex-snapshot
Approximating LZ77 via Small-Space Multiple-Pattern Matching
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_74openalex-snapshot
Compressed Data Structures for Dynamic Sequences
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1007/bf02522825openalex-snapshot
Maintaining dynamic sequences under equality tests in polylogarithmic time
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.1007/s00453-017-0327-zopenalex-snapshot
LZ77 Computation Based on the Run-Length Encoded BWT
inferredcites →https://doi.org/10.1007/s00453-017-0333-1openalex-snapshot
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
inferredcites →https://doi.org/10.1007/s00453-020-00722-6openalex-snapshot
Lempel–Ziv-Like Parsing in Small Space
inferredcites →https://doi.org/10.1007/s10618-008-0118-xopenalex-snapshot
Sourcerer: mining and searching internet-scale software repositories
inferredcites →https://doi.org/10.1007/s11786-007-0024-4openalex-snapshot
Lempel–Ziv Factorization Using Less Time & Space
inferredcites →https://doi.org/10.1016/j.dam.2019.01.014openalex-snapshot
Dynamic index and LZ factorization in compressed space
inferredcites →https://doi.org/10.1016/j.eswa.2009.12.003openalex-snapshot
Effective content-based video retrieval using pattern-indexing and matching techniques
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.jcss.2020.12.001openalex-snapshot
Grammar-compressed indexes with logarithmic search time
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.016openalex-snapshot
A fully linear-time approximation algorithm for grammar-based compression
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.2012.07.009openalex-snapshot
ESP-index: A compressed index based on edit-sensitive parsing
inferredcites →https://doi.org/10.1016/j.jda.2013.06.003openalex-snapshot
Time–space trade-offs for longest common extensions
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.2007.07.018openalex-snapshot
Fast BWT in small space by blockwise suffix sorting
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.036openalex-snapshot
A quick tour on suffix arrays and compressed suffix arrays
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.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.2019.09.030openalex-snapshot
Parallel computation of the Burrows Wheeler Transform in compact space
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1017/cbo9781139940023openalex-snapshot
Genome-Scale Algorithm Design
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1089/cmb.2019.0309openalex-snapshot
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment
inferredcites →https://doi.org/10.1098/rsta.2013.0137openalex-snapshot
Hybrid indexes for repetitive datasets
inferredcites →https://doi.org/10.1108/k.2011.40.9_10.1555.5openalex-snapshot
Information Retrieval: Implementing and Evaluating Search Engines
inferredcites →https://doi.org/10.1109/5.892708openalex-snapshot
Off-line dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2013.21openalex-snapshot
Simpler and Faster Lempel Ziv Factorization
inferredcites →https://doi.org/10.1109/dcc.2016.17openalex-snapshot
Burrows-Wheeler Transform for Terabases
inferredcites →https://doi.org/10.1109/dcc.2016.38openalex-snapshot
Lempel-Ziv Computation in Compressed Space (LZ-CICS)
inferredcites →https://doi.org/10.1109/dcc.2017.73openalex-snapshot
LZ-End Parsing in Compressed Space
inferredcites →https://doi.org/10.1109/dcc.2018.00037openalex-snapshot
A Dynamic Compressed Self-Index for Highly Repetitive Text Collections
inferredcites →https://doi.org/10.1109/dcc.2019.00029openalex-snapshot
LZRR: LZ77 Parsing with Right Reference
inferredcites →https://doi.org/10.1109/dcc.2019.00060openalex-snapshot
RePair in Compressed Space and Time
inferredcites →https://doi.org/10.1109/dcc47342.2020.00023openalex-snapshot
Approximating Optimal Bidirectional Macro Schemes
inferredcites →https://doi.org/10.1109/dcc50243.2021.00016openalex-snapshot
A grammar compressor for collections of reads with applications to the construction of the BWT
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/070685373openalex-snapshot
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
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.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611972931.9openalex-snapshot
Lempel-Ziv Factorization: Simple, Fast, Practical
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/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/1367064.1367072openalex-snapshot
Dynamic entropy-compressed sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1998196.1998198openalex-snapshot
Orthogonal range searching on the RAM, revisited
inferredcites →https://doi.org/10.1145/225058.225288openalex-snapshot
String matching in Lempel-Ziv compressed strings
inferredcites →https://doi.org/10.1145/2629339openalex-snapshot
Optimal Lower and Upper Bounds for Representing Sequences
inferredcites →https://doi.org/10.1145/2699876openalex-snapshot
Lazy Lempel-Ziv Factorization Algorithms
inferredcites →https://doi.org/10.1145/28869.28873openalex-snapshot
Complete inverted files for efficient text retrieval and analysis
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/322234.322237openalex-snapshot
Linear Algorithm for Data Compression via String Matching
inferredcites →https://doi.org/10.1145/322344.322346openalex-snapshot
Data compression via textual substitution
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/3381417openalex-snapshot
Linear-time String Indexing and Analysis in Small Space
inferredcites →https://doi.org/10.1145/3426473openalex-snapshot
Optimal-Time Dictionary-Compressed Indexes
inferredcites →https://doi.org/10.1145/355541.355547openalex-snapshot
On the sorting-complexity of suffix tree construction
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.1186/s13015-019-0148-5openalex-snapshot
Prefix-free parsing for building big BWTs
inferredcites →https://doi.org/10.1561/1500000013openalex-snapshot
Mining Query Logs: Turning Search Usage Data into Knowledge
inferredcites →https://doi.org/10.2307/2670026openalex-snapshot
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
inferredcites →https://doi.org/10.3233/fi-2011-565openalex-snapshot
Self-Indexed Grammar-Based Compression
inferredcites →https://doi.org/10.3389/fbioe.2015.00012openalex-snapshot
Searching and Indexing Genomic Databases via Kernelization
inferredcites →https://doi.org/10.3390/a5020214openalex-snapshot
An Online Algorithm for Lightweight Grammar-Based Compression
inferredcites →https://doi.org/10.4230/lipics.esa.2017.67openalex-snapshot
A Space-Optimal Grammar Compression
inferredcites →https://doi.org/10.4230/lipics.stacs.2014.675openalex-snapshot
Faster Compact On-Line Lempel-Ziv Factorization
inferredcites →https://doi.org/10.48550/arxiv.1502.05937openalex-snapshot
Composite repetition-aware data structures
inferredcites →https://doi.org/10.48550/arxiv.1504.06954openalex-snapshot
Dynamic index, LZ factorization, and LCE queries in compressed space
inferredcites →https://doi.org/10.48550/arxiv.2004.02781openalex-snapshot
Indexing Highly Repetitive String Collections
inferredcites →https://doi.org/10.5281/zenodo.1417382openalex-snapshot
A Survey Of Music Information Retrieval Systems.
inferredcites →https://doi.org/10.5555/1109557.1109644openalex-snapshot
Oblivious string embeddings and edit distance approximations
inferredcites →https://doi.org/10.5555/1120060.1712350openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
inferredcites →https://doi.org/10.5860/choice.49-2718openalex-snapshot
Web data mining: exploring hyperlinks, contents, and usage 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-030-86692-1_14openalex-snapshot
A Separation of $$\gamma $$ and b via Thue–Morse Words
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-20624-5_6openalex-snapshot
Near-Optimal Search Time in $$\delta $$-Optimal Space
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_10openalex-snapshot
Substring Complexities on Run-Length Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-031-38854-5_6openalex-snapshot
Parallel Lossy Compression for Large FASTQ Files
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_19openalex-snapshot
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_9openalex-snapshot
Compressibility Measures for Two-Dimensional Data
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-72200-4_5openalex-snapshot
Generalization of Repetitiveness Measures for Two-Dimensional Strings
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_7openalex-snapshot
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_13openalex-snapshot
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
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-026-10287-6openalex-snapshot
Suffixient Arrays: A New Efficient Suffix Array Compression Technique
inferred← citeshttps://doi.org/10.1007/s00453-023-01186-0openalex-snapshot
Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa
inferred← citeshttps://doi.org/10.1007/s11192-026-05587-0openalex-snapshot
An analysis of ChatGPT’s performance in predicting countries and regions of origin from personal names
inferred← citeshttps://doi.org/10.1109/dcc58796.2024.00032openalex-snapshot
On the Hardness of Smallest RLSLPs and Collage Systems
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/icde65448.2025.00187openalex-snapshot
Indexing Labeled Property Multidigraphs in Entropy Space, with Applications
inferred← citeshttps://doi.org/10.1137/1.9781611977073.110openalex-snapshot
Pattern Matching on Grammar-Compressed Strings in Linear Time
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch187openalex-snapshot
Breaking the 𝒪( n )-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
inferred← citeshttps://doi.org/10.1145/3434399openalex-snapshot
Indexing Highly Repetitive String Collections, Part I
inferred← citeshttps://doi.org/10.1145/3701561openalex-snapshot
Computing MEMs and Relatives on Repetitive Text Collections
inferred← citeshttps://doi.org/10.1145/3776753openalex-snapshot
Lightweight Code Outlining for Android Applications
inferred← citeshttps://doi.org/10.1145/3777895openalex-snapshot
Computing NP-hard Repetitiveness Measures via MAX-SAT
inferred← citeshttps://doi.org/10.1186/s13015-023-00232-4openalex-snapshot
phyBWT2: phylogeny reconstruction via eBWT positional clustering
inferred← citeshttps://doi.org/10.3390/a14010014openalex-snapshot
Subpath Queries on Compressed Graphs: A Survey
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.56openalex-snapshot
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.70openalex-snapshot
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima
inferred← citeshttps://doi.org/10.6084/m9.figshare.26608350openalex-snapshot
Additional file 1 of phyBWT2: phylogeny reconstruction via eBWT positional clustering
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.