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. In Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 19-21 October 2005, Minneapolis, MN, USA. pages 11-18, IEEE Computer Society, 2005. [doi]

Abstract

Abstract is missing.