An Improved K-Means Algorithm for DNA Sequence Clustering

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings - International Workshop on Database and Expert Systems Applications pp. 39 - 42
Main Authors Aleb, Nasssima, Labidi, Narimane
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.09.2015
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISBN:1467375810
9781467375818
ISSN:1529-4188
2378-3915
DOI:10.1109/DEXA.2015.27