2009/5/6 Mourad Elloumi <[email protected]>: > > 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.
Hi Mourad, Do you have some references describing these Motif-Finding Problems in more detail? Cheers, Dan. > Best regards, > Mourad. > ______________________________________________________ > > E.Mail:[email protected] > URL :www.esstt.rnu.tn/utic/english/memb_elloumi.html > ______________________________________________________ > > > > > > _______________________________________________ > BBB mailing list > [email protected] > http://www.bioinformatics.org/mailman/listinfo/bbb > _______________________________________________ BBB mailing list [email protected] http://www.bioinformatics.org/mailman/listinfo/bbb
