On the public citation graph
Spelling approximate repeated or common motifs using a suffix tree
0 signed · 225 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/prot.340070105openalex-snapshot
An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
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_6openalex-snapshot
Fast identification of approximately matching substrings
inferredcites →https://doi.org/10.1007/3-540-60044-2_33openalex-snapshot
Fast approximate matching using suffix trees
inferredcites →https://doi.org/10.1007/3-540-61258-0_15openalex-snapshot
A double combinatorial approach to discovering patterns in biological sequences
inferredcites →https://doi.org/10.1007/bf01185432openalex-snapshot
A sublinear algorithm for approximate keyword searching
inferredcites →https://doi.org/10.1007/bf02459500openalex-snapshot
Pattern recognition in several sequences: Consensus and alignment
inferredcites →https://doi.org/10.1007/bfb0029808openalex-snapshot
Approximate string-matching over suffix trees
inferredcites →https://doi.org/10.1016/0020-0190(81)90024-7openalex-snapshot
An optimal algorithm for computing the repetitions in a word
inferredcites →https://doi.org/10.1016/0022-2836(85)90262-1openalex-snapshot
Rigorous pattern-recognition methods for DNA sequences
inferredcites →https://doi.org/10.1016/s0304-3975(96)00137-5openalex-snapshot
Multiple sequence comparison — a peptide matching approach
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1093/nar/14.22.9095openalex-snapshot
Multiple sequence alignment by consensus
inferredcites →https://doi.org/10.1093/nar/22.3.404openalex-snapshot
A fast word search algorithm for the representation of sequence similarity in genomic DNA
inferredcites →https://doi.org/10.1109/hicss.1994.323593openalex-snapshot
Generalized suffix trees for biological sequence data: applications and implementation
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
inferredcites →https://doi.org/10.1145/279069.279120openalex-snapshot
Identifying satellites in nucleic acid sequences
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction 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/9780470397428.ch12openalex-snapshot
Neighborhood Profile Search for Motif Refinement
inferred← citeshttps://doi.org/10.1002/9780470892107.ch18openalex-snapshot
Motif Finding Algorithms in Biological Sequences
inferred← citeshttps://doi.org/10.1002/9780470892107.ch2openalex-snapshot
Efficient Restricted‐Case Algorithms for Problems in Computational Biology
inferred← citeshttps://doi.org/10.1002/9780470892107.ch8openalex-snapshot
Recent Advances in Weighted DNA Sequences
inferred← citeshttps://doi.org/10.1002/9781118617151.ch13openalex-snapshot
Comparing, Ranking, and Filtering Motifs with Character Classes: Application to Biological Sequences Analysis
inferred← citeshttps://doi.org/10.1006/jmbi.2000.3576openalex-snapshot
Inferring regulatory elements from a whole genome. an analysis of Helicobacter pyloriσ80 family of promoter signals
inferred← citeshttps://doi.org/10.1007/11557067_22openalex-snapshot
Generalized Planted (l,d)-Motif Problem with Negative Set
inferred← citeshttps://doi.org/10.1007/11682462_69openalex-snapshot
RISOTTO: Fast Extraction of Motifs with Mismatches
inferred← citeshttps://doi.org/10.1007/3-540-44743-1_48openalex-snapshot
Parallel Algorithms for the Analysis of Biological Sequences
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_21openalex-snapshot
Pattern Discovery in RNA Secondary Structure Using Affix Trees
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-45784-4_11openalex-snapshot
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_21openalex-snapshot
On the Parameterized Intractability of Closest Substring and Related Problems
inferred← citeshttps://doi.org/10.1007/978-1-4020-5690-1_19openalex-snapshot
Bioinformatics: A New Approach for the Challenges of Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4419-5913-3_3openalex-snapshot
Searching Maximal Degenerate Motifs Guided by a Compact Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-18174-1_16openalex-snapshot
Efficient Algorithms for Finding Edit-Distance Based Motifs
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_9openalex-snapshot
Frequent Pattern Mining with Non-overlapping Inversions
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_37openalex-snapshot
Efficient Extraction of Structured Motifs Using Box-Links
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_40openalex-snapshot
New Algorithms for Finding Monad Patterns in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_41openalex-snapshot
Motif Extraction from Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-32280-1_7openalex-snapshot
Using Expression Data to Discover RNA and DNA Regulatory Sequence Motifs
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_20openalex-snapshot
Complexity of Approximating Closest Substring Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_5openalex-snapshot
Toward Optimal Motif Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-540-70600-7_35openalex-snapshot
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-73731-5_3openalex-snapshot
Comparison of Simple Encoding Schemes in GA’s for the Motif Finding Problem: Preliminary Results
inferred← citeshttps://doi.org/10.1007/978-3-540-79450-9_21openalex-snapshot
Identification of Transcription Factor Binding Sites in Promoter Regions by Modularity Analysis of the Motif Co-occurrence Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-00727-9_15openalex-snapshot
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
inferred← citeshttps://doi.org/10.1007/978-3-642-02481-8_154openalex-snapshot
Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-04020-7_42openalex-snapshot
MotifMiner: A Table Driven Greedy Algorithm for DNA Motif Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_28openalex-snapshot
Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size
inferred← citeshttps://doi.org/10.1007/978-3-642-16248-0_37openalex-snapshot
A Frequent Pattern Mining Method for Finding Planted (l, d)-motifs of Unknown Length
inferred← citeshttps://doi.org/10.1007/978-3-642-19914-1_24openalex-snapshot
An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-23199-5_40openalex-snapshot
Unsupervised Discovery of Motifs under Amplitude Scaling and Shifting in Time Series Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-24043-0_61openalex-snapshot
Experimental Evaluation of Fast Solution Algorithms for the Simple Motif Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29038-1_34openalex-snapshot
Efficient Algorithm for Mining Correlated Protein-DNA Binding Cores
inferred← citeshttps://doi.org/10.1007/978-3-642-30191-9_1openalex-snapshot
Trie-based Apriori Motif Discovery Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-35686-5_17openalex-snapshot
A Faster Algorithm for Motif Finding in Sequences from ChIP-Seq Data
inferred← citeshttps://doi.org/10.1007/978-3-642-55195-6_24openalex-snapshot
Accelerating String Matching on MIC Architecture for Motif Extraction
inferred← citeshttps://doi.org/10.1007/978-3-662-48616-0_17openalex-snapshot
Mining and Querying Process Change Information Based on Change Trees
inferred← citeshttps://doi.org/10.1007/978-81-322-1094-8_8openalex-snapshot
Regulatory Motif Identification in Biological Sequences: An Overview of Computational Methodologies
inferred← citeshttps://doi.org/10.1007/s00493-006-0011-4openalex-snapshot
On The Parameterized Intractability Of Motif Search Problems*
inferred← citeshttps://doi.org/10.1007/s00778-014-0370-1openalex-snapshot
ACME: A scalable parallel system for extracting frequent patterns from a very long sequence
inferred← citeshttps://doi.org/10.1007/s10877-005-0677-yopenalex-snapshot
High-Performance Exact Algorithms For Motif Search
inferred← citeshttps://doi.org/10.1007/s11227-014-1180-3openalex-snapshot
Parallelizing exact motif finding algorithms on multi-core
inferred← citeshttps://doi.org/10.1007/s11786-013-0165-6openalex-snapshot
An Efficient Algorithm to Identify DNA Motifs
inferred← citeshttps://doi.org/10.1007/s12038-007-0086-0openalex-snapshot
Parsing regulatory DNA: General tasks, techniques, and the PhyloGibbs approach
inferred← citeshttps://doi.org/10.1016/b978-0-12-809633-8.20482-2openalex-snapshot
Algorithms for Strings and Sequences: Searching Motifs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.003openalex-snapshot
Hard problems in similarity searching
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.04.051openalex-snapshot
Local search and suffix tree for car-sequencing problem with colors
inferred← citeshttps://doi.org/10.1016/j.ijcce.2024.07.004openalex-snapshot
Trie-PMS8: A trie-tree based robust solution for planted motif search problem
inferred← citeshttps://doi.org/10.1016/j.ins.2013.03.023openalex-snapshot
An improved voting algorithm for planted (l,d) motif search
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.03.004openalex-snapshot
String analysis by sliding positioning strategy
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.018openalex-snapshot
Algorithms for extracting motifs from biological weighted sequences
inferred← citeshttps://doi.org/10.1016/j.micpro.2016.06.008openalex-snapshot
Parallel implementation of quorum planted (ℓ, d ) motif search on multi-core/many-core platforms
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.12.009openalex-snapshot
Discovering common recurrent patterns in multiple strings over large alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.017openalex-snapshot
Detection of subtle variations as consensus motifs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.020openalex-snapshot
Suffix tree characterization of maximal motifs in biological sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.04.012openalex-snapshot
Motif trie: An efficient text index for pattern discovery with don't cares
inferred← citeshttps://doi.org/10.1016/s0167-739x(02)00057-2openalex-snapshot
A parallel algorithm for pattern discovery in biological sequences
inferred← citeshttps://doi.org/10.1016/s0923-2508(99)00115-1openalex-snapshot
Promoter sequences and algorithmical methods for identifying them
inferred← citeshttps://doi.org/10.1023/b:genp.0000023688.42515.92openalex-snapshot
Particle Swarm Optimisation for Protein Motif Discovery
inferred← citeshttps://doi.org/10.1049/iet-spr.2014.0356openalex-snapshot
Iterative sequential Monte Carlo algorithm for motif discovery
inferred← citeshttps://doi.org/10.1051/medsci/2002182237openalex-snapshot
L’annotationin silicodes séquences génomiques
inferred← citeshttps://doi.org/10.1080/18756891.2011.9727851openalex-snapshot
A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
inferred← citeshttps://doi.org/10.1089/106652700750050826openalex-snapshot
Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.1214openalex-snapshot
Computation of Repetitions and Regularities of Biologically Weighted Sequences
inferred← citeshttps://doi.org/10.1089/cmb.2015.0238openalex-snapshot
ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s207openalex-snapshot
An algorithm for finding signals of unknown length in DNA sequences
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s5openalex-snapshot
An efficient algorithm for finding short approximate non-tandem repeats
inferred← citeshttps://doi.org/10.1093/bioinformatics/18.8.1084openalex-snapshot
Protein motif extraction with neuro-fuzzy optimization
inferred← citeshttps://doi.org/10.1093/bioinformatics/bti1115openalex-snapshot
Finding exact optimal motifs in matrix representation by partitioning
inferred← citeshttps://doi.org/10.1093/bioinformatics/btp188openalex-snapshot
Efficient exact motif discovery
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq677openalex-snapshot
SlideSort: all pairs similarity search for short reads
inferred← citeshttps://doi.org/10.1093/bioinformatics/btr459openalex-snapshot
Tree-structured algorithm for long weak motif discovery
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz198openalex-snapshot
SArKS: de novo discovery of gene expression regulatory motif sites and domains by suffix array kernel smoothing
inferred← citeshttps://doi.org/10.1093/nar/gkf669openalex-snapshot
Discovery of novel transcription factor binding sites by statistical overrepresentation
inferred← citeshttps://doi.org/10.1093/nar/gkg653;openalex-snapshot
Correcting errors in shotgun sequences
inferred← citeshttps://doi.org/10.1093/nar/gkl372openalex-snapshot
Computational identification of transcriptional regulatory elements in DNA sequence
inferred← citeshttps://doi.org/10.1101/047357openalex-snapshot
AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments
inferred← citeshttps://doi.org/10.1101/133934openalex-snapshot
SArKS: de novo discovery of gene expression regulatory motifs and domains by suffix array kernel smoothing
inferred← citeshttps://doi.org/10.1108/ec-02-2020-0108openalex-snapshot
Discovering regulatory motifs of genetic networks using the indexing-tree based algorithm: a parallel implementation
inferred← citeshttps://doi.org/10.1109/aiccsa.2009.5069407openalex-snapshot
Performance and analysis of modified voting algorithm for planted motif search
inferred← citeshttps://doi.org/10.1109/bibe.2005.12openalex-snapshot
An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites
inferred← citeshttps://doi.org/10.1109/bibm.2009.41openalex-snapshot
Fast Motif Selection for Biological Sequences
inferred← citeshttps://doi.org/10.1109/bibm.2015.7359740openalex-snapshot
Improved algorithms for finding edit distance based motifs
inferred← citeshttps://doi.org/10.1109/bibmw.2010.5703767openalex-snapshot
Using graph modularity analysis to identify transcription factor binding sites
inferred← citeshttps://doi.org/10.1109/bracis.2016.041openalex-snapshot
Discovery Biological Motifs Using Heuristics Approaches
inferred← citeshttps://doi.org/10.1109/ccwc.2019.8666485openalex-snapshot
Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing
inferred← citeshttps://doi.org/10.1109/cec.2008.4631120openalex-snapshot
An Estimation of Distribution Algorithm for Motif Discovery
inferred← citeshttps://doi.org/10.1109/cibcb.2011.5948452openalex-snapshot
Tackling the challenging motif problem through hybrid particle swarm optimized alignment clustering
inferred← citeshttps://doi.org/10.1109/csb.2003.1227414openalex-snapshot
Finding higher order motifs under the levenshtein measure
inferred← citeshttps://doi.org/10.1109/dexa.2014.24openalex-snapshot
A Consensus Algorithm for Simple Motifs Finding
inferred← citeshttps://doi.org/10.1109/eit.2019.8834006openalex-snapshot
qSMF: an Approximate Algorithm for Quotum Planted Motif Search on ChIP-Seq Data
inferred← citeshttps://doi.org/10.1109/fitme.2009.128openalex-snapshot
Closed Structured Patterns and Motifs Mining without Candidate Maintenance
inferred← citeshttps://doi.org/10.1109/globalsip.2013.6736807openalex-snapshot
MetaPar: Metagenomic sequence assembly via iterative reclassification
inferred← citeshttps://doi.org/10.1109/hpcc.2009.65openalex-snapshot
On Mining Repeating Pattern with Gap Constraint
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00031openalex-snapshot
PDMF: Parallel Dictionary Motif Finder on Multicore and GPU
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547161openalex-snapshot
An efficient multicore implementation of planted motif problem
inferred← citeshttps://doi.org/10.1109/hpcsim.2011.5999825openalex-snapshot
High performance implementation of planted motif problem using suffix trees
inferred← citeshttps://doi.org/10.1109/iccabs.2012.6182627openalex-snapshot
PMS6: A fast algorithm for motif discovery
inferred← citeshttps://doi.org/10.1109/iccabs.2013.6629205openalex-snapshot
PMS6MC: A multicore algorithm for motif discovery
inferred← citeshttps://doi.org/10.1109/icces48960.2019.9068158openalex-snapshot
Enhancing Recursive Brute Force Algorithm with Static Memory Allocation: Solving Motif Finding Problem as a Case Study
inferred← citeshttps://doi.org/10.1109/icde.2012.86openalex-snapshot
Predicting Approximate Protein-DNA Binding Cores Using Association Rule Mining
inferred← citeshttps://doi.org/10.1109/icdmw.2007.121openalex-snapshot
An Efficient Technique for Mining Approximately Frequent Substring Patterns
inferred← citeshttps://doi.org/10.1109/icdmw.2007.14openalex-snapshot
WC-Clustering: Hierarchical Clustering Using the Weighted Confidence Affinity Measure
inferred← citeshttps://doi.org/10.1109/icicv50876.2021.9388504openalex-snapshot
DCT based Enhanced Tchebichef Moment using Huffman Encoding Algorithm (ETMH)
inferred← citeshttps://doi.org/10.1109/isda.2011.6121801openalex-snapshot
On the use of algorithms to discover motifs in DNA sequences
inferred← citeshttps://doi.org/10.1109/ispdc.2014.27openalex-snapshot
Scalable Multi-core Implementation for Motif Finding Problem
inferred← citeshttps://doi.org/10.1109/itw.2013.6691312openalex-snapshot
MCUIUC — A new framework for metagenomic read compression
inferred← citeshttps://doi.org/10.1109/rice.2018.8509078openalex-snapshot
Exact Planted (l, d) Motif Search Algorithms: A Review
inferred← citeshttps://doi.org/10.1109/sitis.2007.104openalex-snapshot
Extraction of Ambiguous Sequential Patterns with Least Minimum Generalization from Mismatch Clusters
inferred← citeshttps://doi.org/10.1109/tcbb.2006.16openalex-snapshot
An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences
inferred← citeshttps://doi.org/10.1109/tcbb.2007.70241openalex-snapshot
Fast and Practical Algorithms for Planted (l, d) Motif Search
inferred← citeshttps://doi.org/10.1109/tcbb.2009.25openalex-snapshot
A Cluster Refinement Algorithm for Motif Discovery
inferred← citeshttps://doi.org/10.1109/tcbb.2013.60openalex-snapshot
Modeling Associated Protein-DNA Pattern Discovery with Unified Scores
inferred← citeshttps://doi.org/10.1109/tcbb.2014.2306842openalex-snapshot
Improved Exact Enumerative Algorithms for the Planted ( $l$ , $d$ )-Motif Search Problem
inferred← citeshttps://doi.org/10.1109/tcbb.2020.3024222openalex-snapshot
EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs
inferred← citeshttps://doi.org/10.1109/tcbb.2024.3404136openalex-snapshot
An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence Datasets
inferred← citeshttps://doi.org/10.1109/tevc.2011.2171972openalex-snapshot
Memetic Algorithms for De Novo Motif Discovery
inferred← citeshttps://doi.org/10.1109/tkde.2007.1001openalex-snapshot
An Exact Data Mining Method for Finding Center Strings and All Their Instances
inferred← citeshttps://doi.org/10.1128/mmbr.00037-08openalex-snapshot
Mechanisms and Evolution of Control Logic in Prokaryotic Transcriptional Regulation
inferred← citeshttps://doi.org/10.1142/9781848162525_0016openalex-snapshot
GAMOT: AN EFFICIENT GENETIC ALGORITHM FOR FINDING CHALLENGING MOTIFS IN DNA SEQUENCES
inferred← citeshttps://doi.org/10.1142/9781860947292_0011openalex-snapshot
AN EFFICIENT ALGORITHM FOR STRING MOTIF DISCOVERY
inferred← citeshttps://doi.org/10.1142/9781860947322_0024openalex-snapshot
EXACT ALGORITHMS FOR MOTIF SEARCH
inferred← citeshttps://doi.org/10.1142/9781860947322_0026openalex-snapshot
VOTING ALGORITHMS FOR DISCOVERING LONG MOTIFS
inferred← citeshttps://doi.org/10.1142/9781860947322_0027openalex-snapshot
A HIGHLY SCALABLE ALGORITHM FOR THE EXTRACTION OF CIS-REGULATORY REGIONS
inferred← citeshttps://doi.org/10.1142/9781860947995_0006openalex-snapshot
SUBTLE MOTIF DISCOVERY FOR DETECTION OF DNA REGULATORY SITES
inferred← citeshttps://doi.org/10.1142/9781860947995_0010openalex-snapshot
AN EFFICIENT BICLUSTERING ALGORITHM FOR FINDING GENES WITH SIMILAR PATTERNS IN TIME-SERIES EXPRESSION DATA
inferred← citeshttps://doi.org/10.1142/s0219720006001692openalex-snapshot
ALGORITHMS FOR CHALLENGING MOTIF PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0219720014500279openalex-snapshot
IncMD: Incremental trie-based structural motif discovery algorithm
inferred← citeshttps://doi.org/10.1145/1531780.1531782openalex-snapshot
An efficient algorithm for planted structured motif extraction
inferred← citeshttps://doi.org/10.1145/1722024.1722048openalex-snapshot
Improving motif refinement using hybrid expectation maximization and random projection
inferred← citeshttps://doi.org/10.1145/1830483.1830515openalex-snapshot
Challenges rising from learning motif evaluation functions using genetic programming
inferred← citeshttps://doi.org/10.1145/2505515.2505575openalex-snapshot
Parallel motif extraction from very long sequences
inferred← citeshttps://doi.org/10.1145/332306.332553openalex-snapshot
Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification
inferred← citeshttps://doi.org/10.1145/369133.369172openalex-snapshot
Finding motifs using random projections
inferred← citeshttps://doi.org/10.1145/565196.565222openalex-snapshot
Finding motifs in the twilight zone
inferred← citeshttps://doi.org/10.1145/967900.967932openalex-snapshot
A parallel algorithm for the extraction of structured motifs
inferred← citeshttps://doi.org/10.1145/974614.974630openalex-snapshot
From profiles to patterns and back again
inferred← citeshttps://doi.org/10.1155/2014/849743openalex-snapshot
New Strategies for Evaluation and Analysis of SELEX Experiments
inferred← citeshttps://doi.org/10.1155/2015/853461openalex-snapshot
An Affinity Propagation-Based DNA Motif Discovery Algorithm
inferred← citeshttps://doi.org/10.11591/ijeecs.v27.i2.pp1109-1118openalex-snapshot
A survey of exact motif finding algorithms
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.11648/j.cbb.20160401.11openalex-snapshot
A Comparative Analysis of Motif Discovery Algorithms
inferred← citeshttps://doi.org/10.1186/1471-2105-10-321openalex-snapshot
Discovering multiple realistic TFBS motifs based on a generalized model
inferred← citeshttps://doi.org/10.1186/1471-2105-10-s1-s13openalex-snapshot
DNA motif alignment by evolving a population of Markov chains
inferred← citeshttps://doi.org/10.1186/1471-2105-11-249openalex-snapshot
Gene bi-targeting by viral and human miRNAs
inferred← citeshttps://doi.org/10.1186/1471-2105-11-s11-s8openalex-snapshot
RecMotif: a novel fast algorithm for weak motif discovery
inferred← citeshttps://doi.org/10.1186/1471-2105-11-s12-s6openalex-snapshot
WordSeeker: concurrent bioinformatics software for discovering genome-wide patterns and word-based genomic signatures
inferred← citeshttps://doi.org/10.1186/1471-2105-11-s8-s1openalex-snapshot
Efficient motif finding algorithms for large-alphabet inputs
inferred← citeshttps://doi.org/10.1186/1471-2105-13-s17-s10openalex-snapshot
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
inferred← citeshttps://doi.org/10.1186/1471-2105-14-227openalex-snapshot
A fast weak motif-finding algorithm based on community detection in graphs
inferred← citeshttps://doi.org/10.1186/1471-2105-15-235openalex-snapshot
MoTeX-II: structured MoTif eXtraction from large-scale datasets
inferred← citeshttps://doi.org/10.1186/1471-2105-8-209openalex-snapshot
CRISPR Recognition Tool (CRT): a tool for automatic detection of clustered regularly interspaced palindromic repeats
inferred← citeshttps://doi.org/10.1186/1471-2105-8-s7-s21openalex-snapshot
A survey of DNA motif finding algorithms
inferred← citeshttps://doi.org/10.1186/1471-2164-15-s10-s9openalex-snapshot
HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly
inferred← citeshttps://doi.org/10.1186/1748-7188-1-21openalex-snapshot
EXMOTIF: efficient structured motif extraction
inferred← citeshttps://doi.org/10.1186/1748-7188-4-8openalex-snapshot
A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series
inferred← citeshttps://doi.org/10.1186/1748-7188-6-13openalex-snapshot
GRISOTTO: A greedy approach to improve combinatorial algorithms for motif discovery with prior knowledge
inferred← citeshttps://doi.org/10.1186/1748-7188-7-20openalex-snapshot
Direct vs 2-stage approaches to structured motif finding
inferred← citeshttps://doi.org/10.1186/1756-0500-4-54openalex-snapshot
A speedup technique for (l, d)-motif finding algorithms
inferred← citeshttps://doi.org/10.1186/s12859-017-2005-1openalex-snapshot
Sequence motif finder using memetic algorithm
inferred← citeshttps://doi.org/10.1186/s12859-018-2242-yopenalex-snapshot
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
inferred← citeshttps://doi.org/10.1186/s12864-016-2789-9openalex-snapshot
Efficient sequential and parallel algorithms for finding edit distance based motifs
inferred← citeshttps://doi.org/10.1186/s12864-019-5701-6openalex-snapshot
Novel algorithms for LDD motif search
inferred← citeshttps://doi.org/10.1371/journal.pone.0048442openalex-snapshot
PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search
inferred← citeshttps://doi.org/10.1371/journal.pone.0086044openalex-snapshot
A New Exhaustive Method and Strategy for Finding Motifs in ChIP-Enriched Regions
inferred← citeshttps://doi.org/10.1504/ijbra.2007.011836openalex-snapshot
Efficient composite pattern finding from monad patterns
inferred← citeshttps://doi.org/10.1504/ijbra.2014.062990openalex-snapshot
PMS6: a fast algorithm for motif discovery
inferred← citeshttps://doi.org/10.1504/ijdmb.2006.010856openalex-snapshot
An efficient motif discovery algorithm with unknown motif length and number of binding sites
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/ijdmb.2015.070833openalex-snapshot
TrieAMD: a scalable and efficient apriori motif discovery approach
inferred← citeshttps://doi.org/10.1504/ijkwi.2012.050282openalex-snapshot
Parallel processing for stepwise generalisation method on multi-core PC cluster
inferred← citeshttps://doi.org/10.1587/transinf.2017edp7051openalex-snapshot
Accelerating Weeder: A DNA Motif Search Tool Using the Micron Automata Processor and FPGA
inferred← citeshttps://doi.org/10.17877/de290r-552openalex-snapshot
Algorithms and statistical methods for exact motif discovery
inferred← citeshttps://doi.org/10.2174/1872215611307020006openalex-snapshot
Extraction of Infrequent Simple Motifs from a Finite Set of Sequences using a Lattice Structure
inferred← citeshttps://doi.org/10.22060/eej.2012.42openalex-snapshot
DEVELOPMENT OF AN EFFICIENT HYBRID METHOD FOR MOTIF DISCOVERY IN DNA SEQUENCES
inferred← citeshttps://doi.org/10.2741/3586openalex-snapshot
Computational techniques for motif search
inferred← citeshttps://doi.org/10.32657/10356/64820openalex-snapshot
Effective graph-based algorithms for weak motif discovery in genomic sequences
inferred← citeshttps://doi.org/10.3390/a6040805openalex-snapshot
PMS6MC: A Multicore Algorithm for Motif Discovery
inferred← citeshttps://doi.org/10.3390/s22031204openalex-snapshot
A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose
inferred← citeshttps://doi.org/10.3410/f.732398353.793558893openalex-snapshot
Faculty Opinions recommendation of Sequence motif finder using memetic algorithm.
inferred← citeshttps://doi.org/10.3934/mbe.2019075openalex-snapshot
A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences
inferred← citeshttps://doi.org/10.47749/t/unicamp.2002.235293openalex-snapshot
Um algoritmo para comparação sintatica de genomas baseado na complexidade condicional de Kolmogorov
inferred← citeshttps://doi.org/10.48550/arxiv.1107.1128openalex-snapshot
AISMOTIF-An Artificial Immune System for DNA Motif Discovery
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3717openalex-snapshot
MCUIUC -- A New Framework for Metagenomic Read Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1408.5592openalex-snapshot
HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly
inferred← citeshttps://doi.org/10.48550/arxiv.1604.03081openalex-snapshot
AptaTRACE: Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0205056openalex-snapshot
Parameterized Intractability of Motif Search Problems
inferred← citeshttps://doi.org/10.5120/ijca2015906752openalex-snapshot
Efficient Algorithm for Extracting Complete Repeats from Biological Sequences
inferred← citeshttps://doi.org/10.5281/zenodo.1076645openalex-snapshot
Constraint Based Frequent Pattern Mining Technique For Solving Gcs Problem
inferred← citeshttps://doi.org/10.70675/380b1198z9770z4462z9120z76fc9c82518copenalex-snapshot
MiRNA and co : methodologically exploring the world of small RNAs
showing the first 200 of 204 · page through all 204
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.