Clustering of high throughput gene expression data

H Pirim, B Ekşioğlu, AD Perkins, Ç Yüceer - Computers & operations …, 2012 - Elsevier
High throughput biological data need to be processed, analyzed, and interpreted to address
problems in life sciences. Bioinformatics, computational biology, and systems biology deal …

GPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs

AS Arefin, C Riveros, R Berretta, P Moscato - 2012 - journals.plos.org
Background The analysis of biological networks has become a major challenge due to the
recent development of high-throughput techniques that are rapidly producing very large data …

Adaptive k-means algorithm for overlapped graph clustering

G Bello-Orgaz, HD Menéndez… - International journal of …, 2012 - World Scientific
The graph clustering problem has become highly relevant due to the growing interest of
several research communities in social networks and their possible applications …

A systematic comparison of genome-scale clustering algorithms

JJ Jay, JD Eblen, Y Zhang, M Benson, AD Perkins… - BMC …, 2012 - Springer
Background A wealth of clustering algorithms has been applied to gene co-expression
experiments. These algorithms cover a broad range of approaches, from conventional …

Improved T-Cluster based scheme for combination gene scale expression data

K Vengatesan, S Selvarajan - 2012 International Conference …, 2012 - ieeexplore.ieee.org
Clustering is an unsupervised learning technique in that there is no explicit demarcation of
data as training and test data. Clustering aims to group related records by measuring …

QServer: a biclustering server for prediction and assessment of co-expressed gene clusters

F Zhou, Q Ma, G Li, Y Xu - PloS one, 2012 - journals.plos.org
Background Biclustering is a powerful technique for identification of co-expressed gene
groups under any (unspecified) substantial subset of given experimental conditions, which …

Using pathway modules as targets for assay development in xenobiotic screening

RS Judson, HM Mortensen, I Shah, TB Knudsen… - Molecular …, 2012 - pubs.rsc.org
Toxicology and pharmaceutical research is increasingly making use of high throughout-
screening (HTS) methods to assess the effects of chemicals on molecular pathways, cells …

Heuristics for minimizing the maximum within-clusters distance

JA Fioruci, F Toledo, MCV Nascimento - Pesquisa Operacional, 2012 - SciELO Brasil
The clustering problem consists in finding patterns in a data set in order to divide it into
clusters with high within-cluster similarity. This paper presents the study of a problem, here …

Ensemble clustering for biological datasets

H Pirim, SE Seker, H Pérez-Sánchez - Bioinformatics, 2012 - books.google.com
Recent technologies and tools generated excessive data in bioinformatics domain. For
example, microarrays measure expression levels of ten thousands of genes simultaneously …

Unsupervised kernel parameter estimation by constrained nonlinear optimization for clustering nonlinear biological data

H Lee, R Singh - 2012 IEEE International Conference on …, 2012 - ieeexplore.ieee.org
Data on a wide-range of bio-chemical phenomena is often highly non-linear. Due to this
characteristic, data analysis tasks, such as clustering can become non-trivial. In recent …