On the public citation graph
Approximate string-matching over suffix trees
0 signed · 140 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/3-540-52846-6_103openalex-snapshot
Boyer-Moore approach to approximate string matching
inferredcites →https://doi.org/10.1007/3-540-54345-7_67openalex-snapshot
Two algorithms for approxmate string matching in static texts
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/bf01185432openalex-snapshot
A sublinear algorithm for approximate keyword searching
inferredcites →https://doi.org/10.1007/bf01769703openalex-snapshot
Approximate string matching with suffix automata
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/0304-3975(85)90157-4openalex-snapshot
The smallest automation recognizing the subwords of a text
inferredcites →https://doi.org/10.1016/0304-3975(86)90041-1openalex-snapshot
Transducers and repetitions
inferredcites →https://doi.org/10.1016/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
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.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.5555/320176.320218openalex-snapshot
Suffix arrays: a new method for on-line string searches
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.3143openalex-snapshot
Compact Recognizers of Episode Sequences
inferred← citeshttps://doi.org/10.1007/11430919_26openalex-snapshot
A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment
inferred← citeshttps://doi.org/10.1007/11496656_10openalex-snapshot
An Efficient Algorithm for Generating Super Condensed Neighborhoods
inferred← citeshttps://doi.org/10.1007/11536406_28openalex-snapshot
Case Based Representation and Retrieval with Time Dependent Features
inferred← citeshttps://doi.org/10.1007/11575832_28openalex-snapshot
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
inferred← citeshttps://doi.org/10.1007/11602613_35openalex-snapshot
Improved Approximate String Matching Using Compressed Suffix Data Structures
inferred← citeshttps://doi.org/10.1007/11880561_31openalex-snapshot
A New Algorithm for Fast All-Against-All Substring Matching
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_28openalex-snapshot
Using Suffix Trees for Gapped Motif Discovery
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-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-48194-x_6openalex-snapshot
Better Filtering with Gapped q-Grams
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-58094-8_18openalex-snapshot
Proximity matching using fixed-queries trees
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_58openalex-snapshot
On the editing distance between undirected acyclic graphs and related problems
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_2openalex-snapshot
Boyer-Moore strategy to efficient 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_56openalex-snapshot
Greedy algorithms for the shortest common superstring that are asymtotically optimal
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_7openalex-snapshot
Searching Large Text Collections
inferred← citeshttps://doi.org/10.1007/978-3-319-32025-0_31openalex-snapshot
An Adaptive Approach of Approximate Substring Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-59826-0_2openalex-snapshot
Full-Text Indexes for High-Throughput Sequencing
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_33openalex-snapshot
Approximate String Matching Using Compressed Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_36openalex-snapshot
Average-Case Analysis of Approximate Trie Search
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_30openalex-snapshot
Text Searching: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_16openalex-snapshot
A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval
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-73437-6_7openalex-snapshot
Cache-Oblivious Index for Approximate String Matching
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-642-12476-1_15openalex-snapshot
Approximate String Matching with Reduced Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_43openalex-snapshot
A Randomized Numerical Aligner (rNA)
inferred← citeshttps://doi.org/10.1007/978-3-642-14464-6_10openalex-snapshot
Providing Case-Based Retrieval as a Decision Support Strategy in Time Dependent Medical Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-16001-1_17openalex-snapshot
Enhancing Graph Database Indexing by Suffix Tree Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_16openalex-snapshot
Improved Fast Similarity Search in Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_12openalex-snapshot
Super-Linear Indices for Approximate Dictionary Searching
inferred← citeshttps://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferred← citeshttps://doi.org/10.1007/bfb0054337openalex-snapshot
Spelling approximate repeated or common motifs using a suffix tree
inferred← citeshttps://doi.org/10.1007/pl00009207openalex-snapshot
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
inferred← citeshttps://doi.org/10.1007/s00453-006-0126-4openalex-snapshot
Average-Case Analysis of Approximate Trie Search
inferred← citeshttps://doi.org/10.1007/s00453-007-9104-8openalex-snapshot
Improved Approximate String Matching Using Compressed Suffix Data Structures
inferred← citeshttps://doi.org/10.1007/s007780200064openalex-snapshot
Database indexing for large DNA and protein sequence collections
inferred← citeshttps://doi.org/10.1007/s00779-012-0569-3openalex-snapshot
Efficient techniques on retrieving bio-information for active U-healthcare
inferred← citeshttps://doi.org/10.1007/s10115-015-0896-6openalex-snapshot
An efficient pruning strategy for approximate string matching over suffix tree
inferred← citeshttps://doi.org/10.1007/s10559-019-00196-7openalex-snapshot
Index Structures for Fast Similarity Search for Symbol Strings
inferred← citeshttps://doi.org/10.1007/s11042-007-0138-3openalex-snapshot
True suffix tree approach for discovering non-trivial repeating patterns in a music object
inferred← citeshttps://doi.org/10.1007/s41060-022-00320-5openalex-snapshot
Accurate and efficient privacy-preserving string matching
inferred← citeshttps://doi.org/10.1016/j.dam.2004.04.012openalex-snapshot
On-line construction of compact directed acyclic word graphs
inferred← citeshttps://doi.org/10.1016/j.datak.2003.08.004openalex-snapshot
Efficient similarity-based operations for data integration
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.jcss.2011.12.007openalex-snapshot
A randomized Numerical Aligner (rNA)
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.2004.08.005openalex-snapshot
Bit-parallel (δ,γ) -matching and suffix automata
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.022openalex-snapshot
Approximate string matching using compressed suffix arrays
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/j.tcs.2011.03.004openalex-snapshot
Cache-oblivious index for approximate string matching
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00243-0openalex-snapshot
On updating suffix tree labels
inferred← citeshttps://doi.org/10.1023/a:1008689103430openalex-snapshot
Discovering Patterns from Large and Dynamic Sequential Data
inferred← citeshttps://doi.org/10.1023/a:1016014301288openalex-snapshot
Using Signature Hashing for Approximate String Matching
inferred← citeshttps://doi.org/10.1093/bib/bbt081openalex-snapshot
A bioinformatician's guide to the forefront of suffix array construction algorithms
inferred← citeshttps://doi.org/10.1093/bioinformatics/btag244openalex-snapshot
Sassy: fuzzy searching DNA sequences using SIMD
inferred← citeshttps://doi.org/10.1093/bioinformatics/btu439openalex-snapshot
Lambda: the local aligner for massive biological data
inferred← citeshttps://doi.org/10.1093/nar/gkt005openalex-snapshot
Fast and accurate read mapping with approximate seeds and multiple backtracking
inferred← citeshttps://doi.org/10.1109/bibe.2006.253326openalex-snapshot
Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model
inferred← citeshttps://doi.org/10.1109/bmei.2012.6513199openalex-snapshot
GPU-accelerated Burrow-Wheeler Transform for genomic data
inferred← citeshttps://doi.org/10.1109/icdcsw.2002.1030779openalex-snapshot
The numeric indexing for music data
inferred← citeshttps://doi.org/10.1109/icdcsw.2003.1203627openalex-snapshot
Multi-feature indexing for music data
inferred← citeshttps://doi.org/10.1109/icdim.2007.369229openalex-snapshot
Approximate Keyword Search in Web Search Engines
inferred← citeshttps://doi.org/10.1109/jproc.2015.2455551openalex-snapshot
Short Read Mapping: An Algorithmic Tour
inferred← citeshttps://doi.org/10.1109/pdp.2014.51openalex-snapshot
A Parallel Algorithm for the Best k-Mismatches Alignment Problem
inferred← citeshttps://doi.org/10.1109/spire.1999.796573openalex-snapshot
A fast algorithm on average for all-against-all sequence matching
inferred← citeshttps://doi.org/10.1109/ssdbm.2004.20openalex-snapshot
BASS: approximate search on large string databases
inferred← citeshttps://doi.org/10.1109/ssdm.2004.1311210openalex-snapshot
BASS: approximate search on large string databases
inferred← citeshttps://doi.org/10.1117/12.373547openalex-snapshot
Efficient multifeature index structures for music data retrieval
inferred← citeshttps://doi.org/10.1134/s1054661811040110openalex-snapshot
Extracting statistics indicators from tables of basic structure
inferred← citeshttps://doi.org/10.1137/1.9781611975482.70openalex-snapshot
Lower bounds for text indexing with mismatches and differences
inferred← citeshttps://doi.org/10.1142/9781860947322_0001openalex-snapshot
ALLOWING MISMATCHES IN ANCHORS FOR WHOLE GENOME ALIGNMENT: GENERATION AND EFFECTIVENESS
inferred← citeshttps://doi.org/10.1142/9789814317368_0005openalex-snapshot
Approximate String Matching
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/1227161.1370601openalex-snapshot
A graph approach to the threshold all-against-all substring matching problem
inferred← citeshttps://doi.org/10.1145/1559845.1559919openalex-snapshot
Extending autocompletion to tolerate errors
inferred← citeshttps://doi.org/10.1145/1963190.1963191openalex-snapshot
Indexing methods for approximate dictionary searching
inferred← citeshttps://doi.org/10.1145/235809.235810openalex-snapshot
Fast text searching for regular expressions or automaton searching on tries
inferred← citeshttps://doi.org/10.1145/2457317.2457386openalex-snapshot
Scalable string similarity search/join with approximate seeds and multiple backtracking
inferred← citeshttps://doi.org/10.1145/2457465.2457470openalex-snapshot
Efficient fuzzy search in large text collections
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/3543712.3543737openalex-snapshot
Banking Data Enrichment Pipeline
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
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.1177/0165551506059229openalex-snapshot
An efficient approach for sequence matching in large DNA databases
inferred← citeshttps://doi.org/10.1186/1471-2105-12-271openalex-snapshot
DNACLUST: accurate and efficient clustering of phylogenetic marker genes
inferred← citeshttps://doi.org/10.1186/1748-7188-1-22openalex-snapshot
SMOTIF: efficient structured pattern and profile motif search.
inferred← citeshttps://doi.org/10.1186/s13059-021-02443-7openalex-snapshot
Technology dictates algorithms: recent developments in read alignment
inferred← citeshttps://doi.org/10.1201/9781315119335-30openalex-snapshot
Suffix Trees and Suffix Arrays
inferred← citeshttps://doi.org/10.1201/9781420036275.ch6openalex-snapshot
Suffix Tree Applications in Computational Biology
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/ijdmb.2014.062145openalex-snapshot
Applying Agrep to r-NSA to solve multiple sequences approximate matching
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7527openalex-snapshot
Fast Algorithms for Top-k Approximate String Matching
inferred← citeshttps://doi.org/10.17169/refubium-15562openalex-snapshot
Approximate string matching for high-throughput sequencing
inferred← citeshttps://doi.org/10.22028/d291-25714openalex-snapshot
Query estimation techniques in database systems
inferred← citeshttps://doi.org/10.3390/a2031105openalex-snapshot
Approximate String Matching with Compressed Indexes
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.30openalex-snapshot
Faster Algorithms for Longest Common Substring
inferred← citeshttps://doi.org/10.4236/ica.2013.42027openalex-snapshot
Identification of Categorical Registration Data of Domain Names in Data Warehouse Construction Task
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1191openalex-snapshot
Improved Fast Similarity Search in Dictionaries
inferred← citeshttps://doi.org/10.48550/arxiv.2104.03018openalex-snapshot
Accurate and Efficient Suffix Tree Based Privacy-Preserving String Matching
inferred← citeshttps://doi.org/10.5281/zenodo.154478openalex-snapshot
Espresso - Construction Proposal
inferred← citeshttps://doi.org/10.5445/ir/1000035705openalex-snapshot
Building Blocks for Mapping Services
inferred← citeshttps://doi.org/10.6084/m9.figshare.16456908openalex-snapshot
Additional file 1 of Technology dictates algorithms: recent developments in read alignment
inferred← citeshttps://doi.org/10.6084/m9.figshare.16456914openalex-snapshot
Additional file 2 of Technology dictates algorithms: recent developments in read alignment
inferred← citeshttps://doi.org/10.70675/a9200cd9z883dz4521z808azfa072f1bc0beopenalex-snapshot
Apprentissage statistique à partir de variables catégorielles non-uniformisées
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.