On the public citation graph

Lempel—Ziv Index for q -Grams

https://doi.org/10.1007/pl00009205
0 signed · 52 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/3-540-54345-7_67openalex-snapshot
Two algorithms for approxmate string matching in static texts
inferredcites →https://doi.org/10.1007/3-540-58094-8_23openalex-snapshot
Approximate string matching and local similarity
inferredcites →https://doi.org/10.1007/3-540-58325-4_186openalex-snapshot
Approximate pattern matching with samples
inferredcites →https://doi.org/10.1007/3-540-60313-1_153openalex-snapshot
On using q-gram locations in approximate string matching
inferredcites →https://doi.org/10.1007/3-540-61258-0_4openalex-snapshot
Filtration with q-samples in approximate string matching
inferredcites →https://doi.org/10.1007/bf01185431openalex-snapshot
Sublinear approximate string matching and biological applications
inferredcites →https://doi.org/10.1007/bf01185432openalex-snapshot
A sublinear algorithm for approximate keyword searching
inferredcites →https://doi.org/10.1007/bf01188584openalex-snapshot
Multiple filtration and approximate pattern matching
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90188-9openalex-snapshot
Simple and efficient string matching with k mismatches
inferredcites →https://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
inferredcites →https://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1137/0222018openalex-snapshot
Approximate Boyer–Moore String Matching
inferredcites →https://doi.org/10.1145/135239.135244openalex-snapshot
Fast text searching
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11496656_5openalex-snapshot
Succinct Suffix Arrays Based on Run-Length Encoding
inferred← citeshttps://doi.org/10.1007/11880561_11openalex-snapshot
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_35openalex-snapshot
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
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-540-77050-3_35openalex-snapshot
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_8openalex-snapshot
Compact q-Gram Profiling of Compressed Strings
inferred← citeshttps://doi.org/10.1007/s00453-013-9836-6openalex-snapshot
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/s00453-017-0333-1openalex-snapshot
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
inferred← citeshttps://doi.org/10.1007/s00778-007-0082-xopenalex-snapshot
Structural optimization of a full-text n-gram index using relational normalization
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104518openalex-snapshot
A compressed dynamic self-index for highly repetitive text collections
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.010openalex-snapshot
Compact q-gram profiling of compressed strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.12.021openalex-snapshot
Time–space trade-offs for Lempel–Ziv compressed indexing
inferred← citeshttps://doi.org/10.1016/s0065-2458(04)63006-3openalex-snapshot
Search and Retrieval of Compressed Text
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00087-7openalex-snapshot
New text indexing functionalities of the compressed suffix arrays
inferred← citeshttps://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.002openalex-snapshot
String matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.003openalex-snapshot
Multiple string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.004openalex-snapshot
Extended string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.005openalex-snapshot
Regular expression matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.006openalex-snapshot
Approximate matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.007openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.008openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferred← citeshttps://doi.org/10.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferred← citeshttps://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferred← citeshttps://doi.org/10.1145/335305.335351openalex-snapshot
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
inferred← citeshttps://doi.org/10.1145/3607141openalex-snapshot
String Indexing with Compressed Patterns
inferred← citeshttps://doi.org/10.3389/fbioe.2015.00012openalex-snapshot
Searching and Indexing Genomic Databases via Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5373openalex-snapshot
Compact q-gram Profiling of Compressed Strings
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1591openalex-snapshot
Searching and Indexing Genomic Databases via Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02605openalex-snapshot
Lempel Ziv Computation In Small Space (LZ-CISS)
inferred← citeshttps://doi.org/10.5353/th_b3105973openalex-snapshot
On the construction and application of compressed text indexes
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.