An upper bound on the hardness of exact matrix based motif discovery

Paul Horton, Wataru Fujibuchi. An upper bound on the hardness of exact matrix based motif discovery. J. Discrete Algorithms, 5(4):706-713, 2007. [doi]

No reviews for this publication, yet.