On the public citation graph

LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text

https://doi.org/10.1002/spe.663
0 signed · 77 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(199707)27:7<851::aid-spe108>3.0.co;2-dopenalex-snapshot
String Matching in the DNA Alphabet
inferredcites →https://doi.org/10.1002/spe.4380100608openalex-snapshot
Practical fast searching in strings
inferredcites →https://doi.org/10.1002/spe.4380190207openalex-snapshot
Word‐based text compression
inferredcites →https://doi.org/10.1006/jcss.1996.0023openalex-snapshot
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files
inferredcites →https://doi.org/10.1007/3-540-09510-1_10openalex-snapshot
A string matching algorithm fast on the average
inferredcites →https://doi.org/10.1007/3-540-44888-8_16openalex-snapshot
Tuning String Matching for Huge Pattern Sets
inferredcites →https://doi.org/10.1007/3-540-45123-4_16openalex-snapshot
Boyer—Moore String Matching over Ziv-Lempel Compressed Text
inferredcites →https://doi.org/10.1007/3-540-45123-4_17openalex-snapshot
A Boyer—Moore Type Algorithm for Compressed Pattern Matching
inferredcites →https://doi.org/10.1007/3-540-48194-x_1openalex-snapshot
Regular Expression Searching over Ziv-Lempel Compressed Text
inferredcites →https://doi.org/10.1007/3-540-48194-x_5openalex-snapshot
Efficient Experimental String Matching by Weak Factor Recognition*
inferredcites →https://doi.org/10.1007/3-540-48452-3_1openalex-snapshot
Shift-And Approach to Pattern Matching in LZW Compressed Text
inferredcites →https://doi.org/10.1007/3-540-48452-3_2openalex-snapshot
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
inferredcites →https://doi.org/10.1007/3-540-61422-2_148openalex-snapshot
Efficient algorithms for Lempel-Ziv encoding
inferredcites →https://doi.org/10.1007/3-540-61680-2_68openalex-snapshot
A new regular grammar pattern matching algorithm
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_9openalex-snapshot
Variations on a theme by Ziv and Lempel
inferredcites →https://doi.org/10.1007/bf01185427openalex-snapshot
Speeding up two string-matching algorithms
inferredcites →https://doi.org/10.1007/pl00009202openalex-snapshot
String Matching in Lempel—Ziv Compressed Strings
inferredcites →https://doi.org/10.1016/j.jda.2003.12.002openalex-snapshot
Practical and flexible pattern matching over Ziv–Lempel compressed text
inferredcites →https://doi.org/10.1016/s1570-8667(03)00032-7openalex-snapshot
Approximate string matching on Ziv–Lempel compressed text
inferredcites →https://doi.org/10.1016/s1570-8667(03)00036-4openalex-snapshot
Regular expression searching on compressed text
inferredcites →https://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferredcites →https://doi.org/10.1023/a:1009934302807openalex-snapshot
Adding Compression to Block Addressing Inverted Indexes
inferredcites →https://doi.org/10.1109/dcc.1992.227453openalex-snapshot
Efficient two-dimensional compressed matching
inferredcites →https://doi.org/10.1109/dcc.1998.672136openalex-snapshot
Multiple pattern matching in LZW compressed text
inferredcites →https://doi.org/10.1109/dcc.2000.838180openalex-snapshot
A new compression method for compressed matching
inferredcites →https://doi.org/10.1109/dcc.2001.917176openalex-snapshot
Pattern matching in Huffman encoded texts
inferredcites →https://doi.org/10.1109/dcc.2001.917177openalex-snapshot
Faster approximate string matching over compressed text
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/mc.1984.1659158openalex-snapshot
A Technique for High-Performance Data Compression
inferredcites →https://doi.org/10.1109/spire.1999.796582openalex-snapshot
A unifying framework for compressed pattern matching
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/248625.248639openalex-snapshot
A text compression scheme that allows fast searching directly in the compressed file
inferredcites →https://doi.org/10.1145/348751.348754openalex-snapshot
Fast and flexible word searching on compressed text
inferredcites →https://doi.org/10.1145/351827.384246openalex-snapshot
Fast and flexible string matching by combining bit-parallelism and suffix automata
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching
inferredcites →https://doi.org/10.1145/63334.63341openalex-snapshot
Data compression with finite windows
inferredcites →https://doi.org/10.1145/79173.79184openalex-snapshot
A very fast substring search algorithm
inferredcites →https://doi.org/10.5860/choice.32-5696openalex-snapshot
Text algorithms

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.882openalex-snapshot
New adaptive compressors for natural language text
inferred← citeshttps://doi.org/10.1002/spe.v38:13openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_108openalex-snapshot
Dictionary-Based Data Compression
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_81openalex-snapshot
Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_108openalex-snapshot
Dictionary-Based Data Compression
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_634openalex-snapshot
Lempel-Ziv Compression
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_81openalex-snapshot
Pattern Matching on Compressed Text
inferred← citeshttps://doi.org/10.1007/978-3-540-71661-7_14openalex-snapshot
Cumulative Algebraic Signatures for Fast String Search, Protection Against Incidental Viewing and Corruption of Data in an SDDS
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_25openalex-snapshot
Fast Matching Method for DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_634-1openalex-snapshot
Lempel-Ziv Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_81-2openalex-snapshot
Pattern Matching on Compressed Text
inferred← citeshttps://doi.org/10.1007/978-981-10-3156-4_71openalex-snapshot
Performance of Multiple String Matching Algorithms in Text Mining
inferred← citeshttps://doi.org/10.1007/s00453-020-00732-4openalex-snapshot
Efficient Online String Matching Based on Characters Distance Text Sampling
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/s10791-006-9001-9openalex-snapshot
Lightweight natural language text compression
inferred← citeshttps://doi.org/10.1007/s13369-018-3378-9openalex-snapshot
Multi-Stream Word-Based Compression Algorithm for Compressed Text Search
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.03.026openalex-snapshot
EPMA: Efficient pattern matching algorithm for DNA sequences
inferred← citeshttps://doi.org/10.1016/j.future.2025.108169openalex-snapshot
Distributed compressive genomics: Fundamental pattern matching primitives via spark
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.1093/comjnl/bxag075openalex-snapshot
Monotonic run length text sampling and fake sampled positions
inferred← citeshttps://doi.org/10.1093/comjnl/bxr096openalex-snapshot
Boosting Text Compression with Word-Based Statistical Encoding
inferred← citeshttps://doi.org/10.1109/bibe.2007.4375618openalex-snapshot
Methodology for Evaluating DNA Pattern Searching Algorithms on Multiprocessor
inferred← citeshttps://doi.org/10.1109/pci.2011.41openalex-snapshot
A Performance Evaluation of the Preprocessing Phase of Multiple Keyword Matching Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2014.2357051openalex-snapshot
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
inferred← citeshttps://doi.org/10.1145/1412228.1455268openalex-snapshot
Compressed text indexes
inferred← citeshttps://doi.org/10.1145/1631272.1631319openalex-snapshot
Manipulating lossless video in the compressed domain
inferred← citeshttps://doi.org/10.1145/1777432.1777433openalex-snapshot
Dynamic lightweight text compression
inferred← citeshttps://doi.org/10.1145/3481638openalex-snapshot
Engineering Practical Lempel-Ziv Tries
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4747701/v1openalex-snapshot
Distributed Compressive Genomics: Fundamental Pattern Matching Primitives via Spark
inferred← citeshttps://doi.org/10.3390/info11050248openalex-snapshot
Research on Uyghur Pattern Matching Based on Syllable Features
inferred← citeshttps://doi.org/10.3906/elk-1407-178openalex-snapshot
A new compression algorithm for fast text search
inferred← citeshttps://doi.org/10.3906/elk-1601-92openalex-snapshot
A new word-based compression model allowing compressed pattern matching
inferred← citeshttps://doi.org/10.48550/arxiv.1402.1194openalex-snapshot
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08828openalex-snapshot
On the Use of Quasiorders in Formal Language Theory
inferred← citeshttps://doi.org/10.54209/infosains.v13i03.3505openalex-snapshot
Efficiency Analysis of Compression Software (WINRAR and 7-Zip) Across Diverse Data Types on Windows 11 and Ubuntu 23.10
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.