基于启发式数据挖掘的扩展交叉基序搜索

Teo Argentieri, V. Cantoni, M. Musci
{"title":"基于启发式数据挖掘的扩展交叉基序搜索","authors":"Teo Argentieri, V. Cantoni, M. Musci","doi":"10.1109/DEXA.2017.28","DOIUrl":null,"url":null,"abstract":"In previous works we have presented Cross Motif Search (CMS), a MP/MPI parallel tool for geometrical motif extraction in the secondary structure of proteins. We proved that our algorithm is capable of retrieving previously unknown motifs, thanks to its innovative approach based on the generalized Hough transform. We have also presented a GUI to CMS, called MotifVisualizer, which was introduced to improve software usability and to encourage collaboration with the biology community. In this paper we address the main shortcoming of CMS: with a simple approach based on heuristic data mining we show how we can classify the candidate motifs according to their statistical significance in the data set. We also present two extensions to MotifVisualizer, one to include the new data mining functions in the GUI, and a second one to allow for an easier retrieval of testing data sets.","PeriodicalId":127009,"journal":{"name":"2017 28th International Workshop on Database and Expert Systems Applications (DEXA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Extending Cross Motif Search with Heuristic Data Mining\",\"authors\":\"Teo Argentieri, V. Cantoni, M. Musci\",\"doi\":\"10.1109/DEXA.2017.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In previous works we have presented Cross Motif Search (CMS), a MP/MPI parallel tool for geometrical motif extraction in the secondary structure of proteins. We proved that our algorithm is capable of retrieving previously unknown motifs, thanks to its innovative approach based on the generalized Hough transform. We have also presented a GUI to CMS, called MotifVisualizer, which was introduced to improve software usability and to encourage collaboration with the biology community. In this paper we address the main shortcoming of CMS: with a simple approach based on heuristic data mining we show how we can classify the candidate motifs according to their statistical significance in the data set. We also present two extensions to MotifVisualizer, one to include the new data mining functions in the GUI, and a second one to allow for an easier retrieval of testing data sets.\",\"PeriodicalId\":127009,\"journal\":{\"name\":\"2017 28th International Workshop on Database and Expert Systems Applications (DEXA)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 28th International Workshop on Database and Expert Systems Applications (DEXA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEXA.2017.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 28th International Workshop on Database and Expert Systems Applications (DEXA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2017.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在之前的工作中,我们提出了交叉基序搜索(CMS),一个MP/MPI并行工具,用于蛋白质二级结构的几何基序提取。我们证明了我们的算法能够检索以前未知的基元,这要归功于它基于广义霍夫变换的创新方法。我们还为CMS提供了一个名为MotifVisualizer的GUI,它的引入是为了提高软件的可用性,并鼓励与生物界的合作。在本文中,我们解决了CMS的主要缺点:通过一种基于启发式数据挖掘的简单方法,我们展示了如何根据数据集中的统计显著性对候选基序进行分类。我们还为MotifVisualizer提供了两个扩展,一个是在GUI中包含新的数据挖掘功能,另一个是允许更容易地检索测试数据集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Extending Cross Motif Search with Heuristic Data Mining
In previous works we have presented Cross Motif Search (CMS), a MP/MPI parallel tool for geometrical motif extraction in the secondary structure of proteins. We proved that our algorithm is capable of retrieving previously unknown motifs, thanks to its innovative approach based on the generalized Hough transform. We have also presented a GUI to CMS, called MotifVisualizer, which was introduced to improve software usability and to encourage collaboration with the biology community. In this paper we address the main shortcoming of CMS: with a simple approach based on heuristic data mining we show how we can classify the candidate motifs according to their statistical significance in the data set. We also present two extensions to MotifVisualizer, one to include the new data mining functions in the GUI, and a second one to allow for an easier retrieval of testing data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MuMs: Energy-Aware VM Selection Scheme for Cloud Data Center Biclustering of Biological Sequences Global and Local Feature Learning for Ego-Network Analysis Evaluation of Contextualization and Diversification Approaches in Aggregated Search Towards a Cloud of Clouds Elasticity Management System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1