EMS-GT2: An Improved Exact Solution for the (l, d)-Planted Motif Problem

• المؤلفون الرئيسيون: Fernandez, Proceso L, Jr, Ronquillo, Mark Joseph D
• التنسيق: text
• منشور في: Archīum Ateneo 2017
• الموضوعات: Planted (l; d)-Motif Problem; Bit-Based; Exact Enumerative Algorithm; Computer Sciences; Theory and Algorithms
• الوصول للمادة أونلاين: https://archium.ateneo.edu/discs-faculty-pubs/72; https://kkgpublications.com/ijtes-volume3-issue3-article5/

Finding DNA motifs is a widely studied area in the field of Computational Biology. Motifs signify different information that is useful for biologists. There are several variations of the motif finding problem, and one of these is called the (l, d)-motif search or Planted Motif Search problem (PMS)....