On the public citation graph
A sublinear algorithm for approximate keyword searching
0 signed · 157 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.1006/jmbi.1990.9999openalex-snapshot
Basic Local Alignment Search Tool
inferredcites →https://doi.org/10.1007/bf01840446openalex-snapshot
AnO(ND) difference algorithm and its variations
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/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1093/nar/14.1.501openalex-snapshot
Computer program for the IBM personal computer which searches for approximate matches to short oligonucleotide sequences in long target DNA sequences
inferredcites →https://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferredcites →https://doi.org/10.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/12130.12152openalex-snapshot
Introducing efficient parallelism into approximate string matching and a new serial algorithm
inferredcites →https://doi.org/10.1145/359461.359479openalex-snapshot
Comment on weighted increment linear search for scatter tables
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.1002/(sici)1097-4571(2000)51:1<69::aid-asi10>3.0.co;2-copenalex-snapshot
Block addressing indices for approximate text retrieval
inferred← citeshttps://doi.org/10.1002/9780470892107.ch18openalex-snapshot
Motif Finding Algorithms in Biological Sequences
inferred← citeshttps://doi.org/10.1002/9783527619368.ch2openalex-snapshot
Bioinformatics Support for Genome‐Sequencing Projects
inferred← citeshttps://doi.org/10.1002/humu.20123openalex-snapshot
PolyMAPr: Programs for polymorphism database mining, annotation, and functional analysis
inferred← citeshttps://doi.org/10.1002/rsa.10014openalex-snapshot
New and faster filters for multiple approximate string matching
inferred← citeshttps://doi.org/10.1006/cviu.1999.0764openalex-snapshot
A Distance Measure for Video Sequences
inferred← citeshttps://doi.org/10.1007/11415770_15openalex-snapshot
Efficient q-Gram Filters for Finding All ε-Matches over a Given Length
inferred← citeshttps://doi.org/10.1007/11496656_10openalex-snapshot
An Efficient Algorithm for Generating Super Condensed Neighborhoods
inferred← citeshttps://doi.org/10.1007/11575832_28openalex-snapshot
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-27139-2_16openalex-snapshot
Algorithms in Ambient Intelligence
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_29openalex-snapshot
Indexing Text with Approximate q-Grams
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_36openalex-snapshot
Computing the Threshold for q-Gram Filters
inferred← citeshttps://doi.org/10.1007/3-540-45784-4_11openalex-snapshot
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_20openalex-snapshot
A Metric Index for 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-60044-2_33openalex-snapshot
Fast approximate matching using suffix trees
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_43openalex-snapshot
Suffix cactus: A cross between suffix tree and suffix array
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_1openalex-snapshot
A faster algorithm for approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_27openalex-snapshot
Approximate pattern matching in directed graphs
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_49openalex-snapshot
Estimating the probability of approximate matches
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/3-540-63220-4_62openalex-snapshot
Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_57openalex-snapshot
Multiple approximate string matching
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_188openalex-snapshot
Indexed Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-1-4615-2451-9_10openalex-snapshot
Algorithmic Advances for Searching Biosequence Databases
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_188openalex-snapshot
Indexed Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-16354-3_31openalex-snapshot
MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance
inferred← citeshttps://doi.org/10.1007/978-3-319-78890-6_15openalex-snapshot
ReneGENE-GI: Empowering Precision Genomics with FPGAs on HPCs
inferred← citeshttps://doi.org/10.1007/978-3-319-78890-6_45openalex-snapshot
ReneGENE-Novo: Co-designed Algorithm-Architecture for Accelerated Preprocessing and Assembly of Genomic Short Reads
inferred← citeshttps://doi.org/10.1007/978-3-540-24752-4_25openalex-snapshot
Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_26openalex-snapshot
A Practical Index for Genome Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-72031-7_41openalex-snapshot
An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays
inferred← citeshttps://doi.org/10.1007/978-3-540-73390-4_3openalex-snapshot
Exhaustive Peptide Searching Using Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_24openalex-snapshot
Approximate String Matching with Lempel-Ziv Compressed Indexes
inferred← citeshttps://doi.org/10.1007/978-3-540-75767-2_12openalex-snapshot
Efficiency and Scalability Issues in Metric Access Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_15openalex-snapshot
Indexed Hierarchical Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_188-2openalex-snapshot
Indexed Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-31235-9_18openalex-snapshot
Efficient Similarity Search in Very Large String Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-60893-3_47openalex-snapshot
Aufspüren und Erkennen von Werbung in laufenden Fernsehsendungen
inferred← citeshttps://doi.org/10.1007/bf01188584openalex-snapshot
Multiple filtration and approximate pattern matching
inferred← citeshttps://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferred← citeshttps://doi.org/10.1007/bfb0014158openalex-snapshot
Indexing nucleotide databases for fast query evaluation
inferred← citeshttps://doi.org/10.1007/bfb0016490openalex-snapshot
Video sequence similarity matching
inferred← citeshttps://doi.org/10.1007/bfb0029806openalex-snapshot
A fast filtration algorithm for the substring matching problem
inferred← citeshttps://doi.org/10.1007/bfb0029808openalex-snapshot
Approximate string-matching over suffix trees
inferred← citeshttps://doi.org/10.1007/bfb0030777openalex-snapshot
A fast bit-vector algorithm for approximate string matching based on dynamic programming
inferred← citeshttps://doi.org/10.1007/bfb0037393openalex-snapshot
A unified view to string matching algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054337openalex-snapshot
Spelling approximate repeated or common motifs using a suffix tree
inferred← citeshttps://doi.org/10.1007/pl00009253openalex-snapshot
Faster Approximate String 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/s00778-019-00595-4openalex-snapshot
Efficient query autocompletion with edit distance-based error tolerance
inferred← citeshttps://doi.org/10.1007/s10877-005-0677-yopenalex-snapshot
High-Performance Exact Algorithms For Motif Search
inferred← citeshttps://doi.org/10.1007/s11265-019-01452-xopenalex-snapshot
Towards Accelerated Genome Informatics on Parallel HPC Platforms: The ReneGENE-GI Perspective
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.12.001openalex-snapshot
Data mining algorithm for pre-processing biopharmaceutical drug product manufacturing records
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.08.001openalex-snapshot
A new method for approximate indexing and dictionary lookup with one error
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.003openalex-snapshot
Indexing text with approximate q-grams
inferred← citeshttps://doi.org/10.1016/j.jda.2006.10.005openalex-snapshot
Efficient generation of super condensed neighborhoods
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.037openalex-snapshot
A metric index for approximate string matching
inferred← citeshttps://doi.org/10.1016/s0065-2458(04)63006-3openalex-snapshot
Search and Retrieval of 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.1038/nmeth.2221openalex-snapshot
The GEM mapper: fast, accurate and versatile alignment by filtration
inferred← citeshttps://doi.org/10.1089/106652703321825919openalex-snapshot
A Table-Driven, Full-Sensitivity Similarity Search Algorithm
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.296openalex-snapshot
Efficient q -Gram Filters for Finding All ε -Matches over a Given Length
inferred← citeshttps://doi.org/10.1093/bib/bbx067openalex-snapshot
Alignment-free inference of hierarchical and reticulate phylogenomic relationships
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s5openalex-snapshot
An efficient algorithm for finding short approximate non-tandem repeats
inferred← citeshttps://doi.org/10.1093/bioinformatics/18.6.873openalex-snapshot
SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size
inferred← citeshttps://doi.org/10.1093/bioinformatics/bth065openalex-snapshot
A metric model of amino acid substitution
inferred← citeshttps://doi.org/10.1093/bioinformatics/bti076openalex-snapshot
Fast and accurate database homology search using upper bounds of local alignment scores
inferred← citeshttps://doi.org/10.1109/adl.1996.502518openalex-snapshot
Robust retrieval of noisy text
inferred← citeshttps://doi.org/10.1109/bibe.2003.1188976openalex-snapshot
An assessment of a metric space database index to support sequence homology
inferred← citeshttps://doi.org/10.1109/bibe.2004.1317381openalex-snapshot
Constraint based method for finding motifs in DNA sequences
inferred← citeshttps://doi.org/10.1109/bibe.2005.13openalex-snapshot
Approximate Global Alignment of Sequences
inferred← citeshttps://doi.org/10.1109/bibe.2006.253312openalex-snapshot
On Integrating Peptide Sequence Analysis and Relational Distance-Based Indexing
inferred← citeshttps://doi.org/10.1109/bibe.2019.00052openalex-snapshot
Heuristics for the Specific Substring Problem with Hamming Distance
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840596openalex-snapshot
PSH: A probabilistic signature hash method with hash neighborhood candidate generation for fast edit-distance string comparison on big data
inferred← citeshttps://doi.org/10.1109/ccnc.2009.4785013openalex-snapshot
Mobile P2P Fast Similarity Search
inferred← citeshttps://doi.org/10.1109/csb.2002.1039343openalex-snapshot
Accelerating approximate subsequence search on large protein sequence databases
inferred← citeshttps://doi.org/10.1109/csb.2005.42openalex-snapshot
On optimizing distance-based similarity search for biological databases
inferred← citeshttps://doi.org/10.1109/dasfaa.2003.1192395openalex-snapshot
Approximate string matching in DNA sequences
inferred← citeshttps://doi.org/10.1109/iacc.2016.80openalex-snapshot
Identification of Recurring Patterns of Code to Detect Structural Clones
inferred← citeshttps://doi.org/10.1109/icdim.2007.369229openalex-snapshot
Approximate Keyword Search in Web Search Engines
inferred← citeshttps://doi.org/10.1109/icinfa.2006.374137openalex-snapshot
Searching Genomic Databases using the Prime Factor Filter
inferred← citeshttps://doi.org/10.1109/mmcs.1997.609763openalex-snapshot
On the detection and recognition of television commercials
inferred← citeshttps://doi.org/10.1109/spire.2001.989742openalex-snapshot
On using two-phase filtering in indexed approximate string matching with application to searching unique oligonucleotides
inferred← citeshttps://doi.org/10.1109/ssdbm.2004.20openalex-snapshot
BASS: approximate search on large string databases
inferred← citeshttps://doi.org/10.1109/ssdm.2003.1214987openalex-snapshot
MoBIoS: a metric-space DBMS to support biological discovery
inferred← citeshttps://doi.org/10.1109/ssdm.2004.1311210openalex-snapshot
BASS: approximate search on large string databases
inferred← citeshttps://doi.org/10.1109/tcbb.2016.2586070openalex-snapshot
A Survey of Software and Hardware Approaches to Performing Read Alignment in Next Generation Sequencing
inferred← citeshttps://doi.org/10.1109/tcbbio.2025.3620157openalex-snapshot
On the Size of the Neighborhoods of a Word
inferred← citeshttps://doi.org/10.1109/wcre.2011.22openalex-snapshot
Approximate Code Search in Program Histories
inferred← citeshttps://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferred← citeshttps://doi.org/10.1137/1.9781611972870.8openalex-snapshot
Faster Filters for Approximate String Matching
inferred← citeshttps://doi.org/10.1142/9781860947322_0024openalex-snapshot
EXACT ALGORITHMS FOR MOTIF SEARCH
inferred← citeshttps://doi.org/10.1142/s0218213005002430openalex-snapshot
AN ASSESSMENT OF A METRIC SPACE DATABASE INDEX TO SUPPORT SEQUENCE HOMOLOGY
inferred← citeshttps://doi.org/10.1145/1559845.1559925openalex-snapshot
Efficient approximate entity extraction with edit distance constraints
inferred← citeshttps://doi.org/10.1145/1963190.1963191openalex-snapshot
Indexing methods for approximate dictionary searching
inferred← citeshttps://doi.org/10.1145/1966865.1966873openalex-snapshot
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
inferred← citeshttps://doi.org/10.1145/2457465.2457470openalex-snapshot
Efficient fuzzy search in large text collections
inferred← citeshttps://doi.org/10.1145/2660774openalex-snapshot
Scalable Offline Searches in DNA Sequences
inferred← citeshttps://doi.org/10.1145/299432.299460openalex-snapshot
q -gram based database searching using a suffix array (QUASAR)
inferred← citeshttps://doi.org/10.1145/316542.316550openalex-snapshot
A fast bit-vector algorithm for approximate string matching based on dynamic programming
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.1145/780542.780590openalex-snapshot
A sublinear algorithm for weakly approximating edit distance
inferred← citeshttps://doi.org/10.1162/0891201042544938openalex-snapshot
Fast Approximate Search in Large Dictionaries
inferred← citeshttps://doi.org/10.1360/jos170232openalex-snapshot
A Sequence Similarity Query Processing Technique Based on Two-Partitioning Frequency Transformation
inferred← citeshttps://doi.org/10.14778/2536336.2536339openalex-snapshot
Efficient error-tolerant query autocompletion
inferred← citeshttps://doi.org/10.14778/3447689.3447695openalex-snapshot
On the string matching with k differences in DNA databases
inferred← citeshttps://doi.org/10.1534/genetics.105.048074openalex-snapshot
The Power of Single-Nucleotide Polymorphisms for Large-Scale Parentage Inference
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.17169/refubium-15562openalex-snapshot
Approximate string matching for high-throughput sequencing
inferred← citeshttps://doi.org/10.17169/refubium-18167openalex-snapshot
Contributions to computing and modeling multiple whole-genome alignments
inferred← citeshttps://doi.org/10.17169/refubium-8621openalex-snapshot
Next-generation sequencing algorithms
inferred← citeshttps://doi.org/10.17877/de290r-15730openalex-snapshot
Über die Vermeidung redundanter Betrachtungen beim Approximate String Matching
inferred← citeshttps://doi.org/10.2174/157489361002150518125716openalex-snapshot
Efficient and Error-Tolerant Sequencing Read Mapping
inferred← citeshttps://doi.org/10.2478/ijcss-2018-0005openalex-snapshot
Mining Automatically Estimated Poses from Video Recordings of Top Athletes
inferred← citeshttps://doi.org/10.25439/rmt.27586443openalex-snapshot
Efficient homology search for genomic sequence databases
inferred← citeshttps://doi.org/10.31577/cai_2019_2_367openalex-snapshot
Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations
inferred← citeshttps://doi.org/10.31979/etd.fmj6-8gzvopenalex-snapshot
DNA Fragment Assembly Algorithms: Toward a Solution for Long Repeats
inferred← citeshttps://doi.org/10.3390/a2031105openalex-snapshot
Approximate String Matching with Compressed Indexes
inferred← citeshttps://doi.org/10.4018/978-1-4666-1785-8.ch002openalex-snapshot
Mapping Affymetrix Microarray Probes to the Rat Genome via a Persistent Index
inferred← citeshttps://doi.org/10.4018/jkdb.2010100204openalex-snapshot
Mapping Affymetrix Microarray Probes to the Rat Genome via a Persistent Index
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0722openalex-snapshot
Good parts first - a new algorithm for approximate search in lexica and string databases
inferred← citeshttps://doi.org/10.48550/arxiv.1701.06134openalex-snapshot
On Practical Accuracy of Edit Distance Approximation Algorithms
inferred← citeshttps://doi.org/10.5353/th_b2935059openalex-snapshot
Approximate string matching in DNA sequences
inferred← citeshttps://doi.org/10.5753/isys.2018.373openalex-snapshot
Um sistema para auxiliar na seleção de regiões específicas de sequências biológicas
inferred← citeshttps://doi.org/10.5821/dissertation-2117-113295openalex-snapshot
Efficient approximate string matching techniques for sequence alignment
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.