DocumentCode
113935
Title
Expectation maximization in random projected spaces to find motifs in genomic sequences
Author
Maiti, Ananda ; Mukherjee, Arjun
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol., Kharagpur, Kharagpur, India
fYear
2014
fDate
16-17 Jan. 2014
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
expectation-maximisation algorithm; genomics; random sequences; computation time reduction; expectation maximization; genomic sequences; iterations; motif finding applications; random projected spaces; Biological system modeling; Complexity theory; Computational modeling; Data models; Measurement uncertainty; Parametric statistics; Position measurement; Expectation Maximization; Motif finding; Random Projection;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Communication and Instrumentation (ICECI), 2014 International Conference on
Conference_Location
Kolkata
Print_ISBN
978-1-4799-3982-4
Type
conf
DOI
10.1109/ICECI.2014.6767364
Filename
6767364
Link To Document