An Improved K-Means Algorithm for DNA Sequence Clustering

Nassima Aleb, Narimane Labidi
{"title":"An Improved K-Means Algorithm for DNA Sequence Clustering","authors":"Nassima Aleb, Narimane Labidi","doi":"10.1109/DEXA.2015.27","DOIUrl":null,"url":null,"abstract":"In recent years, billions of DNA and protein sequences are subject to sequencing. However, few of them have known structures and functions, most remain unknown. The solution to this problem is to link sequences between them rather than revisit each new sequence independently of other sequences. Thus, if we manage to assimilate a sequence S1 to another sequence S2 or to a group of previously studied sequences, this will allow us to directly deduce the structure, functions and phylogenetic classification of S2. The purpose of this work is to adapt clustering methods to the specific problem of classification of DNA sequences. We introduce a new method based on K-means clustering for DNA sequences clustering. We begin by explaining and motivating our approach, then we present obtained results.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2015.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In recent years, billions of DNA and protein sequences are subject to sequencing. However, few of them have known structures and functions, most remain unknown. The solution to this problem is to link sequences between them rather than revisit each new sequence independently of other sequences. Thus, if we manage to assimilate a sequence S1 to another sequence S2 or to a group of previously studied sequences, this will allow us to directly deduce the structure, functions and phylogenetic classification of S2. The purpose of this work is to adapt clustering methods to the specific problem of classification of DNA sequences. We introduce a new method based on K-means clustering for DNA sequences clustering. We begin by explaining and motivating our approach, then we present obtained results.
DNA序列聚类的改进K-Means算法
近年来,数十亿的DNA和蛋白质序列需要测序。然而,它们中很少有已知的结构和功能,大多数仍然未知。这个问题的解决方案是将它们之间的序列连接起来,而不是独立于其他序列重新访问每个新序列。因此,如果我们设法将序列S1与另一个序列S2或一组先前研究的序列同化,这将使我们能够直接推断S2的结构、功能和系统发育分类。本工作的目的是使聚类方法适应于DNA序列分类的具体问题。提出了一种基于k均值聚类的DNA序列聚类方法。我们首先解释和激励我们的方法,然后展示我们获得的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信