Cargando…
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...
Autores principales: | Seman, Ali, Bakar, Zainab Abu, Isa, Mohamed Nizam |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2012
|
Materias: | |
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 |
Ejemplares similares
-
Towards Development of Clustering Applications for Large-Scale Comparative Genotyping and Kinship Analysis Using Y-Short Tandem Repeats
por: Seman, Ali, et al.
Publicado: (2015) -
Partitioning clustering algorithms for protein sequence data sets
por: Fayech, Sondes, et al.
Publicado: (2009) -
Partitional clustering algorithms
por: Celebi, M
Publicado: (2015) -
Native functions of short tandem repeats
por: Wright, Shannon E, et al.
Publicado: (2023) -
DeepRepeat: direct quantification of short tandem repeats on signal data from nanopore sequencing
por: Fang, Li, et al.
Publicado: (2022)