Bases of Motifs for Generating Repeated Patterns with Wild Cards

10.1016/S0076-6879(96)73004-5

10.1017/CBO9780511574931

lawrence, 1993, Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment, Science, 262, 208, 10.1126/science.8211139

10.1002/prot.340070105

marsan, 2000, Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification, J Computational Biology, 7, 345, 10.1089/106652700750050826

10.1093/bioinformatics/17.5.391

10.1145/316542.316550

parida, 2000, Pattern Discovery on Character Sets and Real-Valued Data: Linear Bound on Irredundant Motifs and Efficient Polynomial Time Algorithm, Proc SIAM Symp Discrete Algorithms (SODA)

parida, 2001, An Output-Sensitive Flexible Pattern Discovery Algorithm, Combinatorial Pattern Matching, 131, 10.1007/3-540-48194-X_11

10.1007/3-540-44888-8_24

10.1145/974614.974630

10.1142/9789812778222

10.1089/cmb.1998.5.279

10.1145/135239.135243

10.1089/106652704773416867

10.1145/360825.360855

pisanti, 2004, String Algorithmics, 195

10.1007/978-3-540-45138-9_56

pisanti, 2002, A Basis for Repeated Motifs in Pattern Discovery and Text Mining

10.1073/pnas.84.13.4355

fischer, 1974, String Matching and Other Products, SIAM AMS Complexity of Computation, 113

10.1142/9789812776303_0004

10.1007/BF01758837

10.1186/1471-2105-5-6

10.1016/S0923-2508(99)00115-1