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

Henry C. M. Leung Francis Y. L. Chin An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. 11-18 2005 conf/bibe/2005 BIBE http://doi.ieeecomputersociety.org/10.1109/BIBE.2005.12 db/conf/bibe/bibe2005.html#LeungC05