[Beowulf] Motif-Finding Problems Complexities
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Mourad Elloumi mourad12345678 at yahoo.comTue May 5 18:12:01 PDT 2009
- Previous message: [Beowulf] Tyan S7002 for Nehalem-based nodes
- Next message: [Beowulf] 16th IEEE International Conference on High Performance Computing (HiPC 2009)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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 at fsegt.rnu.tn URL :www.esstt.rnu.tn/utic/english/memb_elloumi.html ______________________________________________________
- Previous message: [Beowulf] Tyan S7002 for Nehalem-based nodes
- Next message: [Beowulf] 16th IEEE International Conference on High Performance Computing (HiPC 2009)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list