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...
| Published in: | BMC Research Notes |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd.
2012
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874099937&doi=10.1186%2f1756-0500-5-557&partnerID=40&md5=65f04f86299e6afca8effb90b834dadd |