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...

Descripción completa

Detalles Bibliográficos
Autores principales: Seman, Ali, Bakar, Zainab Abu, Isa, Mohamed Nizam
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3571976/
https://www.ncbi.nlm.nih.gov/pubmed/23039132
http://dx.doi.org/10.1186/1756-0500-5-557

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3571976/
https://www.ncbi.nlm.nih.gov/pubmed/23039132
http://dx.doi.org/10.1186/1756-0500-5-557

Ejemplares similares