tailieunhanh - RefSelect: A reference sequence selection algorithm for planted (l, d) motif search

The planted (l, d) motif search (PMS) is an important yet challenging problem in computational biology. Pattern-driven PMS algorithms usually use k out of t input sequences as reference sequences to generate candidate motifs, and they can find all the (l, d) motifs in the input sequences. |

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN