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,
Mourad.
______________________________________________________
E.Mail:Mourad.Elloumi from fsegt.rnu.tn
URL :www.esstt.rnu.tn/utic/english/memb_elloumi.html
______________________________________________________