On the public citation graph
A bit-parallel approach to suffix automata: Fast extended string matching
0 signed · 121 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.1002/(sici)1097-024x(199612)26:12<1439::aid-spe71>3.0.co;2-1openalex-snapshot
A Comparison of Approximate String Matching Algorithms
inferredcites →https://doi.org/10.1002/spe.4380100608openalex-snapshot
Practical fast searching in strings
inferredcites →https://doi.org/10.1007/3-540-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
inferredcites →https://doi.org/10.1007/3-540-56024-6_15openalex-snapshot
Fast and practical approximate string matching
inferredcites →https://doi.org/10.1007/3-540-61258-0_1openalex-snapshot
A faster algorithm for approximate string matching
inferredcites →https://doi.org/10.1007/bf01185427openalex-snapshot
Speeding up two string-matching algorithms
inferredcites →https://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferredcites →https://doi.org/10.1007/bfb0030778openalex-snapshot
A bit-parallel approach to suffix automata: Fast extended string matching
inferredcites →https://doi.org/10.1016/0166-218x(92)90270-kopenalex-snapshot
Average sizes of suffix trees and DAWGs
inferredcites →https://doi.org/10.1016/0304-3975(86)90041-1openalex-snapshot
Transducers and repetitions
inferredcites →https://doi.org/10.1016/s0020-0190(99)00092-7openalex-snapshot
Fast practical multi-pattern matching
inferredcites →https://doi.org/10.1016/s0166-218x(99)00047-5openalex-snapshot
Asymptotic estimation of the average number of terminal states in DAWGs
inferredcites →https://doi.org/10.1137/0208029openalex-snapshot
The Complexity of Pattern Matching for a Random String
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/79173.79184openalex-snapshot
A very fast substring search algorithm
inferredcites →https://doi.org/10.1515/9780773591400-011openalex-snapshot
A Partial Deterministic Automaton for Approximate String Matching
inferredcites →https://doi.org/10.1515/9780773591400-013openalex-snapshot
Asymptotic estimation of the average number of terminal states in DAWGs
inferredcites →https://doi.org/10.1515/9780773591400-014openalex-snapshot
On the multi backward dawg matching algorithm (MultiBDM)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470892107.ch3openalex-snapshot
Finite Automata in Pattern Matching
inferred← citeshttps://doi.org/10.1002/rsa.10014openalex-snapshot
New and faster filters for multiple approximate string matching
inferred← citeshttps://doi.org/10.1002/spe.411openalex-snapshot
NR‐grep: a fast and flexible pattern‐matching tool
inferred← citeshttps://doi.org/10.1007/11496656_25openalex-snapshot
A Simple Fast Hybrid Pattern-Matching Algorithm
inferred← citeshttps://doi.org/10.1007/11921240_16openalex-snapshot
A New Approach to Determinisation Using Bit-Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_5openalex-snapshot
Faster String Matching with Super-Alphabets
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_17openalex-snapshot
Fast Regular Expression Search
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_2openalex-snapshot
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
inferred← citeshttps://doi.org/10.1007/978-3-030-12072-6_6openalex-snapshot
String Matching in Case of Periodicity in the Pattern
inferred← citeshttps://doi.org/10.1007/978-3-030-79121-6_14openalex-snapshot
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton
inferred← citeshttps://doi.org/10.1007/978-3-030-85088-3_8openalex-snapshot
The Range Automaton: An Efficient Approach to Text-Searching
inferred← citeshttps://doi.org/10.1007/978-3-319-38827-4_12openalex-snapshot
Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_6openalex-snapshot
A Very Fast String Matching Algorithm Based on Condensed Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-319-99277-8_9openalex-snapshot
Collecting Network Evidence Using Constrained Approximate Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_7openalex-snapshot
Alternative Algorithms for Bit-Parallel String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_10openalex-snapshot
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_24openalex-snapshot
A New Algorithm for Efficient Pattern Matching with Swaps
inferred← citeshttps://doi.org/10.1007/978-3-642-13122-6_18openalex-snapshot
Bit-(Parallelism)2: Getting to the Next Level of Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_26openalex-snapshot
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_10openalex-snapshot
Worst Case Efficient Single and Multiple String Matching in the RAM Model
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_16openalex-snapshot
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_7openalex-snapshot
Constant-Time Word-Size String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_13openalex-snapshot
A Fast Suffix Automata Based Algorithm for Exact Online String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_23openalex-snapshot
Fast Multiple String Matching Using Streaming SIMD Extensions Technology
inferred← citeshttps://doi.org/10.1007/978-981-16-9885-9_33openalex-snapshot
Efficient Structural Matching for RNA Secondary Structure Using Bit-Parallelism
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/s11042-019-07822-8openalex-snapshot
XWM: a high-speed matching algorithm for large-scale URL rules in wireless surveillance applications
inferred← citeshttps://doi.org/10.1007/s11227-024-06115-8openalex-snapshot
Pattern matching algorithms in blockchain for network fees reduction
inferred← citeshttps://doi.org/10.1007/s11227-025-07165-2openalex-snapshot
Boosting exact pattern matching with extreme gradient boosting (and more)
inferred← citeshttps://doi.org/10.1007/s11390-014-1464-3openalex-snapshot
Pattern Matching with Flexible Wildcards
inferred← citeshttps://doi.org/10.1007/s42979-022-01052-wopenalex-snapshot
Fast Exact Pattern Matching by the Means of a Character Bit Representation
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.comcom.2004.06.005openalex-snapshot
A fast string search algorithm for deep packet classification
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.006openalex-snapshot
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.020openalex-snapshot
A general compression algorithm that supports fast searching
inferred← citeshttps://doi.org/10.1016/j.jda.2006.10.003openalex-snapshot
Fast pattern-matching on indeterminate strings
inferred← citeshttps://doi.org/10.1016/j.jda.2006.11.004openalex-snapshot
A simple fast hybrid pattern-matching algorithm
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.011openalex-snapshot
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
inferred← citeshttps://doi.org/10.1016/j.jda.2014.07.003openalex-snapshot
Fast and flexible packed string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.019openalex-snapshot
Accelerating Boyer–Moore searches on binary texts
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.007openalex-snapshot
Special factors and the combinatorics of suffix and factor automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.013openalex-snapshot
Towards optimal packed string matching
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00121-0openalex-snapshot
Very fast and simple approximate string matching
inferred← citeshttps://doi.org/10.1016/s0020-0255(02)00303-1openalex-snapshot
Regular biosequence pattern matching with cellular automata
inferred← citeshttps://doi.org/10.1016/s0065-2458(03)57004-8openalex-snapshot
Adding Compression to Next-Generation Text Retrieval Systems
inferred← citeshttps://doi.org/10.1038/s41467-019-12493-yopenalex-snapshot
Longshot enables accurate variant calling in diploid genomes from single-molecule long read sequencing
inferred← citeshttps://doi.org/10.1080/00207160108805036openalex-snapshot
On-line string matching algorithms: survey and experimental results
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1088/1742-6596/1854/1/012042openalex-snapshot
Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review
inferred← citeshttps://doi.org/10.1093/bioinformatics/btv573openalex-snapshot
Rust-Bio: a fast and safe bioinformatics library
inferred← citeshttps://doi.org/10.1093/nar/gki368openalex-snapshot
PatMatch: a program for finding patterns in peptide and nucleotide sequences
inferred← citeshttps://doi.org/10.1109/access.2019.2914071openalex-snapshot
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
inferred← citeshttps://doi.org/10.1109/access.2020.2984503openalex-snapshot
A Novel Web Scraping Approach Using the Additional Information Obtained From Web Pages
inferred← citeshttps://doi.org/10.1109/access.2024.3355319openalex-snapshot
Exploring a Self-Replication Algorithm to Flexibly Match Patterns
inferred← citeshttps://doi.org/10.1109/clei60451.2023.10346194openalex-snapshot
Tuning SBNDM2 Algorithm For Exact Pattern Matching
inferred← citeshttps://doi.org/10.1109/cmcsn.2012.56openalex-snapshot
Deep Packet Inspection with Bit-Reduced DFA for Cloud System
inferred← citeshttps://doi.org/10.1109/comst.2006.315851openalex-snapshot
Profiling and accelerating string matching algorithms in three network content security applications
inferred← citeshttps://doi.org/10.1109/eit.2007.4374455openalex-snapshot
A comparison of the performance of four exact string matching algorithms
inferred← citeshttps://doi.org/10.1109/iacs.2018.8355441openalex-snapshot
A fast improved multiple pattern matching algorithm
inferred← citeshttps://doi.org/10.1109/icisa.2011.5772430openalex-snapshot
Software Based Implementation Methodologies for Deep Packet Inspection
inferred← citeshttps://doi.org/10.1109/mascot.2001.948881openalex-snapshot
A bit-parallel search algorithm for allocating free space
inferred← citeshttps://doi.org/10.1109/spire.2001.989737openalex-snapshot
Speeding-up hirschberg and hunt-szymanski LCS algorithms
inferred← citeshttps://doi.org/10.1109/tla.2005.1468671openalex-snapshot
Text Retrieval in the Galician Digital Library
inferred← citeshttps://doi.org/10.1137/1.9781611972931.10openalex-snapshot
Fast Packed String Matching for Short Patterns
inferred← citeshttps://doi.org/10.1142/s0129054106004388openalex-snapshot
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
inferred← citeshttps://doi.org/10.1142/s0129054109006991openalex-snapshot
EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
inferred← citeshttps://doi.org/10.1142/s0129054109007005openalex-snapshot
AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
inferred← citeshttps://doi.org/10.1145/1178657.1178671openalex-snapshot
Clustering and indexing of experience sequences for popularity-driven recommendations
inferred← citeshttps://doi.org/10.1145/2431211.2431212openalex-snapshot
The exact online string matching problem
inferred← citeshttps://doi.org/10.1145/2628071.2628079openalex-snapshot
Bitwise data parallelism in regular expression matching
inferred← citeshttps://doi.org/10.1145/2663358openalex-snapshot
Pattern Matching Techniques for Replacing Missing Sections of Audio Streamed across Wireless Networks
inferred← citeshttps://doi.org/10.1145/3301295openalex-snapshot
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
inferred← citeshttps://doi.org/10.1145/3373376.3378461openalex-snapshot
Challenging Sequential Bitstream Processing via Principled Bitwise Speculation
inferred← citeshttps://doi.org/10.1145/351827.384246openalex-snapshot
Fast and flexible string matching by combining bit-parallelism and suffix automata
inferred← citeshttps://doi.org/10.1145/369133.369220openalex-snapshot
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching
inferred← citeshttps://doi.org/10.12681/eadd/29868openalex-snapshot
Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms
inferred← citeshttps://doi.org/10.12694/scpe.v16i2.1085openalex-snapshot
Multiple String Matching on a GPU using CUDAs
inferred← citeshttps://doi.org/10.1504/ijbra.2009.027510openalex-snapshot
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
inferred← citeshttps://doi.org/10.15407/pp2022.02.057openalex-snapshot
60 Years of Databases (part four)
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.1893openalex-snapshot
A New Substring Searching Algorithm
inferred← citeshttps://doi.org/10.1631/fitee.2400091openalex-snapshot
CUSMART: effective parallelization of string matching algorithms using GPGPU accelerators
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3973392/v1openalex-snapshot
Exploring Mathematical Models and Algorithms for Plagiarism Detection in Text Documents: A Proof of Concept
inferred← citeshttps://doi.org/10.2298/csis111220024topenalex-snapshot
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata
inferred← citeshttps://doi.org/10.3233/fun-2006-72402openalex-snapshot
On-line Approximate String Matching in Natural Language
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00138openalex-snapshot
Representing Pattern Matching Algorithms by Polynomial-Size Automata
inferred← citeshttps://doi.org/10.5120/11720-7392openalex-snapshot
An Enhanced Version of Pattern Matching Algorithm using Bitwise XOR Operation
inferred← citeshttps://doi.org/10.5120/13006-0312openalex-snapshot
Approximate Multiple Pattern String Matching using Bit Parallelism: A Review
inferred← citeshttps://doi.org/10.5120/13320-0451openalex-snapshot
Improved Approximate Multiple Pattern String Matching using Consecutive Q Grams of Pattern
inferred← citeshttps://doi.org/10.5120/13986-1996openalex-snapshot
Improved Approximate Multiple-Pattern String Matching using Consecutive N-Grams
inferred← citeshttps://doi.org/10.5120/8270-1832openalex-snapshot
Artificial Neural Network based String Matching Algorithms for Species Classification A Preliminary Study and Experimental Results
inferred← citeshttps://doi.org/10.5120/9926-4552openalex-snapshot
Spam Filtering through Multiple Pattern Bit Parallel String Matching Combining Shift AND & OR
inferred← citeshttps://doi.org/10.5281/zenodo.1415907openalex-snapshot
Semex - An Efficient Music Retrieval Prototype.
inferred← citeshttps://doi.org/10.5772/18488openalex-snapshot
Parallel Processing of Multiple Pattern Matching Algorithms for Biological Sequences: Methods and Performance Results
inferred← citeshttps://doi.org/10.70675/c3c14cc5zb13ez4bdbza2cdz863309627394openalex-snapshot
Complexité de la recherche de motifs dans un texte aléatoire
inferred← citeshttps://doi.org/10.7763/ijcte.2012.v4.462openalex-snapshot
Quick-Skip Search Hybrid Algorithm for the Exact String Matching Problem
showing the first 98 of 99 · page through all 99
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.