On the public citation graph
Faster Approximate String Matching
0 signed · 176 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/(sici)1097-024x(199612)26:12<1439::aid-spe71>3.0.co;2-1openalex-snapshot
A Comparison of Approximate String Matching Algorithms
inferredcites →https://doi.org/10.1002/spe.4380240402openalex-snapshot
Approximate string matching using withinword parallelism
inferredcites →https://doi.org/10.1006/jmbi.1996.0622openalex-snapshot
Very Fast Identification of RNA Motifs in Genomic DNA. Application to tRNA Search in the Yeast Genome
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-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
inferredcites →https://doi.org/10.1007/3-540-58094-8_23openalex-snapshot
Approximate string matching and local similarity
inferredcites →https://doi.org/10.1007/3-540-58325-4_186openalex-snapshot
Approximate pattern matching with samples
inferredcites →https://doi.org/10.1007/3-540-60313-1_153openalex-snapshot
On using q-gram locations in approximate string matching
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/3-540-63307-3_57openalex-snapshot
Multiple 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/0020-0190(96)00083-xopenalex-snapshot
Fast and practical approximate string matching
inferredcites →https://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferredcites →https://doi.org/10.1016/0022-2836(70)90057-4openalex-snapshot
A general method applicable to the search for similarities in the amino acid sequence of two proteins
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/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
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
inferredcites →https://doi.org/10.1145/79173.79184openalex-snapshot
A very fast substring search 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/9780470774069.ch9openalex-snapshot
How Deliberate, Spontaneous, and Unwanted Memories Emerge in a Computational Model of Consciousness
inferred← citeshttps://doi.org/10.1002/rsa.10014openalex-snapshot
New and faster filters for multiple approximate string matching
inferred← citeshttps://doi.org/10.1002/spe.411openalex-snapshot
NR‐grep: a fast and flexible pattern‐matching tool
inferred← citeshttps://doi.org/10.1007/11427186_33openalex-snapshot
New Bit-Parallel Indel-Distance Algorithm
inferred← citeshttps://doi.org/10.1007/11552246_10openalex-snapshot
Topological Global Localization and Mapping with Fingerprints and Uncertainty
inferred← citeshttps://doi.org/10.1007/11554028_70openalex-snapshot
A Programmable Pipelined Queue for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/11575832_28openalex-snapshot
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
inferred← citeshttps://doi.org/10.1007/11671299_61openalex-snapshot
Regional vs. Global Robust Spelling Correction
inferred← citeshttps://doi.org/10.1007/11812128_32openalex-snapshot
Tighter Packed Bit-Parallel NFA for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/3-540-36390-4_13openalex-snapshot
Bit Parallelism - NFA Simulation
inferred← citeshttps://doi.org/10.1007/3-540-39945-3_2openalex-snapshot
A Pattern Matching Based Filter for Audit Reduction and Fast Detection of Potential Intrusions
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-45123-4_29openalex-snapshot
Indexing Text with Approximate q-Grams
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_18openalex-snapshot
Faster Bit-Parallel 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-48452-3_18openalex-snapshot
Fast Multi-dimensional Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_363openalex-snapshot
Sequential Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_363openalex-snapshot
Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_9openalex-snapshot
Run-Length Encoded Nondeterministic KMP and Suffix Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-67077-5_42openalex-snapshot
Analysis of Denoising Autoencoder Properties Through Misspelling Correction Task
inferred← citeshttps://doi.org/10.1007/978-3-319-72817-9_11openalex-snapshot
CRBP-OpType: A Constrained Approximate Search Algorithm for Detecting Similar Attack Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-99277-8_9openalex-snapshot
Collecting Network Evidence Using Constrained Approximate Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_18openalex-snapshot
LexEQUAL: Supporting Multiscript Matching in Database Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_21openalex-snapshot
Increased Bit-Parallelism for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_44openalex-snapshot
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
inferred← citeshttps://doi.org/10.1007/978-3-540-39644-4_50openalex-snapshot
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes
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-39984-1_6openalex-snapshot
Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_8openalex-snapshot
Bit-Parallel Approximate String Matching Algorithms with Transposition
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-642-03547-0_4openalex-snapshot
Study of Bit-Parallel Approximate Parameterized String Matching Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_21openalex-snapshot
Indexing Variable Length Substrings for Exact and Approximate Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_30openalex-snapshot
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-22456-0_29openalex-snapshot
An Error Location and Diagnosis Method for Communication Test of High-Speed Railway Train Control System Based on String Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_363-2openalex-snapshot
Approximate String Matching
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/bfb0054334openalex-snapshot
Fast two-dimensional approximate pattern 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/s00453-004-1108-zopenalex-snapshot
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
inferred← citeshttps://doi.org/10.1007/s00453-021-00906-8openalex-snapshot
Matching Regular Expressions on uncertain data
inferred← citeshttps://doi.org/10.1007/s00778-007-0062-1openalex-snapshot
Reference-based indexing for metric spaces with costly distance measures
inferred← citeshttps://doi.org/10.1007/s00778-012-0270-1openalex-snapshot
Approximate regional sequence matching for genomic databases
inferred← citeshttps://doi.org/10.1007/s007780200064openalex-snapshot
Database indexing for large DNA and protein sequence collections
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/s11280-017-0518-1openalex-snapshot
ACRES: efficient query answering on large compressed sequences
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.026openalex-snapshot
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
inferred← citeshttps://doi.org/10.1016/j.jbi.2006.06.001openalex-snapshot
Using MEDLINE as a knowledge source for disambiguating abbreviations and acronyms in full-text biomedical journal articles
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.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.2004.08.006openalex-snapshot
Bit-parallel approximate string matching algorithms with transposition
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.10.002openalex-snapshot
A programmable array processor architecture for flexible approximate string matching algorithms
inferred← citeshttps://doi.org/10.1016/j.parco.2015.11.001openalex-snapshot
Bit-parallel approximate pattern matching: Kepler GPU versus Xeon Phi
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.03.004openalex-snapshot
Processor array architectures for flexible approximate string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.042openalex-snapshot
Fast and compact regular expression matching
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/s0020-0190(99)00121-0openalex-snapshot
Very fast and simple approximate string matching
inferred← citeshttps://doi.org/10.1016/s0031-3203(01)00179-0openalex-snapshot
Finding approximate palindromes in strings
inferred← citeshttps://doi.org/10.1016/s0065-2458(03)57004-8openalex-snapshot
Adding Compression to Next-Generation Text Retrieval Systems
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00032-7openalex-snapshot
Approximate string matching on Ziv–Lempel 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/nbt1202-1269openalex-snapshot
Patent searches for genetic sequences: How to retrieve relevant records from patented sequence databases
inferred← citeshttps://doi.org/10.1051/shsconf/202214403018openalex-snapshot
Review on String-Matching Algorithm
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1088/1742-6596/835/1/012004openalex-snapshot
The implementation of bit-parallelism for DNA sequence alignment
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/bioinformatics/btag244openalex-snapshot
Sassy: fuzzy searching DNA sequences using SIMD
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts505openalex-snapshot
RazerS 3: Faster, fully sensitive read mapping
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.1101/133157openalex-snapshot
LEAP: A Generalization of the Landau-Vishkin Algorithm with Custom Gap Penalties
inferred← citeshttps://doi.org/10.1109/2.881693openalex-snapshot
Compression: a key for next-generation text retrieval systems
inferred← citeshttps://doi.org/10.1109/aina.2005.185openalex-snapshot
Fast Similarity Search in String Databases
inferred← citeshttps://doi.org/10.1109/bibe.2003.1188974openalex-snapshot
Effective indexing and filtering for similarity search in large biosequence databases
inferred← citeshttps://doi.org/10.1109/bibe.2005.13openalex-snapshot
Approximate Global Alignment of Sequences
inferred← citeshttps://doi.org/10.1109/dasfaa.2003.1192395openalex-snapshot
Approximate string matching in DNA sequences
inferred← citeshttps://doi.org/10.1109/fpt.2003.1275733openalex-snapshot
A pattern-matching co-processor for network intrusion detection systems
inferred← citeshttps://doi.org/10.1109/grc.2007.140openalex-snapshot
Automatic Classification of Graphs by Symbolic Histograms
inferred← citeshttps://doi.org/10.1109/icde.2008.4497435openalex-snapshot
Fast Indexes and Algorithms for Set Similarity Selection Queries
inferred← citeshttps://doi.org/10.1109/iceeict.2014.6919125openalex-snapshot
Optimizing DNA sequences using Tetra-nucleotide RankList
inferred← citeshttps://doi.org/10.1109/icinfa.2006.374137openalex-snapshot
Searching Genomic Databases using the Prime Factor Filter
inferred← citeshttps://doi.org/10.1109/icpads.2015.77openalex-snapshot
High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs
inferred← citeshttps://doi.org/10.1109/icppw.2005.15openalex-snapshot
A Programmable Array Processor Architecture for Flexible Approximate String Matching Algorithms
inferred← citeshttps://doi.org/10.1109/intech.2012.6457802openalex-snapshot
Baeza-Yates and Navarro approximate string matching for spam filtering
inferred← citeshttps://doi.org/10.1109/iros.2003.1249743openalex-snapshot
Environmental modeling with fingerprint sequences for topological global localization
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206037openalex-snapshot
Automatic synchronization of speech transcript and slides in presentation
inferred← citeshttps://doi.org/10.1109/robot.2001.932841openalex-snapshot
Deriving and matching image fingerprint sequences for mobile robot localization
inferred← citeshttps://doi.org/10.1109/sbac-pad.2014.37openalex-snapshot
Bit-Parallel Approximate Pattern Matching on the Xeon Phi Coprocessor
inferred← citeshttps://doi.org/10.1109/scac.2014.23openalex-snapshot
Hierarchical Parallelism of Bit-Parallel Algorithm for Approximate String Matching on GPUs
inferred← citeshttps://doi.org/10.1109/spire.2000.878193openalex-snapshot
Fast multipattern search algorithms for intrusion detection
inferred← citeshttps://doi.org/10.1109/spire.2000.878198openalex-snapshot
Bit-parallel approach to approximate string matching in compressed texts
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.2021.3106311openalex-snapshot
An FPGA Based Energy-Efficient Read Mapper With Parallel Filtering and In-Situ Verification
inferred← citeshttps://doi.org/10.1109/tkde.2006.1599383openalex-snapshot
q-gram matching using tree models
inferred← citeshttps://doi.org/10.1109/tkde.2006.66openalex-snapshot
q-gram matching using tree models
inferred← citeshttps://doi.org/10.1109/tpds.2014.8openalex-snapshot
An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing
inferred← citeshttps://doi.org/10.1109/tpds.2016.2645222openalex-snapshot
Parallelizing Exact and Approximate String Matching via Inclusive Scan on a GPU
inferred← citeshttps://doi.org/10.1137/1.9781611972870.8openalex-snapshot
Faster Filters for Approximate String Matching
inferred← citeshttps://doi.org/10.1142/s0218213005002405openalex-snapshot
VECTOR SPACE INDEXING FOR BIOSEQUENCE SIMILARITY SEARCHES
inferred← citeshttps://doi.org/10.1145/1005813.1041513openalex-snapshot
Average-optimal single and multiple approximate string matching
inferred← citeshttps://doi.org/10.1145/1064546.1180617openalex-snapshot
Increased bit-parallelism for approximate and multiple string matching
inferred← citeshttps://doi.org/10.1145/1559845.1559891openalex-snapshot
Incremental maintenance of length normalized indexes for approximate string matching
inferred← citeshttps://doi.org/10.1145/1963190.1963191openalex-snapshot
Indexing methods for approximate dictionary searching
inferred← citeshttps://doi.org/10.1145/2381716.2381798openalex-snapshot
Overlapping repetitions in weighted sequence
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/348751.348754openalex-snapshot
Fast and flexible word searching on compressed text
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/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/564691.564738openalex-snapshot
Mining long sequential patterns in a noisy environment
inferred← citeshttps://doi.org/10.1146/annurev-genom-090413-025358openalex-snapshot
Alignment of Next-Generation Sequencing Reads
inferred← citeshttps://doi.org/10.11606/d.3.2006.tde-18042007-155841openalex-snapshot
Aplicação de autômatos finitos nebulosos no reconhecimento aproximado de cadeias.
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.1504/ijdmb.2014.062145openalex-snapshot
Applying Agrep to r-NSA to solve multiple sequences approximate matching
inferred← citeshttps://doi.org/10.1504/ijitst.2016.080407openalex-snapshot
Encrypted similarity search feasible of keyword index search schemes
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11386openalex-snapshot
Hi, How Can I Help You?: Automating Enterprise IT Support Help Desks
inferred← citeshttps://doi.org/10.17169/refubium-11863openalex-snapshot
Indices and Applications in High-Throughput Sequencing
inferred← citeshttps://doi.org/10.21533/scjournal.v2i2.24openalex-snapshot
Multiple Methods for Genome Filtering
inferred← citeshttps://doi.org/10.3233/fun-2006-72402openalex-snapshot
On-line Approximate String Matching in Natural Language
inferred← citeshttps://doi.org/10.3233/jifs-223021openalex-snapshot
Statistical analysis of lexemes generated in ‘C’ programming using fuzzy automation
inferred← citeshttps://doi.org/10.32657/10356/2470openalex-snapshot
Framework forensic examination computer systems
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2010.03610openalex-snapshot
Efficient Algorithm for Sequence Similarity Search Based on Reference Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1412.3688openalex-snapshot
Run-Length Encoded Nondeterministic KMP and Suffix Automata
inferred← citeshttps://doi.org/10.5281/zenodo.1415613openalex-snapshot
Cubyhum: A Fully Operational "Query By Humming" System.
inferred← citeshttps://doi.org/10.5353/th_b2935059openalex-snapshot
Approximate string matching in DNA sequences
inferred← citeshttps://doi.org/10.5555/1182635.1164205openalex-snapshot
Reference-based indexing of sequence databases
inferred← citeshttps://doi.org/10.5555/314613.314827openalex-snapshot
Approximate string matching: a simpler faster algorithm
inferred← citeshttps://doi.org/10.5753/jbcs.2024.4236openalex-snapshot
BWBEV: A Bitwise Query Processing Algorithm for Approximate Prefix Search
inferred← citeshttps://doi.org/10.5821/dissertation-2117-113295openalex-snapshot
Efficient approximate string matching techniques for sequence alignment
inferred← citeshttps://doi.org/10.5897/sre10.895openalex-snapshot
Efficient bit-parallel multi-patterns approximate string matching algorithms
inferred← citeshttps://doi.org/10.70675/4704dfcfz705ez4908zb294z532fb4586e26openalex-snapshot
Recherche et détection des patterns d'attaques dans les réseaux IP à hauts débits
inferred← citeshttps://doi.org/10.70675/c3c14cc5zb13ez4bdbza2cdz863309627394openalex-snapshot
Complexité de la recherche de motifs dans un texte aléatoire
inferred← citeshttps://doi.org/10.9735/0975-2927.1.2.1-4openalex-snapshot
PREDICTION OF METHANOBACTERIUM USING SUFFIXTREE
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.