Incremental discovery of irredundant motif bases in time O(|Σ|n2 log n)

Authors:
Alberto Apostolico;Claudia Tagliacollo
Affiliations:
Georgia Institute of Technology and Università di Padova;Georgia Institute of Technology and Università di Padova
Venue:
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Year:
2007

Pattern matching algorithms

Pattern matching algorithms
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
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Algorithmic techniques in computational genomics

Algorithmic techniques in computational genomics
Bases of Motifs for Generating Repeated Patterns with Wild Cards

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimal offline extraction of irredundant motif bases

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Hi-index	0.00