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

Abstract excerpt

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 results. RESULTS: Our new algorithm, called k-Approximate Modal Haplotypes (k-AMH), obtains the highest clustering...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Chromosomes, Human, Y
• Share to Cluster Analysis