Algorithmic techniques in computational genomics

Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Some Results on Flexible-Pattern Discovery

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time

Theoretical Computer Science

Optimal extraction of motif patterns in 2D

Information Processing Letters

A new approach to sequence representation of proteins in bioinformatics

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence

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