title: Classification of bioinformatics workflows using weighted versions of partitioning and hierarchical clustering algorithms.
abstract: BACKGROUND
  Workflows, or computational pipelines, consisting of collections of multiple linked tasks are becoming more and more popular in many scientific fields, including computational biology. For example, simulation studies, which are now a must for statistical validation of new bioinformatics methods and software, are frequently carried out using the available workflow platforms. Workflows are typically organized to minimize the total execution time and to maximize the efficiency of the included operations. Clustering algorithms can be applied either for regrouping similar workflows for their simultaneous execution on a server, or for dispatching some lengthy workflows to different servers, or for classifying the available workflows with a view to performing a specific keyword search.
  
  
  RESULTS
  In this study, we consider four different workflow encoding and clustering schemes which are representative for bioinformatics projects. Some of them allow for clustering workflows with similar topological features, while the others regroup workflows according to their specific attributes (e.g. associated keywords) or execution time. The four types of workflow encoding examined in this study were compared using the weighted versions of k-means and k-medoids partitioning algorithms. The Calinski-Harabasz, Silhouette and logSS clustering indices were considered. Hierarchical classification methods, including the UPGMA, Neighbor Joining, Fitch and Kitsch algorithms, were also applied to classify bioinformatics workflows. Moreover, a novel pairwise measure of clustering solution stability, which can be computed in situations when a series of independent program runs is carried out, was introduced.
  
  
  CONCLUSIONS
  Our findings based on the analysis of 220 real-life bioinformatics workflows suggest that the weighted clustering models based on keywords information or tasks execution times provide the most appropriate clustering solutions. Using datasets generated by the Armadillo and Taverna scientific workflow management system, we found that the weighted cosine distance in association with the k-medoids partitioning algorithm and the presence-absence workflow encoding provided the highest values of the Rand index among all compared clustering strategies. The introduced clustering stability indices, PS and PSG, can be effectively used to identify elements with a low clustering support.
authors.affiliation: Département d'informatique, Université du Québec à Montréal, C.P. 8888 succ. Centre-Ville, Montreal, QC, H3C 3P8, Canada. lord.etienne@courrier.uqam.ca.|Département de sciences biologiques, Université à Montréal, C.P. 6128 succ. Centre-Ville, Montreal, QC, H3C 3J7, Canada. lord.etienne@courrier.uqam.ca.
authors.forename: Etienne
authors.initials: E
authors.lastname: Lord
authors.affiliation: Département d'informatique, Université du Québec à Montréal, C.P. 8888 succ. Centre-Ville, Montreal, QC, H3C 3P8, Canada. diallo.abdoulaye@uqam.ca.
authors.forename: Abdoulaye Baniré
authors.initials: AB
authors.lastname: Diallo
authors.affiliation: Département d'informatique, Université du Québec à Montréal, C.P. 8888 succ. Centre-Ville, Montreal, QC, H3C 3P8, Canada. makarenkov.vladimir@uqam.ca.
authors.forename: Vladimir
authors.initials: V
authors.lastname: Makarenkov
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D066264:Datasets as Topic; D010802:Phylogeny; D012984:Software; D057188:Workflow