On the public citation graph
Sublinear approximate string matching and biological applications
0 signed · 200 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-17660-8_45openalex-snapshot
Longest common factor of two words
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_19openalex-snapshot
Color Set Size problem with applications to string matching
inferredcites →https://doi.org/10.1007/3-540-58094-8_23openalex-snapshot
Approximate string matching and local similarity
inferredcites →https://doi.org/10.1007/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf01185430openalex-snapshot
Parametric optimization of sequence alignment
inferredcites →https://doi.org/10.1007/bf01769703openalex-snapshot
Approximate string matching with suffix automata
inferredcites →https://doi.org/10.1016/0014-5793(91)80276-9openalex-snapshot
Methods in enzymology: Volume 183 molecular evolution: Computer analysis of protein and nucleic acid sequences
inferredcites →https://doi.org/10.1016/0020-0190(92)90176-vopenalex-snapshot
An efficient algorithm for the All Pairs Suffix-Prefix Problem
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/s0888-7543(05)80277-0openalex-snapshot
A contig assembly program based on sensitive detection of fragment overlaps
inferredcites →https://doi.org/10.1073/pnas.85.8.2444openalex-snapshot
Improved tools for biological sequence comparison.
inferredcites →https://doi.org/10.1073/pnas.89.13.6090openalex-snapshot
Parametric sequence comparisons.
inferredcites →https://doi.org/10.1093/nar/12.1part1.307openalex-snapshot
SEQAID: a DNA sequence assembling program based on a mathematical model
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferredcites →https://doi.org/10.1109/fscs.1990.89555openalex-snapshot
Inferring evolutionary history from DNA sequences
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0208029openalex-snapshot
The Complexity of Pattern Matching for a Random String
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/322234.322237openalex-snapshot
Linear Algorithm for Data Compression via String Matching
inferredcites →https://doi.org/10.1145/63334.63341openalex-snapshot
Data compression with finite windows
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.2307/2532117openalex-snapshot
Mathematical Methods for DNA Sequences.
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/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-oopenalex-snapshot
Reducing the space requirement of suffix trees
inferred← citeshttps://doi.org/10.1002/0471250953.bi1003s00openalex-snapshot
Using MUMmer to Identify Similar Regions in Large Sequence Sets
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.1002/smr.1592openalex-snapshot
Large‐scale inter‐system clone detection using suffix trees and hashing
inferred← citeshttps://doi.org/10.1002/spe.698openalex-snapshot
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem
inferred← citeshttps://doi.org/10.1002/widm.36openalex-snapshot
Similarity measures for sequential data
inferred← citeshttps://doi.org/10.1006/inco.1996.0087openalex-snapshot
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
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_13openalex-snapshot
Hardness of Optimal Spaced Seed Design
inferred← citeshttps://doi.org/10.1007/11575832_29openalex-snapshot
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
inferred← citeshttps://doi.org/10.1007/11732990_22openalex-snapshot
Efficient Enumeration of Phylogenetically Informative Substrings
inferred← citeshttps://doi.org/10.1007/3-540-27139-2_16openalex-snapshot
Algorithms in Ambient Intelligence
inferred← citeshttps://doi.org/10.1007/3-540-44796-2_10openalex-snapshot
Using Copy-Detection and Text Comparison Algorithms for Cross-Referencing Multiple Editions of Literary Works
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_6openalex-snapshot
Distributed and Paged Suffix Trees for Large Genetic Databases
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_60openalex-snapshot
Suffix Vector: A Space-Efficient Suffix Tree Representation
inferred← citeshttps://doi.org/10.1007/3-540-45784-4_33openalex-snapshot
Rapid Large-Scale Oligonucleotide Selection for Microarrays
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_67openalex-snapshot
On the construction of classes of suffix trees for square matrices: Algorithms and applications
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_1openalex-snapshot
A faster algorithm for 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-62592-5_71openalex-snapshot
A note on updating suffix tree labels
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-63307-3_57openalex-snapshot
Multiple approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_25openalex-snapshot
Parallel and Distributed Document Overlap Detection on the Web
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_6openalex-snapshot
String Pattern Matching for a Deluge Survival Kit
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8openalex-snapshot
String Processing and Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_13openalex-snapshot
The Colored Longest Common Prefix Array Computed via Sequential Scans
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_4openalex-snapshot
Longest Property-Preserved Common Factor
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_15openalex-snapshot
Computing All-vs-All MEMs in Run-Length-Encoded Collections of HiFi Reads
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_13openalex-snapshot
Computing All-vs-All MEMs in Grammar-Compressed Text
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_28openalex-snapshot
Frequency-Constrained Substring Complexity
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_8openalex-snapshot
Massively Parallel Computation of Matching Statistics
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_27openalex-snapshot
Approximate Online Matching of Circular Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-23826-5_18openalex-snapshot
Filtration Algorithms for Approximate Order-Preserving Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_6openalex-snapshot
On the Average Sequence Complexity
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-75530-2_1openalex-snapshot
A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-02788-8_9openalex-snapshot
String Mining in Bioinformatics
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_36openalex-snapshot
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
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-38527-8_14openalex-snapshot
Lightweight Lempel-Ziv Parsing
inferred← citeshttps://doi.org/10.1007/978-94-017-0703-9_4openalex-snapshot
Cubyhum: Algorithms for Query by Humming
inferred← citeshttps://doi.org/10.1007/bfb0016490openalex-snapshot
Video sequence similarity matching
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/pl00009177openalex-snapshot
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/pl00009253openalex-snapshot
Faster Approximate String Matching
inferred← citeshttps://doi.org/10.1007/s00224-025-10257-4openalex-snapshot
The ceBWT Index: An Index for Circular Cartesian Tree Matching on Multiple Texts
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-015-0060-4openalex-snapshot
Quantum Pattern Matching Fast on Average
inferred← citeshttps://doi.org/10.1007/s00453-026-01398-0openalex-snapshot
Compressed Dictionary Matching on Run-Length Encoded Strings
inferred← citeshttps://doi.org/10.1007/s10489-010-0233-4openalex-snapshot
A hash trie filter method for approximate string matching in genomic databases
inferred← citeshttps://doi.org/10.1007/s10618-008-0110-5openalex-snapshot
A space efficient solution to the frequent string mining problem for many databases
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.007openalex-snapshot
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.12.012openalex-snapshot
Computing suffix links for suffix trees and arrays
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.012openalex-snapshot
A filtering algorithm for k-mismatch with don't cares
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.03.006openalex-snapshot
Longest common substrings with k mismatches
inferred← citeshttps://doi.org/10.1016/j.is.2010.11.001openalex-snapshot
Suffix trees for inputs larger than main memory
inferred← citeshttps://doi.org/10.1016/j.is.2025.102611openalex-snapshot
Extended parameterized Burrows–Wheeler transform
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.10.001openalex-snapshot
Hardness of optimal spaced seed design
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.08.004openalex-snapshot
Constructing large suffix trees on a computational grid
inferred← citeshttps://doi.org/10.1016/j.neucom.2008.04.041openalex-snapshot
High-order Markov kernels for intrusion detection
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.023openalex-snapshot
On average sequence complexity
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.2014.02.022openalex-snapshot
Average-case linear-time similar substring searching by the q -gram distance
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.013openalex-snapshot
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.012openalex-snapshot
Longest property-preserved common factor: A new string-processing framework
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115796openalex-snapshot
Matching statistics—a survey
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00243-0openalex-snapshot
On updating suffix tree labels
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00065-0openalex-snapshot
Replacing suffix trees with enhanced suffix arrays
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/s41534-021-00369-3openalex-snapshot
A quantum algorithm for string matching
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1089/106652703321825919openalex-snapshot
A Table-Driven, Full-Sensitivity Similarity Search Algorithm
inferred← citeshttps://doi.org/10.1089/10665270360688093openalex-snapshot
Provably Sensitive Indexing Strategies for Biosequence Similarity Search
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.1089/cmb.2007.0105openalex-snapshot
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
inferred← citeshttps://doi.org/10.1089/cmb.2007.r011openalex-snapshot
Efficient Enumeration of Phylogenetically Informative Substrings
inferred← citeshttps://doi.org/10.1093/bioinformatics/btae717openalex-snapshot
BWT construction and search at the terabase scale
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt706openalex-snapshot
slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array
inferred← citeshttps://doi.org/10.1093/bioinformatics/btw458openalex-snapshot
Improve homology search sensitivity of PacBio data by correcting frameshifts
inferred← citeshttps://doi.org/10.1101/2022.08.09.503358openalex-snapshot
MONI- k : An index for efficient pangenome-to-pangenome comparison
inferred← citeshttps://doi.org/10.1101/2024.05.20.595044openalex-snapshot
MEM-based pangenome indexing for k -mer queries
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/cis.workshops.2007.58openalex-snapshot
An Improved Quick Algorithm for Aligning DNA/RNA Sequences
inferred← citeshttps://doi.org/10.1109/cisw.2007.4425622openalex-snapshot
An Improved Quick Algorithm for Aligning DNA/RNA Sequences
inferred← citeshttps://doi.org/10.1109/csb.2002.1039329openalex-snapshot
Rapid large-scale oligonucleotide selection for microarrays
inferred← citeshttps://doi.org/10.1109/csb.2003.1227304openalex-snapshot
Fast and sensitive probe selection for DNA chips using jumps in matching statistics
inferred← citeshttps://doi.org/10.1109/csmr.2012.37openalex-snapshot
Large-Scale Inter-System Clone Detection Using Suffix Trees
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281455openalex-snapshot
Compressed index for dynamic text
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00015openalex-snapshot
Computing Matching Statistics on Repetitive Texts
inferred← citeshttps://doi.org/10.1109/dcc55655.2023.00023openalex-snapshot
Computing matching statistics on Wheeler DFAs
inferred← citeshttps://doi.org/10.1109/embc.2012.6347436openalex-snapshot
Approximate string matching using phase correlation
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016638openalex-snapshot
Approximate string matching in LDAP based on edit distance
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213439openalex-snapshot
Approximate search engine optimization for directory service
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.159openalex-snapshot
Extracting Maximal Exact Matches on GPU
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492590openalex-snapshot
Optimal on-line search and sublinear time update in string matching
inferred← citeshttps://doi.org/10.1109/wcre.2011.22openalex-snapshot
Approximate Code Search in Program Histories
inferred← citeshttps://doi.org/10.1128/spectrum.01115-22openalex-snapshot
Metatranscriptomics Reveals the Diversity of the Tick Virome in Northwest China
inferred← citeshttps://doi.org/10.1137/s0097539793246707openalex-snapshot
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
inferred← citeshttps://doi.org/10.1137/s0097539795286119openalex-snapshot
Optimal On-Line Search and Sublinear Time Update in String Matching
inferred← citeshttps://doi.org/10.1142/s0219720003000125openalex-snapshot
Fast Large Scale Oligonucleotide Selection Using the Longest Common Factor Approach
inferred← citeshttps://doi.org/10.1145/1005813.1041513openalex-snapshot
Average-optimal single and multiple approximate string matching
inferred← citeshttps://doi.org/10.1145/1143844.1143961openalex-snapshot
Fast and space efficient string kernels using suffix arrays
inferred← citeshttps://doi.org/10.1145/1150402.1150455openalex-snapshot
Extracting key-substring-group features for text classification
inferred← citeshttps://doi.org/10.1145/1247480.1247572openalex-snapshot
Genome-scale disk-based suffix tree indexing
inferred← citeshttps://doi.org/10.1145/1559845.1559931openalex-snapshot
Serial and parallel methods for i/o efficient suffix tree construction
inferred← citeshttps://doi.org/10.1145/1654059.1654122openalex-snapshot
Indexing genomic sequences on the IBM Blue Gene
inferred← citeshttps://doi.org/10.1145/1862919.1862922openalex-snapshot
I/O efficient algorithms for serial and parallel suffix tree construction
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/3357713.3384266openalex-snapshot
Approximating text-to-pattern Hamming distances
inferred← citeshttps://doi.org/10.1145/3543507.3583456openalex-snapshot
Interactive Log Parsing via Light-weight User Feedback
inferred← citeshttps://doi.org/10.1145/3701561openalex-snapshot
Computing MEMs and Relatives on Repetitive Text Collections
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.1145/563857.563820openalex-snapshot
Suffix vector: space- and time-efficient alternative to suffix trees
inferred← citeshttps://doi.org/10.1145/565196.565208openalex-snapshot
Provably sensitive Indexing strategies for biosequence similarity search
inferred← citeshttps://doi.org/10.1186/1471-2105-12-198openalex-snapshot
HMM-FRAME: accurate protein domain classification for metagenomic sequences containing frameshift errors
inferred← citeshttps://doi.org/10.1186/s13015-017-0118-8openalex-snapshot
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings
inferred← citeshttps://doi.org/10.1186/s13015-023-00245-zopenalex-snapshot
Suffix sorting via matching statistics
inferred← citeshttps://doi.org/10.1186/s13015-025-00272-yopenalex-snapshot
Mem-based pangenome indexing for k-mer queries
inferred← citeshttps://doi.org/10.1201/9780203021415-6openalex-snapshot
Motifs in Sequences: Localization and Extraction
inferred← citeshttps://doi.org/10.1201/9781420036275-17openalex-snapshot
Enhanced Suffix Arrays and Applications
inferred← citeshttps://doi.org/10.1371/journal.pcbi.0030098openalex-snapshot
Comprehensive DNA Signature Discovery and Validation
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.14778/3447689.3447695openalex-snapshot
On the string matching with k differences in DNA databases
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.18725/oparu-365openalex-snapshot
Algorithms and a software system for comparative genome analysis
inferred← citeshttps://doi.org/10.25959/23213057openalex-snapshot
Multiple sequence alignment algorithms for the phylogenic analysis of chloroplast DNA
inferred← citeshttps://doi.org/10.32657/10356/2468openalex-snapshot
Computational genomics on the grid
inferred← citeshttps://doi.org/10.32657/10356/2470openalex-snapshot
Framework forensic examination computer systems
inferred← citeshttps://doi.org/10.3390/a15070242openalex-snapshot
A New String Edit Distance and Applications
inferred← citeshttps://doi.org/10.33915/etd.3402openalex-snapshot
Suffix Structures and Circular Pattern Problems
inferred← citeshttps://doi.org/10.4225/03/59d42da95f042openalex-snapshot
Efficient computational approach to identifying overlapping documents in large digital collections
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1816openalex-snapshot
Quantum pattern matching fast on average
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02099openalex-snapshot
Longest Property-Preserved Common Factor
inferred← citeshttps://doi.org/10.5244/c.12.44openalex-snapshot
Automatic Processing of Document Annotations
inferred← citeshttps://doi.org/10.5281/zenodo.1415613openalex-snapshot
Cubyhum: A Fully Operational "Query By Humming" System.
inferred← citeshttps://doi.org/10.5281/zenodo.1417382openalex-snapshot
A Survey Of Music Information Retrieval Systems.
inferred← citeshttps://doi.org/10.5353/th_b3105973openalex-snapshot
On the construction and application of compressed text indexes
inferred← citeshttps://doi.org/10.5555/1070432.1070436openalex-snapshot
Dynamic dictionary matching and compressed suffix trees
inferred← citeshttps://doi.org/10.5555/545564.545582openalex-snapshot
Efficiency of data structures for detecting overlaps in digital documents
inferred← citeshttps://doi.org/10.6688/jise.2010.26.4.2openalex-snapshot
Identifying Prototypical Melodies by Extracting Approximate Repeating Patterns from Music Works
inferred← citeshttps://doi.org/10.70675/7456411dzb289z4b12za36bz2d598a386069openalex-snapshot
GRAB-HAI : Generating Reciprocally Adaptive Behavior for Human-Agent Interaction
inferred← citeshttps://doi.org/10.70675/c3c14cc5zb13ez4bdbza2cdz863309627394openalex-snapshot
Complexité de la recherche de motifs dans un texte aléatoire
inferred← citeshttps://doi.org/10.7551/mitpress/4057.003.0008openalex-snapshot
Fast Kernels for String and Tree Matching
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.