Expectation maximization in random projected spaces to find motifs in genomic sequences

摘要

Expectation Maximization (EM) based techniques are popular in motif finding applications. This work attempts to use a variant of Expectation Maximization Technique in order to reduce the complexity. The iterations of EM are performed in projected spaces to reduce the computation time.