[Computational-biology] Motif-Finding Problems Complexities

Mourad Elloumi via comp-bio%40net.bio.net (by mourad12345678 from yahoo.com)
Tue May 5 20:12:01 EST 2009

Dear All,

We are seeking the complexities of the following Motif-Finding Problems :  

 1. Planted (l,d)-Motif Problem (PMP)
 2. Extended (l,d)-Motif Problem (ExMP) 
 3. Further Extended (l,d)-Motif Problem (FExMP)
 4. Edited Motif Search Problem (EdMP)
 5. Simple Motifs Search Problem (SMS)

Do you know have any references on these complexities? Thanks.

Best regards,
E.Mail:Mourad.Elloumi from fsegt.rnu.tn
URL   :www.esstt.rnu.tn/utic/english/memb_elloumi.html


More information about the Comp-bio mailing list