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. In Jianer Chen, S. Barry Cooper, editors, Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings. Volume 5532 of Lecture Notes in Computer Science, pages 231-240, Springer, 2009. [doi]
Abstract is missing.