RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Finding motifs using random projections
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Finding motifs in the twilight zone
Proceedings of the sixth annual international conference on Computational biology
A parallel algorithm for pattern discovery in biological sequences
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Parallel Algorithms for the Analysis of Biological Sequences
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Using Suffix Trees for Gapped Motif Discovery
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Finding Higher Order Motifs under the Levenshtein Measure
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A parallel algorithm for the extraction of structured motifs
Proceedings of the 2004 ACM symposium on Applied computing
Particle Swarm Optimisation for Protein Motif Discovery
Genetic Programming and Evolvable Machines
Hard problems in similarity searching
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Fast String Kernels using Inexact Matching for Protein Sequences
The Journal of Machine Learning Research
An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
An Exact Data Mining Method for Finding Center Strings and All Their Instances
IEEE Transactions on Knowledge and Data Engineering
Fast and Practical Algorithms for Planted (l, d) Motif Search
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient composite pattern finding from monad patterns
International Journal of Bioinformatics Research and Applications
An efficient motif discovery algorithm with unknown motif length and number of binding sites
International Journal of Data Mining and Bioinformatics
Detection of subtle variations as consensus motifs
Theoretical Computer Science
An efficient algorithm for planted structured motif extraction
Proceedings of the 1st ACM workshop on Breaking frontiers of computational biology
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Suffix tree characterization of maximal motifs in biological sequences
Theoretical Computer Science
Hard problems in similarity searching
Discrete Applied Mathematics
Improving motif refinement using hybrid expectation maximization and random projection
ISB '10 Proceedings of the International Symposium on Biocomputing
Pattern discovery in RNA secondary structure using affix trees
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Comparison of simple encoding schemes in GA's for the motif finding problem: preliminary results
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
MotifMiner: a table driven greedy algorithm for DNA motif mining
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Challenges rising from learning motif evaluation functions using genetic programming
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Speeding up exact motif discovery by bounding the expected clump size
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
A Cluster Refinement Algorithm for Motif Discovery
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A frequent pattern mining method for finding planted (l, d)-motifs of unknown length
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Unsupervised discovery of motifs under amplitude scaling and shifting in time series databases
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Generalized planted (l,d)-motif problem with negative set
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
RISOTTO: fast extraction of motifs with mismatches
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Efficient algorithm for mining correlated Protein-DNA binding cores
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Trie-based apriori motif discovery approach
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Parallel processing for stepwise generalisation method on multi-core PC cluster
International Journal of Knowledge and Web Intelligence
An improved voting algorithm for planted (l,d) motif search
Information Sciences: an International Journal
Parallel motif extraction from very long sequences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
MoTeX: A word-based HPC tool for MoTif eXtraction
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
String analysis by sliding positioning strategy
Journal of Computer and System Sciences
| Hi-index | 0.00 |