Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/26742
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Aldecoa, Rodrigo | - |
dc.contributor.author | Marín, Ignacio | - |
dc.date.accessioned | 2010-08-02T11:05:40Z | - |
dc.date.available | 2010-08-02T11:05:40Z | - |
dc.date.issued | 2010-07-14 | - |
dc.identifier.citation | PLoS One 5(7): e11585 (2010) | en_US |
dc.identifier.issn | 1932-6203 | - |
dc.identifier.uri | http://hdl.handle.net/10261/26742 | - |
dc.description | 7 pages, 3 figures, PMID: 20644733 [PubMed]PMCID: PMC2904377 [PubMed Central]Free PMC Article | en_US |
dc.description.abstract | BACKGROUND: 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. | en_US |
dc.description.sponsorship | This research was supported by grant BIO2008-05067 (Programa Nacional de Biotecnologia; Ministerio de Ciencia e Innovacion, Spain). | en_US |
dc.format.extent | 353236 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | en_US |
dc.publisher | Public Library of Science | en_US |
dc.relation.isversionof | Publisher's version | - |
dc.rights | openAccess | en_US |
dc.title | Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering | en_US |
dc.type | artículo | en_US |
dc.identifier.doi | 10.1371/journal.pone.0011585 | - |
dc.description.peerreviewed | Peer reviewed | en_US |
dc.relation.publisherversion | http://dx.doi.org/10.1371/journal.pone.0011585 | en_US |
dc.identifier.pmid | 20644733 | - |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.languageiso639-1 | en | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.openairetype | artículo | - |
Aparece en las colecciones: | (IBV) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
PlosOne 005-e11585.pdf | 344,96 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
PubMed Central
Citations
8
checked on 18-abr-2024
SCOPUSTM
Citations
43
checked on 19-abr-2024
WEB OF SCIENCETM
Citations
33
checked on 24-feb-2024
Page view(s)
397
checked on 24-abr-2024
Download(s)
200
checked on 24-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
Artículos relacionados:
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.