An efficient clustering algorithm for partitioning Y-short tandem repeats data
Background: 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 existing partitioning algorithms produce poor clustering resul...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BioMed Central Ltd.
2012
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |