On the public citation graph
Approximate Boyer–Moore String Matching
0 signed · 93 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/spe.4380100608openalex-snapshot
Practical fast searching in strings
inferredcites →https://doi.org/10.1007/3-540-51542-9_9openalex-snapshot
String searching algorithms revisited
inferredcites →https://doi.org/10.1007/bfb0035772openalex-snapshot
An improved algorithm for approximate string matching
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
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(80)90016-4openalex-snapshot
The theory and computation of evolutionary distances: Pattern recognition
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1016/0885-064x(88)90008-8openalex-snapshot
Data structures and algorithms for approximate string matching
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
inferredcites →https://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/8307.8309openalex-snapshot
Improved string matching with k mismatches
inferredcites →https://doi.org/10.2307/2333889openalex-snapshot
An Introduction to Probability Theory and its Applications, Vol. II.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1002/pmic.201400598openalex-snapshot
Estimating the computational limits of detection of microbial non‐model organisms
inferred← citeshttps://doi.org/10.1002/rsa.10014openalex-snapshot
New and faster filters for multiple approximate string matching
inferred← citeshttps://doi.org/10.1006/jagm.1997.0875openalex-snapshot
Dictionary Look-Up with One Error
inferred← citeshttps://doi.org/10.1007/11496656_8openalex-snapshot
A Fast Algorithm for Approximate String Matching on Gene Sequences
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_18openalex-snapshot
Faster Bit-Parallel Approximate String Matching
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_13openalex-snapshot
A New Indexing Method for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_57openalex-snapshot
Dictionary look-up with small errors
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_153openalex-snapshot
On using q-gram locations in approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_4openalex-snapshot
Filtration with q-samples in approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_69openalex-snapshot
Lempel-Ziv index for q-grams
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_60openalex-snapshot
A filter method for the weighted local similarity search problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-0849-6_24openalex-snapshot
Parallel Broadcasting Scheme for Approximate String Matching with K-Mismatches
inferred← citeshttps://doi.org/10.1007/978-3-319-59767-6_14openalex-snapshot
Information Technology for Botnets Detection Based on Their Behaviour in the Corporate Area Network
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_14openalex-snapshot
On-Line Approximate String Matching with Bounded Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-74272-2_97openalex-snapshot
A Neural Network String Matcher
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_16openalex-snapshot
Tuning Approximate Boyer-Moore for Gene Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_15openalex-snapshot
Approximate String Matching with Reduced Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-642-31912-9_4openalex-snapshot
An Efficient Method for Eliminating Random Delays in Power Traces of Embedded Software
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_17openalex-snapshot
A New Filtration Method and a Hybrid Strategy for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_38openalex-snapshot
Alignment, Comparison and Consensus of Molecular Sequences
inferred← citeshttps://doi.org/10.1007/978-981-10-8476-8_12openalex-snapshot
BWT: An Index Structure to Speed-Up Both Exact and Inexact String Matching
inferred← citeshttps://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferred← citeshttps://doi.org/10.1007/s00453-001-0034-6openalex-snapshot
Improving an Algorithm for Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00453-004-1108-zopenalex-snapshot
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
inferred← citeshttps://doi.org/10.1007/s00453-009-9286-3openalex-snapshot
Approximate Boyer-Moore String Matching for Small Alphabets
inferred← citeshttps://doi.org/10.1007/s41870-019-00371-1openalex-snapshot
BFM: a forward backward string matching algorithm with improved shifting for information retrieval
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00005-wopenalex-snapshot
An improved algorithm for computing the edit distance of run-length coded strings
inferred← citeshttps://doi.org/10.1016/0167-8655(96)00055-4openalex-snapshot
A sublinear algorithm for two-dimensional string matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.07.006openalex-snapshot
Edit distance for a run-length-encoded string and an uncompressed string
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106557openalex-snapshot
String searching with mismatches using AVX2 and AVX-512 instructions
inferred← citeshttps://doi.org/10.1016/j.jda.2007.11.001openalex-snapshot
Fast parameterized matching with q-grams
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.005openalex-snapshot
On-line approximate string matching with bounded errors
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.022openalex-snapshot
A new filtration method and a hybrid strategy for approximate string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.001openalex-snapshot
On the string matching with k mismatches
inferred← citeshttps://doi.org/10.1016/s0141-9331(99)00032-0openalex-snapshot
Efficient parallel hardware algorithms for string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.004openalex-snapshot
Extended string matching
inferred← citeshttps://doi.org/10.1021/ci950222uopenalex-snapshot
Error Detection, Recovery, and Repair in the Translation of Inorganic Nomenclatures. 2. A Proposed Strategy
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1093/comjnl/bxaa193openalex-snapshot
Approximate String Matching with SIMD
inferred← citeshttps://doi.org/10.1093/nar/gkg569openalex-snapshot
PROBEmer: a web-based software tool for selecting optimal DNA oligos
inferred← citeshttps://doi.org/10.1109/aike.2019.00061openalex-snapshot
Assessment of Graduate Students' Resumes Using Short Text Searching Method
inferred← citeshttps://doi.org/10.1109/dsd.2005.66openalex-snapshot
Reconfigurable Parallel Approximate String Matching on FPGAs
inferred← citeshttps://doi.org/10.1109/hicss.1999.772830openalex-snapshot
Parallel string matching algorithms based on dataflow
inferred← citeshttps://doi.org/10.1109/icbats57792.2023.10111342openalex-snapshot
SBM: A Time and Resource Efficient Single Backward Match Exact String Searching Algorithm
inferred← citeshttps://doi.org/10.1109/icde.2017.98openalex-snapshot
BWT Arrays and Mismatching Trees: A New Way for String Matching with k Mismatches
inferred← citeshttps://doi.org/10.1109/icpics52425.2021.9524139openalex-snapshot
Research on the Design of Loan Anti Fraud Cloud Platform Based on Z10 Experimental Platform
inferred← citeshttps://doi.org/10.1109/idaacs.2017.8095052openalex-snapshot
Approach for the unknown metamorphic virus detection
inferred← citeshttps://doi.org/10.1109/iembs.2004.1403799openalex-snapshot
A software system for gene sequence database construction
inferred← citeshttps://doi.org/10.1109/inventive.2016.7830233openalex-snapshot
String matching algorithms for reteriving information from desktop — Comparative analysis
inferred← citeshttps://doi.org/10.1109/tifs.2012.2191964openalex-snapshot
Detecting Software Theft in Embedded Systems: A Side-Channel Approach
inferred← citeshttps://doi.org/10.1111/j.1755-0998.2009.02651.xopenalex-snapshot
Efficient algorithms for the discovery of DNA oligonucleotide barcodes from sequence databases
inferred← citeshttps://doi.org/10.1142/s0129054117500307openalex-snapshot
IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences
inferred← citeshttps://doi.org/10.1145/1005813.1041513openalex-snapshot
Average-optimal single and multiple approximate string matching
inferred← citeshttps://doi.org/10.1145/2660774openalex-snapshot
Scalable Offline Searches in DNA Sequences
inferred← citeshttps://doi.org/10.1145/3129536openalex-snapshot
Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
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/3548606.3560576openalex-snapshot
Escaping the Confines of Time
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.11648/j.ajai.20210501.13openalex-snapshot
Reproducing Musicality: Immediate Human-like Musicality Through Machine Learning and Passing the Turing Test
inferred← citeshttps://doi.org/10.14778/3447689.3447695openalex-snapshot
On the string matching with k differences in DNA databases
inferred← citeshttps://doi.org/10.1504/ijbra.2005.007906openalex-snapshot
A software system for gene sequence database construction based on fast approximate string matching
inferred← citeshttps://doi.org/10.20998/2522-9052.2019.4.13openalex-snapshot
Methods for detecting bot nets in computer systems
inferred← citeshttps://doi.org/10.2478/s11658-006-0016-4openalex-snapshot
In-silico prediction and observations of nuclear matrix attachment
inferred← citeshttps://doi.org/10.26555/ijain.v5i3.362openalex-snapshot
Implementation of hyyrö’s bit-vector algorithm using advanced vector extensions 2
inferred← citeshttps://doi.org/10.30534/ijatcse/2020/11912020openalex-snapshot
Similarity Detection for Hadith of Fiqh of Women using Cosine Similarity and Boyer Moore Method
inferred← citeshttps://doi.org/10.31031/oabb.2018.01.000523openalex-snapshot
String Matching in DNA Databases
inferred← citeshttps://doi.org/10.32657/10356/2470openalex-snapshot
Framework forensic examination computer systems
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-2853/paper46.pdfopenalex-snapshot
Application of Multifactor Analysis for the Purpose of Detecting Malicious Software Implants of the Software in Local Computer Networks
inferred← citeshttps://doi.org/10.70675/c3c14cc5zb13ez4bdbza2cdz863309627394openalex-snapshot
Complexité de la recherche de motifs dans un texte aléatoire
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.