On the public citation graph
A fast bit-vector algorithm for approximate string matching based on dynamic programming
0 signed · 81 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-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
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/bf01185431openalex-snapshot
Sublinear approximate string matching and biological applications
inferredcites →https://doi.org/10.1007/bf01185432openalex-snapshot
A sublinear algorithm for approximate keyword searching
inferredcites →https://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferredcites →https://doi.org/10.1016/0022-0000(80)90002-1openalex-snapshot
A faster algorithm computing string edit distances
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.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527619368.ch2openalex-snapshot
Bioinformatics Support for Genome‐Sequencing Projects
inferred← citeshttps://doi.org/10.1002/rsa.10014openalex-snapshot
New and faster filters for multiple approximate string matching
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-45123-4_18openalex-snapshot
Approximate String Matching over Ziv—Lempel Compressed Text
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/978-1-4939-3167-5_17openalex-snapshot
Finding and Characterizing Repeats in Plant Genomes
inferred← citeshttps://doi.org/10.1007/978-3-031-07802-6_36openalex-snapshot
Approximate Pattern Matching Using Search Schemes and In-Text Verification
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.1016/j.jda.2006.10.005openalex-snapshot
Efficient generation of super condensed neighborhoods
inferred← citeshttps://doi.org/10.1016/j.jtbi.2007.05.036openalex-snapshot
Randomized probe selection algorithm for microarray design
inferred← citeshttps://doi.org/10.1016/j.ygeno.2011.05.009openalex-snapshot
Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00333-3openalex-snapshot
Improved approximate pattern matching on hypertext
inferred← citeshttps://doi.org/10.1016/s0580-9517(04)34011-0openalex-snapshot
Design and Use of Functional Gene Microarrays (FGAs) for the Characterization of Microbial Communities
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/s41467-021-26865-wopenalex-snapshot
Fast alignment and preprocessing of chromatin profiles with Chromap
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.11.1067openalex-snapshot
Selection of optimal DNA oligos for gene expression arrays
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaf652openalex-snapshot
Columba: fast approximate pattern matching with optimized search schemes
inferred← citeshttps://doi.org/10.1093/bioinformatics/btv670openalex-snapshot
Optimal seed solver: optimizing seed selection in read mapping
inferred← citeshttps://doi.org/10.1093/bioinformatics/bty927openalex-snapshot
Whisper: read sorting allows robust mapping of DNA sequencing data
inferred← citeshttps://doi.org/10.1093/nar/gki914openalex-snapshot
Selection of optimal oligonucleotide probes for microarrays using multiple criteria, global alignment and parameter estimation
inferred← citeshttps://doi.org/10.1093/oxfordjournals.molbev.a004052openalex-snapshot
Genome-wide Analysis of the Emigrant Family of MITEs of Arabidopsis thaliana
inferred← citeshttps://doi.org/10.1109/bibe.2000.889608openalex-snapshot
Selecting optimum DNA oligos for microarrays
inferred← citeshttps://doi.org/10.1109/cibcb.2006.331018openalex-snapshot
Efficient Probe Selection in Microarray Design
inferred← citeshttps://doi.org/10.1109/csb.2003.1227305openalex-snapshot
Fast and accurate probe selection algorithm for large genomes
inferred← citeshttps://doi.org/10.1109/dcc.2001.917177openalex-snapshot
Faster approximate string matching over compressed text
inferred← citeshttps://doi.org/10.1109/iccd53106.2021.00062openalex-snapshot
CIDAN: Computing in DRAM with Artificial Neurons
inferred← citeshttps://doi.org/10.1109/lics.2000.855764openalex-snapshot
Approximate pattern matching is expressible in transitive closure logic
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.989742openalex-snapshot
On using two-phase filtering in indexed approximate string matching with application to searching unique oligonucleotides
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2465900openalex-snapshot
AMAS: Optimizing the Partition and Filtration of Adaptive Seeds to Speed up Read Mapping
inferred← citeshttps://doi.org/10.1142/9789814317368_0005openalex-snapshot
Approximate String Matching
inferred← citeshttps://doi.org/10.1145/3695053.3731030openalex-snapshot
PuDHammer: Experimental Analysis of Read Disturbance Effects of Processing-using-DRAM in Real DRAM Chips
inferred← citeshttps://doi.org/10.1145/3696443.3708963openalex-snapshot
Vectron: A Dynamic Programming Auto-vectorization Framework
inferred← citeshttps://doi.org/10.1145/502585.502646openalex-snapshot
Improved string matching under noisy channel conditions
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-19102009-002745openalex-snapshot
Filtros para a busca e extração de padrões aproximados em cadeias biológicas
inferred← citeshttps://doi.org/10.1186/s12859-019-3160-3openalex-snapshot
Sensitive detection of circular DNAs at single-nucleotide resolution using guided realignment of partially aligned reads
inferred← citeshttps://doi.org/10.1186/s12859-020-03590-7openalex-snapshot
SPAligner: alignment of long diverged molecular sequences to assembly graphs
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1000502openalex-snapshot
Fast Mapping of Short Sequences with Mismatches, Insertions and Deletions Using Index Structures
inferred← citeshttps://doi.org/10.1371/journal.pone.0179073openalex-snapshot
Optimized double-digest genotyping by sequencing (ddGBS) method with high-density SNP markers and high genotyping accuracy for chickens
inferred← citeshttps://doi.org/10.18489/sacj.v53i0.195openalex-snapshot
Identifying attributes of GPU programs for difficulty evaluation
inferred← citeshttps://doi.org/10.18653/v1/2023.emnlp-main.308openalex-snapshot
Stop Uploading Test Data in Plain Text: Practical Strategies for Mitigating Data Contamination by Evaluation Benchmarks
inferred← citeshttps://doi.org/10.20944/preprints202006.0324.v1openalex-snapshot
Methods for De-novo Genome Assembly
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2176027/v1openalex-snapshot
Efficient and secure computation of edit distance on genomic data
inferred← citeshttps://doi.org/10.2991/jcis.2006.238openalex-snapshot
A study of some easily parallellizable automata
inferred← citeshttps://doi.org/10.46471/gigabyte.141openalex-snapshot
TSTA: thread and SIMD-based trapezoidal pairwise/multiple sequence-alignment method
inferred← citeshttps://doi.org/10.48550/arxiv.2103.14978openalex-snapshot
GateKeeper-GPU: Fast and Accurate Pre-Alignment Filtering in Short Read Mapping
inferred← citeshttps://doi.org/10.5120/12565-9214openalex-snapshot
Implementation of Bit-Vector Algorithm for Approximate String Matching on Rhodopsin Protein Sequence
inferred← citeshttps://doi.org/10.5281/zenodo.1415907openalex-snapshot
Semex - An Efficient Music Retrieval Prototype.
inferred← citeshttps://doi.org/10.55630/sjc.2019.13.71-80openalex-snapshot
On Fuzzy Matching of Strings
inferred← citeshttps://doi.org/10.5821/dissertation-2117-113295openalex-snapshot
Efficient approximate string matching techniques for sequence alignment
inferred← citeshttps://doi.org/10.7287/peerj.606v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj.606v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj.606v0.1/reviews/3openalex-snapshot
Peer Review #3 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj.606v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj.606v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj.606v0.2/reviews/3openalex-snapshot
Peer Review #3 of "Massively parallel read mapping on GPUs with the q-group index and PEANUT (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj.7170v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Fuzzysplit: demultiplexing and trimming sequenced DNA with a declarative language (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj.7170openalex-snapshot
Fuzzysplit: demultiplexing and trimming sequenced DNA with a declarative language
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.