The following publications are possibly variants of this publication:
- An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding SitesHenry C. M. Leung, Francis Y. L. Chin. bibe 2005: 11-18 [doi]
- An Efficient Algorithm for String Motif DiscoveryFrancis Y. L. Chin, Henry C. M. Leung. apbc 2006: 79-88 [doi]
- An Estimation of Distribution Algorithm for Motif DiscoveryGang Li, Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee. cec 2008: 2411-2418 [doi]
- Finding Motifs with Insufficient Number of Strong Binding SitesHenry C. M. Leung, Francis Y. L. Chin, Siu-Ming Yiu, Ronald Rosenfeld, Wai Wan Tsang. jcb, 12(6):686-701, 2005. [doi]