Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability.

Bin Fu Ming-Yang Kao Lusheng Wang Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. 231-240 2009 TAMC http://dx.doi.org/10.1007/978-3-642-02017-9_26 conf/tamc/2009 db/conf/tamc/tamc2009.html#FuKW09