Finding Higher Order Motifs under the Levenshtein Measure

Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification

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

Combinatorial Approaches to Finding Subtle Signals in DNA Sequences

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology

Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics

Spelling Approximate Repeated or Common Motifs Using a Suffix Tree

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics

Finding Higher Order Motifs under the Levenshtein Measure

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics