Dataset Information

Hierarchical clustering algorithm for comprehensive orthologous-domain classification in multiple genomes.

ABSTRACT: Ortholog identification is a crucial first step in comparative genomics. Here, we present a rapid method of ortholog grouping which is effective enough to allow the comparison of many genomes simultaneously. The method takes as input all-against-all similarity data and classifies genes based on the traditional hierarchical clustering algorithm UPGMA. In the course of clustering, the method detects domain fusion or fission events, and splits clusters into domains if required. The subsequent procedure splits the resulting trees such that intra-species paralogous genes are divided into different groups so as to create plausible orthologous groups. As a result, the procedure can split genes into the domains minimally required for ortholog grouping. The procedure, named DomClust, was tested using the COG database as a reference. When comparing several clustering algorithms combined with the conventional bidirectional best-hit (BBH) criterion, we found that our method generally showed better agreement with the COG classification. By comparing the clustering results generated from datasets of different releases, we also found that our method showed relatively good stability in comparison to the BBH-based methods.

SUBMITTER: Uchiyama I

PROVIDER: S-EPMC1351371 | biostudies-literature | 2006

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Hierarchical clustering algorithm for comprehensive orthologous-domain classification in multiple genomes.

Uchiyama Ikuo I

Nucleic acids research 20060125 2

Ortholog identification is a crucial first step in comparative genomics. Here, we present a rapid method of ortholog grouping which is effective enough to allow the comparison of many genomes simultaneously. The method takes as input all-against-all similarity data and classifies genes based on the traditional hierarchical clustering algorithm UPGMA. In the course of clustering, the method detects domain fusion or fission events, and splits clusters into domains if required. The subsequent proce ...[more]

PMID: 16436801

Similar Datasets

Project description:BackgroundThere are 3 issues in bibliometrics that need to be addressed: The lack of a clear definition for author collaborations in cluster analysis that takes into account collaborations with and without self-connections; The need to develop a simple yet effective clustering algorithm for use in coword analysis, and; The inadequacy of general bibliometrics in regard to comparing research achievements and identifying articles that are worth reading and recommended for readers. The study aimed to put forth a clustering algorithm for cluster analysis (called following leader clustering [FLCA], a follower-leading clustering algorithm), examine the dissimilarities in cluster outcomes when considering collaborations with and without self-connections in cluster analysis, and demonstrate the application of the clustering algorithm in bibliometrics.MethodsThe study involved a search for articles and review articles published in JMIR Medical Informatics between 2016 and 2022, conducted using the Web of Science core collections. To identify author collaborations (ACs) and themes over the past 7 years, the study utilized the FLCA algorithm. With the 3 objectives of; Comparing the results obtained from scenarios with and without self-connections; Applying the FLCA algorithm in ACs and themes, and; Reporting the findings using traditional bibliometric approaches based on counts and citations, and all plots were created using R.ResultsThe study found a significant difference in cluster outcomes between the 2 scenarios with and without self-connections, with a 53.8% overlap (14 out of the top 20 countries in ACs). The top clusters were led by Yonsei University in South Korea, Grang Luo from the US, and model in institutes, authors, and themes over the past 7 years. The top entities with the most publications in JMIR Medical Informatics were the United States, Yonsei University in South Korea, Medical School, and Grang Luo from the US.ConclusionThe FLCA algorithm proposed in this study offers researchers a comprehensive approach to exploring and comprehending the complex connections among authors or keywords. The study suggests that future research on ACs with cluster analysis should employ FLCA and R visualizations.

Dataset Information

Hierarchical clustering algorithm for comprehensive orthologous-domain classification in multiple genomes.

Publications

Hierarchical clustering algorithm for comprehensive orthologous-domain classification in multiple genomes.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets