Đang chuẩn bị liên kết để tải về tài liệu:
Efficient sequential and parallel algorithms for planted motif search

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l, d)-motif search or Planted Motif Search (PMS). In PMS we are given two integers l and d and n biological sequences. |