SMILE 1.44 Structured Motif Inference and Evaluation L. Marsan, J. Allali Marsan L, Sagot MF (2001). Algorithms for extracting structured motifs using a suffix-tree with application to promoter and regulatory site consensus identification. J. of Computational Biology, 7:345-360. smile smile perl "smile params" 0 param params seq Sequences File perl "FASTA file\t\t\t$value\\n" 1 8 1 params alphabet Alphabet params perl "Alphabet file\t\t\t/local/gensoft/lib/SMILE/$value\\n" dna.alphabet 2 dna.alphabet dnadeg.alphabet aa-barton.alphabet aa-smiths.alphabet how_many_N perl $alphabet ne "dna.alphabet" 0 Maximum number of N in a motif (degenerated DNA or protein alphabet) perl "Composition in *\t\t$value\\n" 3 params how_many_R perl $alphabet eq "dnadeg.alphabet" 0 Maximum number of R (purine) in a motif (degenerated DNA) perl "Composition in AG\t\t$value\\n" 3 params how_many_Y perl $alphabet eq "dnadeg.alphabet" 0 Maximum number of Y (pyrimidine) in a motif (degenerated DNA) perl "Composition in CT\t\t$value\\n" 3 params quorum Minimum percentage of sequences containing a motif (quorum) perl "Quorum\t\t\t\t$value\\n" params 10 minlen Total min length perl "Total min length\t\t$value\\n" params 11 Length parameters should be close to the expected motifs. A too large range between min/max might produce too many insignificant results. maxlen Total max length perl (defined $value)? "Total max length\t\t$value\\n" : "Total max length\t\t0\\n" params 12 subst Total substitutions perl "Total substitutions\t\t$value\\n" params 13 Too many substitutions (number of substitutions must be smaller than min length) perl defined $subst && ! ($subst < $minlen) boxes perl "Boxes\t\t\t\t1\\n" 1 params 20 shuffling perl "Shufflings\t\t\t\t100\\n" 100 params kmer perl "Size k-mer\t\t\t\t2\\n" 100 params result perl "Output file\t\t\tsmile.result\\n" 1 params resultsfiles smile.result smile.result.shuffle