Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as transcriptional binding factors or other regulatory sites. The problem in its generality has been considered difficult and various benchmark data serve as the litmus test for different computational methods. We present a method centered around unsupervised combinatorial pattern discovery. The parameters are chosen using a careful statistical analysis of consensus motifs. This method works well on the benchmark data and is general enough to be extended to a scenario where the variation in the consensus motif includes indels (along with mutations). We also present some results on detection of transcription binding factors in human DNA sequences. © 2008 Elsevier Ltd. All rights reserved.
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev