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: | Seman A.; Bakar Z.A.; Isa M.N. |
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 |
Similar Items
-
Evaluation of k-modes-type algorithms for clustering Y-short tandem repeats data
by: Seman A.; Bakar Z.A.; Isa M.N.
Published: (2012) -
Towards development of clustering applications for large-scale comparative genotyping and kinship analysis using Y-short tandem repeats
by: Seman A.; Sapawi A.M.; Salleh M.Z.
Published: (2015) -
An optimal and stable algorithm for clustering numerical data
by: Seman A.; Sapawi A.M.
Published: (2021) -
Random Dimension Manipulation for Efficient High-Dimensional Data Clustering
by: Zaki U.H.H.; Kamsani I.I.; Ibrahim R.; Sakamat N.; Kandogan E.
Published: (2025) -
A comparison study of clustering algorithms in grouping microarray data
by: Zin S.H.H.M.; Moktar B.
Published: (2024)