On the public citation graph
Speeding up two string-matching algorithms
0 signed · 178 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/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
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)90133-zopenalex-snapshot
Average running time of the Boyer-Moore-Horspool algorithm
inferredcites →https://doi.org/10.1016/0304-3975(92)90139-7openalex-snapshot
A variation on the Boyer-Moore algorithm
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferredcites →https://doi.org/10.1137/0208029openalex-snapshot
The Complexity of Pattern Matching for a Random String
inferredcites →https://doi.org/10.1137/0209037openalex-snapshot
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
inferredcites →https://doi.org/10.1137/0209051openalex-snapshot
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
inferredcites →https://doi.org/10.1137/0215007openalex-snapshot
The Boyer–Moore–Galil String Searching Strategies Revisited
inferredcites →https://doi.org/10.1137/s0097539791195543openalex-snapshot
Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm
inferredcites →https://doi.org/10.1145/359146.359148openalex-snapshot
On improving the worst case running time of the Boyer-Moore string matching algorithm
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/sec.1115openalex-snapshot
An efficient parallel algorithm for exact multi‐pattern matching
inferred← citeshttps://doi.org/10.1002/spe.411openalex-snapshot
NR‐grep: a fast and flexible pattern‐matching tool
inferred← citeshttps://doi.org/10.1002/spe.663openalex-snapshot
LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text
inferred← citeshttps://doi.org/10.1002/spe.70087openalex-snapshot
Improving String Matching through Enhanced Hashing
inferred← citeshttps://doi.org/10.1006/jagm.1998.0948openalex-snapshot
On the Comparison Complexity of the String Prefix-Matching Problem
inferred← citeshttps://doi.org/10.1006/jagm.2000.1087openalex-snapshot
Simple Optimal String Matching Algorithm
inferred← citeshttps://doi.org/10.1007/11496656_25openalex-snapshot
A Simple Fast Hybrid Pattern-Matching Algorithm
inferred← citeshttps://doi.org/10.1007/11575832_44openalex-snapshot
A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching
inferred← citeshttps://doi.org/10.1007/11780441_32openalex-snapshot
Sublinear Algorithms for Parameterized Matching
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_4openalex-snapshot
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_30openalex-snapshot
Simple Optimal String Matching Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_34openalex-snapshot
On the Complexity of Determining the Period of a String
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_16openalex-snapshot
Three Heuristics for δ-Matching: δ-BM Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_5openalex-snapshot
Faster String Matching with Super-Alphabets
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_25openalex-snapshot
Speeding Up Pattern Matching by Text Compression
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_18openalex-snapshot
Factor Oracle: A New Structure for Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_5openalex-snapshot
Efficient Experimental String Matching by Weak Factor Recognition*
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_17openalex-snapshot
Fast Regular Expression Search
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_2openalex-snapshot
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_365openalex-snapshot
Sequential Exact String Matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-1007-5_6openalex-snapshot
Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_6openalex-snapshot
A Very Fast String Matching Algorithm Based on Condensed Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_35openalex-snapshot
Improved Single and Multiple Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_3openalex-snapshot
Automaton-Based Sublinear Keyword Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_3openalex-snapshot
A General Weighted Grammar Library
inferred← citeshttps://doi.org/10.1007/978-3-540-31871-2_25openalex-snapshot
On Bit-Parallel Processing of Multi-byte Text
inferred← citeshttps://doi.org/10.1007/978-3-540-33461-3_3openalex-snapshot
Maxime Crochemore, Thierry Lecroq
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-76336-9_14openalex-snapshot
Accelerating Boyer Moore Searches on Binary Texts
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_10openalex-snapshot
Speeding Up Pattern Matching by Text Sampling
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_14openalex-snapshot
New Perspectives on the Prefix Array
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_45openalex-snapshot
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_34openalex-snapshot
A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-642-02481-8_178openalex-snapshot
Efficient Exact Pattern-Matching in Proteomic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_8openalex-snapshot
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_10openalex-snapshot
Worst Case Efficient Single and Multiple String Matching in the RAM Model
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_4openalex-snapshot
Average Optimal String Matching in Packed Strings
inferred← citeshttps://doi.org/10.1007/978-981-10-3223-3_42openalex-snapshot
Scrutiny of Data Sets Through Procedural Algorithms for Categorization
inferred← citeshttps://doi.org/10.1007/bfb0030778openalex-snapshot
A bit-parallel approach to suffix automata: Fast extended string matching
inferred← citeshttps://doi.org/10.1007/bfb0030780openalex-snapshot
A very fast string matching algorithm for small alphabets and long patterns
inferred← citeshttps://doi.org/10.1007/bfb0045093openalex-snapshot
Fast algorithms for aligning sequences with restricted affine gap penalties
inferred← citeshttps://doi.org/10.1007/s00453-004-1120-3openalex-snapshot
New Techniques for Regular Expression Searching
inferred← citeshttps://doi.org/10.1007/s00453-020-00732-4openalex-snapshot
Efficient Online String Matching Based on Characters Distance Text Sampling
inferred← citeshttps://doi.org/10.1007/s00500-014-1581-5openalex-snapshot
Thyroid disease diagnosis via hybrid architecture composing rough data sets theory and machine learning algorithms
inferred← citeshttps://doi.org/10.1007/s10791-008-9054-zopenalex-snapshot
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
inferred← citeshttps://doi.org/10.1007/s10844-012-0196-5openalex-snapshot
Rotation-invariant similarity in time series using bag-of-patterns representation
inferred← citeshttps://doi.org/10.1007/s11047-007-9033-0openalex-snapshot
Light-based string matching
inferred← citeshttps://doi.org/10.1007/s13198-023-01948-7openalex-snapshot
A novel approach to solve exact matching problem using multi-splitting of text patterns
inferred← citeshttps://doi.org/10.1016/j.dam.2018.07.017openalex-snapshot
A brief history of parameterized matching problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.06.009openalex-snapshot
Efficient parameterized string matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.02.010openalex-snapshot
Average complexity of backward q-gram string matching algorithms
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.002openalex-snapshot
Practical and flexible pattern matching over Ziv–Lempel compressed text
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.11.004openalex-snapshot
A simple fast hybrid pattern-matching algorithm
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.jda.2010.09.004openalex-snapshot
String matching with alphabet sampling
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.011openalex-snapshot
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
inferred← citeshttps://doi.org/10.1016/j.jda.2014.07.003openalex-snapshot
Fast and flexible packed string matching
inferred← citeshttps://doi.org/10.1016/j.pmu.2015.09.001openalex-snapshot
Improvised prophecy using regularization method of machine learning algorithms on medical data
inferred← citeshttps://doi.org/10.1016/j.scico.2004.05.003openalex-snapshot
Mutable strings in Java: design, implementation and lightweight text-search algorithms
inferred← citeshttps://doi.org/10.1016/j.scico.2010.04.012openalex-snapshot
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.058openalex-snapshot
Average complexity of exact and approximate multiple string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.002openalex-snapshot
The wide window string matching algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.019openalex-snapshot
Accelerating Boyer–Moore searches on binary texts
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.031openalex-snapshot
Fast string matching for DNA sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.009openalex-snapshot
On the average-case complexity of pattern matching with wildcards
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.034openalex-snapshot
Improved characters distance sampling for online and offline text searching
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00107-5openalex-snapshot
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00092-7openalex-snapshot
Fast practical multi-pattern matching
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00047-5openalex-snapshot
Asymptotic estimation of the average number of terminal states in DAWGs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00259-xopenalex-snapshot
Constant-space string-matching in sublinear average time
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00005-4openalex-snapshot
A unifying look at the Apostolico–Giancarlo string-matching algorithm
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.1021/ci9502212openalex-snapshot
Error Detection, Recovery, and Repair in the Translation of Inorganic Nomenclatures. 1. A Study of the Problem
inferred← citeshttps://doi.org/10.1049/ip-sen:20041265openalex-snapshot
Taxonomy-based software construction of SPARE Time: a case study
inferred← citeshttps://doi.org/10.1057/palgrave.ivs.9500089openalex-snapshot
Visualizing and Discovering Non-Trivial Patterns in Large Time Series Databases
inferred← citeshttps://doi.org/10.1080/00207160108805036openalex-snapshot
On-line string matching algorithms: survey and experimental results
inferred← citeshttps://doi.org/10.1080/0020716031000087113openalex-snapshot
A New String Matching Algorithm
inferred← citeshttps://doi.org/10.1088/1742-6596/1854/1/012042openalex-snapshot
Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review
inferred← citeshttps://doi.org/10.1089/106652703322756140openalex-snapshot
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching
inferred← citeshttps://doi.org/10.1093/comjnl/bxw023openalex-snapshot
A Transformation For Optimizing String-Matching Algorithms For Long Patterns
inferred← citeshttps://doi.org/10.1109/access.2019.2914071openalex-snapshot
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
inferred← citeshttps://doi.org/10.1109/access.2020.2969038openalex-snapshot
Simple and Efficient Pattern Matching Algorithms for Biological Sequences
inferred← citeshttps://doi.org/10.1109/aina.2005.184openalex-snapshot
Fast Pattern Detection in Stream Data
inferred← citeshttps://doi.org/10.1109/cbms.2010.6042675openalex-snapshot
Finding approximate frequent patterns in streaming medical data
inferred← citeshttps://doi.org/10.1109/chicc.2008.4604947openalex-snapshot
Flexible pattern matching algorithm in Chinese strings
inferred← citeshttps://doi.org/10.1109/csicc49403.2020.9050070openalex-snapshot
Efficient Pattern Matching Algorithms for DNA Sequences
inferred← citeshttps://doi.org/10.1109/eit.2007.4374455openalex-snapshot
A comparison of the performance of four exact string matching algorithms
inferred← citeshttps://doi.org/10.1109/iciet.2010.5625685openalex-snapshot
Fastest approach to exact pattern matching
inferred← citeshttps://doi.org/10.1109/iciet.2010.5625719openalex-snapshot
Improved text scanning approach for exact String matching
inferred← citeshttps://doi.org/10.1109/icnit.2010.5508548openalex-snapshot
Text scanning approach for exact string matching
inferred← citeshttps://doi.org/10.1109/ispdc.2016.19openalex-snapshot
SWIFT-A Performance Accelerated Optimized String Matching Algorithm for Nvidia GPUs
inferred← citeshttps://doi.org/10.1109/istcs.1993.253483openalex-snapshot
Which patterns are hard to find? (String matching)
inferred← citeshttps://doi.org/10.1109/tc.2012.61openalex-snapshot
GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU
inferred← citeshttps://doi.org/10.1109/tcbb.2012.109openalex-snapshot
Probabilistic Arithmetic Automata and Their Applications
inferred← citeshttps://doi.org/10.1109/tkde.2014.2382882openalex-snapshot
SAX Discretization Does Not Guarantee Equiprobable Symbols
inferred← citeshttps://doi.org/10.1137/s009753979324694xopenalex-snapshot
Tighter Upper Bounds on the Exact Complexity of String Matching
inferred← citeshttps://doi.org/10.1142/s0129054105003066openalex-snapshot
THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY
inferred← citeshttps://doi.org/10.1142/s0129054106004388openalex-snapshot
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
inferred← citeshttps://doi.org/10.1142/s0129054109006991openalex-snapshot
EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
inferred← citeshttps://doi.org/10.1142/s0129054118430062openalex-snapshot
Fast Average-Case Pattern Matching on Weighted Sequences
inferred← citeshttps://doi.org/10.1145/1005813.1041513openalex-snapshot
Average-optimal single and multiple approximate string matching
inferred← citeshttps://doi.org/10.1145/1014052.1014104openalex-snapshot
Visually mining and monitoring massive time series
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/1412228.1455263openalex-snapshot
Succinct backward-DAWG-matching
inferred← citeshttps://doi.org/10.1145/1814245.1814255openalex-snapshot
Approximate variable-length time series motif discovery using grammar inference
inferred← citeshttps://doi.org/10.1145/234313.234331openalex-snapshot
Pattern Matching and Text Compression Algorithms
inferred← citeshttps://doi.org/10.1145/2431211.2431212openalex-snapshot
The exact online string matching problem
inferred← citeshttps://doi.org/10.1145/2463676.2465289openalex-snapshot
Improving regular-expression matching on strings using negative factors
inferred← citeshttps://doi.org/10.1145/248625.248639openalex-snapshot
A text compression scheme that allows fast searching directly in the compressed file
inferred← citeshttps://doi.org/10.1145/3213187.3287613openalex-snapshot
An Exact matching approach to enhance retrieval process for Quranic texts
inferred← citeshttps://doi.org/10.1145/3301295openalex-snapshot
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
inferred← citeshttps://doi.org/10.1145/3341161.3343517openalex-snapshot
Exhaustive exact string matching
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/3660318.3660327openalex-snapshot
Practical Implementation of a Quantum String Matching Algorithm
inferred← citeshttps://doi.org/10.1145/369133.369220openalex-snapshot
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.1145/3769820openalex-snapshot
Regular Expression Indexing for Log Analysis
inferred← citeshttps://doi.org/10.1201/b16812-18openalex-snapshot
Pattern Matching and Text Compression Algorithms
inferred← citeshttps://doi.org/10.12681/eadd/29868openalex-snapshot
Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms
inferred← citeshttps://doi.org/10.12694/scpe.v16i2.1085openalex-snapshot
Multiple String Matching on a GPU using CUDAs
inferred← citeshttps://doi.org/10.13140/rg.2.1.5184.9046openalex-snapshot
A FAST HEURISTIC FOR EXACT STRING MATCHING
inferred← citeshttps://doi.org/10.1371/journal.pone.0198284openalex-snapshot
Residual-based approach for authenticating pattern of multi-style diacritical Arabic texts
inferred← citeshttps://doi.org/10.1371/journal.pone.0200912openalex-snapshot
A new split based searching for exact pattern matching for natural texts
inferred← citeshttps://doi.org/10.1504/ijbra.2009.027510openalex-snapshot
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
inferred← citeshttps://doi.org/10.15407/pp2022.02.057openalex-snapshot
60 Years of Databases (part four)
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.17877/de290r-552openalex-snapshot
Algorithms and statistical methods for exact motif discovery
inferred← citeshttps://doi.org/10.18178/ijfcc.2017.6.1.479openalex-snapshot
On Performance Evaluation of BM-Based String Matching Algorithms in Distributed Computing Environment
inferred← citeshttps://doi.org/10.22452/mjcs.vol31no3.3openalex-snapshot
PARTITION-BASED PATTERN MATCHING APPROACH FOR EFFICIENT RETRIEVAL OF ARABIC TEXT
inferred← citeshttps://doi.org/10.3115/993268.993378openalex-snapshot
Chinese string searching using the KMP algorithm
inferred← citeshttps://doi.org/10.3233/fun-2006-72402openalex-snapshot
On-line Approximate String Matching in Natural Language
inferred← citeshttps://doi.org/10.3390/a4040285openalex-snapshot
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
inferred← citeshttps://doi.org/10.3923/itj.2010.453.459openalex-snapshot
An Efficient ASCII-Based Algorithm for Single Pattern Matching
inferred← citeshttps://doi.org/10.3923/jas.2007.2691.2695openalex-snapshot
An Efficient Pattern Matching Algorithm
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.284-287.3290openalex-snapshot
A Term Matching Strategy for Item-Banks Integration
inferred← citeshttps://doi.org/10.47839/ijc.18.3.1520openalex-snapshot
DEVELOPING A FASTER PATTERN MATCHING ALGORITHMS FOR INTRUSION DETECTION SYSTEM
inferred← citeshttps://doi.org/10.48550/arxiv.1009.6114openalex-snapshot
Exact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2547openalex-snapshot
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05067openalex-snapshot
Exact Online String Matching Bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.1707.00469openalex-snapshot
Speeding Up String Matching by Weak Factor Recognition
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0306046openalex-snapshot
Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search
inferred← citeshttps://doi.org/10.5120/15058-3190openalex-snapshot
New and Efficient Recursive-based String Matching Algorithm (RSMA-FLFC)
inferred← citeshttps://doi.org/10.5120/ijais14-451279openalex-snapshot
A Noble Approach on Bioinformatics: Smart Sequence Alignment Algorithm applying DNA Replication (SSAADR)
inferred← citeshttps://doi.org/10.5772/18488openalex-snapshot
Parallel Processing of Multiple Pattern Matching Algorithms for Biological Sequences: Methods and Performance Results
inferred← citeshttps://doi.org/10.70675/c3c14cc5zb13ez4bdbza2cdz863309627394openalex-snapshot
Complexité de la recherche de motifs dans un texte aléatoire
inferred← citeshttps://doi.org/10.7763/ijcte.2012.v4.462openalex-snapshot
Quick-Skip Search Hybrid Algorithm for the Exact String Matching Problem
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.