On the public citation graph
String Matching in Lempel—Ziv Compressed Strings
0 signed · 102 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/3-540-58201-0_70openalex-snapshot
Optimal two-dimensional compressed matching
inferredcites →https://doi.org/10.1007/3-540-60692-0_60openalex-snapshot
Pattern matching in compressed texts
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1109/dcc.1992.227453openalex-snapshot
Efficient two-dimensional compressed matching
inferredcites →https://doi.org/10.1109/ipps.1994.288279openalex-snapshot
PRAM algorithms for static dictionary compression
inferredcites →https://doi.org/10.1109/mc.1984.1659158openalex-snapshot
A Technique for High-Performance Data Compression
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.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.5555/314464.314675openalex-snapshot
An efficient algorithm for dynamic text indexing
inferredcites →https://doi.org/10.5555/314464.314678openalex-snapshot
Let sleeping files lie: pattern matching in Z-compressed files
inferredcites →https://doi.org/10.5860/choice.26-1566openalex-snapshot
Data compression: methods and theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.663openalex-snapshot
LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text
inferred← citeshttps://doi.org/10.1002/spe.669openalex-snapshot
A comparison of BWT approaches to string pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_16openalex-snapshot
Boyer—Moore String Matching over Ziv-Lempel Compressed Text
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_18openalex-snapshot
Approximate String Matching over Ziv—Lempel Compressed Text
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_1openalex-snapshot
Regular Expression Searching over Ziv-Lempel Compressed Text
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_3openalex-snapshot
Approximate Matching of Run-Length Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_81openalex-snapshot
Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_25openalex-snapshot
Compressed Indexing with Signature Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_24openalex-snapshot
The Sketching Complexity of Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_8openalex-snapshot
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_8openalex-snapshot
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
inferred← citeshttps://doi.org/10.1007/978-3-642-23638-9_10openalex-snapshot
One-Dimensional Staged Self-assembly
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_13openalex-snapshot
Fingerprints in Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_18openalex-snapshot
Orthogonal Range Searching for Text Indexing
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_7openalex-snapshot
Compression and Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00607-025-01469-0openalex-snapshot
Onto how compression yields energy-efficient text search
inferred← citeshttps://doi.org/10.1007/s11047-012-9359-0openalex-snapshot
One-dimensional staged self-assembly
inferred← citeshttps://doi.org/10.1007/s11047-014-9423-zopenalex-snapshot
Staged self-assembly and polyomino context-free grammars
inferred← citeshttps://doi.org/10.1007/springerreference_64079openalex-snapshot
Indexing Compressed Text
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.06.011openalex-snapshot
MultiPLZW: A novel multiple pattern matching search in LZW-compressed data
inferred← citeshttps://doi.org/10.1016/j.dam.2018.07.011openalex-snapshot
Direct merging of delta encoded files
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.002openalex-snapshot
Fingerprints in compressed strings
inferred← citeshttps://doi.org/10.1016/j.jss.2006.06.007openalex-snapshot
The design and evaluation of path matching schemes on compressed control flow traces
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.038openalex-snapshot
Efficient on-line repetition detection
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.023openalex-snapshot
Efficient retrieval of approximate palindromes in a run-length encoded string
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/s0020-0255(01)00098-6openalex-snapshot
An experimental study of a compressed index
inferred← citeshttps://doi.org/10.1016/s0065-2458(04)63006-3openalex-snapshot
Search and Retrieval of Compressed Text
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00032-7openalex-snapshot
Approximate string matching on Ziv–Lempel compressed text
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00036-4openalex-snapshot
Regular expression searching on compressed text
inferred← citeshttps://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
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.1109/aiccsa.2016.7945662openalex-snapshot
Ensuring consistent dynamic adaptation: An approach from design to runtime
inferred← citeshttps://doi.org/10.1109/csb.2003.1227416openalex-snapshot
The SCP and compressed domain analysis of biological sequences
inferred← citeshttps://doi.org/10.1109/csb.2004.1332418openalex-snapshot
Compressed pattern matching in DNA sequences
inferred← citeshttps://doi.org/10.1109/dcc.2001.917177openalex-snapshot
Faster approximate string matching over compressed text
inferred← citeshttps://doi.org/10.1109/dcc.2002.999952openalex-snapshot
Searching in compressed dictionaries
inferred← citeshttps://doi.org/10.1109/dcc.2003.1194077openalex-snapshot
Approximate pattern matching using the Burrows-Wheeler transform
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281544openalex-snapshot
LZW based compressed pattern matching
inferred← citeshttps://doi.org/10.1109/dcc.2005.5openalex-snapshot
A Flexible Compressed Text Retrieval System Using a Modified LZW Algorithm
inferred← citeshttps://doi.org/10.1109/dcc.2005.55openalex-snapshot
Multiple-Pattern Matching In LZW Compressed Files Using Aho-Corasick Algorithm
inferred← citeshttps://doi.org/10.1109/dcc.2019.00030openalex-snapshot
On Lempel-Ziv Decompression in Small Space
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00022openalex-snapshot
Decompressing Lempel-Ziv Compressed Text
inferred← citeshttps://doi.org/10.1109/icit52682.2021.9491642openalex-snapshot
A Text Search Algorithm in Compressed Text
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286636openalex-snapshot
Modified LZW algorithm for efficient compressed text retrieval
inferred← citeshttps://doi.org/10.1109/itcc.2005.206openalex-snapshot
Multiple-pattern matching for LZW compressed files
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferred← citeshttps://doi.org/10.1109/synasc57785.2022.00028openalex-snapshot
Empirical evaluation of LZW-Compressed Multiple Pattern Matching Algorithms
inferred← citeshttps://doi.org/10.1109/tc.2005.133openalex-snapshot
Pattern Matching in LZW Compressed Files
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/s0097539702402007openalex-snapshot
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
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.1137/s0097539704445950openalex-snapshot
Word Problems and Membership Problems on Compressed Words
inferred← citeshttps://doi.org/10.1142/s0129054105003728openalex-snapshot
A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0129054111008040openalex-snapshot
THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES
inferred← citeshttps://doi.org/10.1145/1064546.1180611openalex-snapshot
Fast string sorting using order-preserving compression
inferred← citeshttps://doi.org/10.1145/1631272.1631319openalex-snapshot
Manipulating lossless video in the compressed domain
inferred← citeshttps://doi.org/10.1145/1644015.1644018openalex-snapshot
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
inferred← citeshttps://doi.org/10.1145/1921659.1921660openalex-snapshot
Data structures for mergeable trees
inferred← citeshttps://doi.org/10.1145/3026724.3026730openalex-snapshot
Analyzing efficiency of Pseudo-Random Number Generators using Machine Learning
inferred← citeshttps://doi.org/10.1145/3434399openalex-snapshot
Indexing Highly Repetitive String Collections, Part I
inferred← citeshttps://doi.org/10.12694/scpe.v22i4.1870openalex-snapshot
A Method to Improve Exact Matching Results in Compressed Text using Parallel Wavelet Tree
inferred← citeshttps://doi.org/10.14569/ijacsa.2021.0120452openalex-snapshot
Speeding up Natural Language Text Search using Compression
inferred← citeshttps://doi.org/10.1515/gcc-2012-0016openalex-snapshot
Algorithmics on SLP-compressed strings: A survey
inferred← citeshttps://doi.org/10.26021/1658openalex-snapshot
A Comparison of BWT Approaches to Compressed-Domain Pattern Matching
inferred← citeshttps://doi.org/10.3389/fbioe.2015.00012openalex-snapshot
Searching and Indexing Genomic Databases via Kernelization
inferred← citeshttps://doi.org/10.3389/fnhum.2014.00168openalex-snapshot
Assessing randomness and complexity in human motion trajectories through analysis of symbolic sequences
inferred← citeshttps://doi.org/10.48550/arxiv.0801.2378openalex-snapshot
String algorithms and data structures
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2777openalex-snapshot
Fingerprints in Compressed Strings
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0615openalex-snapshot
Orthogonal Range Searching for Text Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1591openalex-snapshot
Searching and Indexing Genomic Databases via Kernelization
inferred← citeshttps://doi.org/10.48550/arxiv.1802.10347openalex-snapshot
Decompressing Lempel-Ziv Compressed Text
inferred← citeshttps://doi.org/10.48550/arxiv.1901.00718openalex-snapshot
Mergeable Dictionaries With Shifts
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02781openalex-snapshot
Indexing Highly Repetitive String Collections
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609085openalex-snapshot
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
inferred← citeshttps://doi.org/10.5555/365411.365458openalex-snapshot
An experimental study of an opportunistic index
inferred← citeshttps://doi.org/10.70675/f3400b94zb51ez486czb3a5z9e3b86a0d2a4openalex-snapshot
A development process for building adaptative software architectures
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.