An efficient clustering algorithm for partitioning Y-short tandem repeats data

An efficient clustering algorithm for partitioning Y-short tandem repeats data

<p>Abstract</p> <p>Background</p> <p>Y-Short Tandem Repeats (Y-STR) data consist of many similar and almost similar objects. This characteristic of Y-STR data causes two problems with partitioning: non-unique centroids and local minima problems. As a result, the existin...

Full description

Bibliographic Details
Main Authors: Seman Ali, Bakar Zainab Abu, Isa Mohamed Nizam
Format: Article
Language:English
Published: BMC 2012-10-01
Series:BMC Research Notes
Subjects:
Algorithms
Bioinformatics
Clustering
Optimization
Data mining
Online Access:http://www.biomedcentral.com/1756-0500/5/557

Internet

http://www.biomedcentral.com/1756-0500/5/557

Similar Items