English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/26742
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering

AuthorsAldecoa, Rodrigo ; Marín, Ignacio
Issue Date14-Jul-2010
PublisherPublic Library of Science
CitationPLoS One 5(7): e11585 (2010)
AbstractBACKGROUND: How to extract useful information from complex biological networks is a major goal in many fields, especially in genomics and proteomics. We have shown in several works that iterative hierarchical clustering, as implemented in the UVCluster program, is a powerful tool to analyze many of those networks. However, the amount of computation time required to perform UVCluster analyses imposed significant limitations to its use. METHODOLOGY/PRINCIPAL FINDINGS: We describe the suite Jerarca, designed to efficiently convert networks of interacting units into dendrograms by means of iterative hierarchical clustering. Jerarca is divided into three main sections. First, weighted distances among units are computed using up to three different approaches: a more efficient version of UVCluster and two new, related algorithms called RCluster and SCluster. Second, Jerarca builds dendrograms based on those distances, using well-known phylogenetic algorithms, such as UPGMA or Neighbor-Joining. Finally, Jerarca provides optimal partitions of the trees using statistical criteria based on the distribution of intra- and intercluster connections. Outputs compatible with the phylogenetic software MEGA and the Cytoscape package are generated, allowing the results to be easily visualized. CONCLUSIONS/SIGNIFICANCE: THE FOUR MAIN ADVANTAGES OF JERARCA IN RESPECT TO UVCLUSTER ARE: 1) Improved speed of a novel UVCluster algorithm; 2) Additional, alternative strategies to perform iterative hierarchical clustering; 3) Automatic evaluation of the hierarchical trees to obtain optimal partitions; and, 4) Outputs compatible with popular software such as MEGA and Cytoscape.
Description7 pages, 3 figures, PMID: 20644733 [PubMed]PMCID: PMC2904377 [PubMed Central]Free PMC Article
Publisher version (URL)http://dx.doi.org/10.1371/journal.pone.0011585
URIhttp://hdl.handle.net/10261/26742
DOI10.1371/journal.pone.0011585
ISSN1932-6203
Appears in Collections:(IBV) Artículos
Files in This Item:
File Description SizeFormat 
PlosOne 005-e11585.pdf344,96 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.