On the public citation graph

Faster Compressed Suffix Trees for Repetitive Collections

https://doi.org/10.1145/2851495
0 signed · 76 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/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-oopenalex-snapshot
Reducing the space requirement of suffix trees
inferredcites →https://doi.org/10.1007/3-540-36574-5_7openalex-snapshot
Full-Text Indexes in External Memory
inferredcites →https://doi.org/10.1007/3-540-45061-0_29openalex-snapshot
Succinct Representations of Permutations
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_35openalex-snapshot
LCP Array Construction in External Memory
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_36openalex-snapshot
Faster Compressed Suffix Trees for Repetitive Text Collections
inferredcites →https://doi.org/10.1007/978-3-319-11918-2_4openalex-snapshot
Grammar Compressed Sequences with Rank/Select Support
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_26openalex-snapshot
Tree Transducers and Tree Compressions
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_9openalex-snapshot
Practical Compressed Suffix Trees
inferredcites →https://doi.org/10.1007/978-3-642-16321-0_34openalex-snapshot
CST++
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_17openalex-snapshot
Practical Compressed Document Retrieval
inferredcites →https://doi.org/10.1007/978-3-642-28332-1_21openalex-snapshot
A Faster Grammar-Based Self-index
inferredcites →https://doi.org/10.1007/978-3-642-29700-7_27openalex-snapshot
Fast Relative Lempel-Ziv Self-index for Similar Sequences
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-34109-0_5openalex-snapshot
Compressed Suffix Trees for Repetitive Texts
inferredcites →https://doi.org/10.1007/978-3-642-35926-2_29openalex-snapshot
Indexing Highly Repetitive Collections
inferredcites →https://doi.org/10.1007/978-3-642-38905-4_23openalex-snapshot
A Succinct Grammar Compression
inferredcites →https://doi.org/10.1007/978-3-642-45278-9_29openalex-snapshot
Suffix Tree of Alignment: An Efficient Index for Similar Data
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/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-001-0051-5openalex-snapshot
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
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/s11786-016-0281-1openalex-snapshot
Engineering a Lightweight External Memory Suffix Array Construction Algorithm
inferredcites →https://doi.org/10.1016/j.ipl.2010.02.010openalex-snapshot
Wee LCP
inferredcites →https://doi.org/10.1016/j.ipm.2012.08.003openalex-snapshot
DACs: Bringing direct access to variable-length codes
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.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/s1570-8667(03)00065-0openalex-snapshot
Replacing suffix trees with enhanced suffix arrays
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1038/ng1435openalex-snapshot
Genetic variation, classification and 'race'
inferredcites →https://doi.org/10.1038/ng1438openalex-snapshot
Implications of biogeography of human populations for 'race' and medicine
inferredcites →https://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/5.892708openalex-snapshot
Off-line dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2011.42openalex-snapshot
Tree Structure Compression with RePair
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tkde.2013.129openalex-snapshot
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays
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.9781611972900.9openalex-snapshot
Succinct Trees in Practice
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1227161.1402296openalex-snapshot
Better external memory 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/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/301970.301973openalex-snapshot
The string B-tree
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.18725/oparu-3911openalex-snapshot
Compressed suffix trees: design, construction, and applications
inferredcites →https://doi.org/10.3233/fi-2011-565openalex-snapshot
Self-Indexed Grammar-Based Compression
inferredcites →https://doi.org/10.3390/a6020319openalex-snapshot
Practical Compressed Suffix Trees
inferredcites →https://doi.org/10.48550/arxiv.1109.3954openalex-snapshot
A Faster Grammar-Based Self-Index
inferredcites →https://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees

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-32686-9_31openalex-snapshot
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-55108-7_4openalex-snapshot
Inducing the LCP Array
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_4openalex-snapshot
Grammar Compressed Sequences with Rank/Select Support
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_4openalex-snapshot
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_22openalex-snapshot
CHICO: A Compressed Hybrid Index for Repetitive 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-3-662-49529-2_44openalex-snapshot
Tree Compression Using String Grammars
inferred← citeshttps://doi.org/10.1007/s42979-023-01760-xopenalex-snapshot
Backward Pattern Matching on Elastic-Degenerate Strings
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.tcs.2015.08.008openalex-snapshot
FM-index of alignment: A compressed index for similar strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.020openalex-snapshot
FM-index of alignment with gaps
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.009openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.014openalex-snapshot
Recent Trends
inferred← citeshttps://doi.org/10.1093/comjnl/bxx108openalex-snapshot
Relative Suffix Trees
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00027openalex-snapshot
PHONI: Streamed Matching Statistics with Multi-Genome References
inferred← citeshttps://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferred← citeshttps://doi.org/10.1145/3375890openalex-snapshot
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
inferred← citeshttps://doi.org/10.1145/3750729openalex-snapshot
Fast and Small Subsampled R-indexes
inferred← citeshttps://doi.org/10.30534/ijiscs/2018/03752018openalex-snapshot
An Enhanced Text Mining Approach using Dynamic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1901.10453openalex-snapshot
Simulating the DNA String Graph in Succinct Space
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02781openalex-snapshot
Indexing Highly Repetitive String Collections
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.