An Entropy-Based Position Projection Algorithm for Motif Discovery

Algorithm 1

Input: the dataset , motif length .

Output: the motifs set

(1)    all the substrings length from

(2)     // the candidate set

(3)      // the qualified set

(4)  

(5)   WHILE  queue is not empty DO

(6)       DEQUENE(queue)

(7)      IF   < min_size

(8)          abandon c

(9)      IF  min_size ≤ ≤ max_size

(10)        

(11)      IF > max_size

(12)        select position in

(13)        

(14)        ENQUENE

(15) For each do

(16)   IF  

(17)     

(18) For each   do

(19)   IF  

(20)    remove from

(21)   IF   can increase

(22)    add into

(23)   evaluate the PWM and .

(24) combine the similarly

(25) add formed by of top to .

(26) return