An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites.

Henry C. M. Leung, Francis Y. L. Chin

Browse the full BIBE paper archive.