在随机投影空间中寻找基因组序列基序的期望最大化

International Conference on Electronics, Communication and Instrumentation (ICECI) Pub Date : 2014-03-17 DOI:10.1109/ICECI.2014.6767364

Aniruddha Maiti, A. Mukherjee

{"title":"在随机投影空间中寻找基因组序列基序的期望最大化","authors":"Aniruddha Maiti, A. Mukherjee","doi":"10.1109/ICECI.2014.6767364","DOIUrl":null,"url":null,"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.","PeriodicalId":315219,"journal":{"name":"International Conference on Electronics, Communication and Instrumentation (ICECI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Expectation maximization in random projected spaces to find motifs in genomic sequences\",\"authors\":\"Aniruddha Maiti, A. Mukherjee\",\"doi\":\"10.1109/ICECI.2014.6767364\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":315219,\"journal\":{\"name\":\"International Conference on Electronics, Communication and Instrumentation (ICECI)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Electronics, Communication and Instrumentation (ICECI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECI.2014.6767364\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Electronics, Communication and Instrumentation (ICECI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECI.2014.6767364","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

基于期望最大化(EM)的技术在基序查找应用中很受欢迎。本工作尝试使用期望最大化技术的一种变体，以降低复杂性。EM的迭代在投影空间中进行，以减少计算时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Conference on Electronics, Communication and Instrumentation (ICECI)

自引率

0.00%

发文量