Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Fast discovery of association rules
Advances in knowledge discovery and data mining
Motif discovery without alignment or enumeration (extended abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Clustering gene expression patterns
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
A Double Combinatorial Approach to Discovering Patterns in Biological Sequences
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Algorithmic techniques in computational genomics
Algorithmic techniques in computational genomics
Some Results on Flexible-Pattern Discovery
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
An Output-Sensitive Flexible Pattern Discovery Algorithm
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Statistical Identification of Uniformly Mutated Segments within Repeats
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Efficient Text Mining with Optimized Pattern Discovery
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Visualizing Biosequence Data Using Texture Mapping
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Bases of Motifs for Generating Repeated Patterns with Wild Cards
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time
Theoretical Computer Science
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science
Optimal extraction of motif patterns in 2D
Information Processing Letters
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
Maximal and minimal representations of gapped and non-gapped motifs of a string
Theoretical Computer Science
Suffix tree characterization of maximal motifs in biological sequences
Theoretical Computer Science
On the complexity of finding gapped motifs
Journal of Discrete Algorithms
Extracting approximate patterns
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Mining maximal flexible patterns in a sequence
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Discovery of non-induced patterns from sequences
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Removing artifacts of approximated motifs
ITBAM'11 Proceedings of the Second international conference on Information technology in bio- and medical informatics
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bridging lossy and lossless compression by motif pattern discovery
General Theory of Information Transfer and Combinatorics
Note: Extracting string motif bases for quorum higher than two
Theoretical Computer Science
Incremental discovery of irredundant motif bases in time O(|Σ|n2 log n)
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Optimal offline extraction of irredundant motif bases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
General algorithms for mining closed flexible patterns under various equivalence relations
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Characterization and extraction of irredundant tandem motifs
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Faster variance computation for patterns with gaps
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Boolean satisfiability for sequence mining
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.01 |