Dataset Information

BranchClust: a phylogenetic algorithm for selecting gene families.

ABSTRACT:

Background

Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first are easy to automate but usually they do not distinguish between paralogs and orthologs or have restriction on the number of taxa. Phylogenetic methods often are based on reconciliation of a gene tree with a known rooted species tree; a limitation of this approach, especially in case of prokaryotes, is that the species tree is often unknown, and that from the analyses of single gene families the branching order between related organisms frequently is unresolved.

Results

Here we describe an algorithm for the automated selection of orthologous genes that recognizes orthologous genes from different species in a phylogenetic tree for any number of taxa. The algorithm is capable of distinguishing complete (containing all taxa) and incomplete (not containing all taxa) families and recognizes in- and outparalogs. The BranchClust algorithm is implemented in Perl with the use of the BioPerl module for parsing trees and is freely available at http://bioinformatics.org/branchclust.

Conclusion

BranchClust outperforms the Reciprocal Best Blast hit method in selecting more sets of putatively orthologous genes. In the test cases examined, the correctness of the selected families and of the identified in- and outparalogs was confirmed by inspection of the pertinent phylogenetic trees.

SUBMITTER: Poptsova MS

PROVIDER: S-EPMC1853112 | biostudies-literature | 2007 Apr

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

BranchClust: a phylogenetic algorithm for selecting gene families.

Poptsova Maria S MS Gogarten J Peter JP

BMC bioinformatics 20070410

<h4>Background</h4>Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first are easy to automate but usually they do not distinguish between paralogs and orthologs or have restriction on the number of taxa. Phylogenetic methods often are based on reconciliation of a gene tree with a known rooted species tree; a limitation of this approach, especially in case of prokaryotes, is that the s ...[more]

PMID: 17425803

Similar Datasets

Project description:BACKGROUND:The human chromosomes 2q, 7, 12q and 17q show extensive intra-genomic homology, containing duplicate, triplicate and quadruplicate paralogous regions centered on the HOX gene clusters. The fact that two or more representatives of different gene families are linked with HOX clusters is taken as evidence that these paralogous gene sets might have arisen from a single chromosomal segment through block or whole chromosome duplication events. This would imply that the constituent genes including the HOX clusters reflect the architecture of a single ancestral block (before vertebrate origin) where all of these genes were linked in a single copy. RESULTS:In the present study we have employed the currently available set of protein data for a wide variety of vertebrate and invertebrate genomes to analyze the phylogenetic history of 11 multigene families with three or more of their representatives linked to human HOX clusters. A topology comparison approach revealed four discrete co-duplicated groups: group 1 involves the genes from GLI, HH, INHB, IGFBP (cluster-1), and SLC4A families; group 2 involves ERBB, ZNFN1A, and IGFBP (cluster-2) gene families; group 3 involves the HOX clusters and the SP gene family; group 4 involves the integrin beta chain and myosine light chain families. The distinct genes within each co-duplicated group share the same evolutionary history and are duplicated in concert with each other, while the constituent genes of two different co-duplicated groups may not share their evolutionary history and may not have duplicated simultaneously. CONCLUSION:We conclude that co-duplicated groups may themselves be remnants of ancient small-scale duplications (involving chromosomal segments or gene-clusters) which occurred at different time points during chordate evolution. Whereas the recent combination of genes from distinct co-duplicated groups on different chromosomal regions (human chromosomes 2q, 7, 12q, and 17q) is probably the outcome of subsequent rearrangement of genomic segments, including syntenic groups of genes.

Project description:BackgroundThe genomes of three major mosquito vectors of human diseases, Anopheles gambiae, Aedes aegypti, and Culex pipiens quinquefasciatus, have been previously sequenced. C. p. quinquefasciatus has the largest number of predicted protein-coding genes, which partially results from the expansion of three detoxification gene families: cytochrome P450 monooxygenases (P450), glutathione S-transferases (GST), and carboxyl/cholinesterases (CCE). However, unlike An. gambiae and Ae. aegypti, which have large amounts of gene expression data, C. p. quinquefasciatus has limited transcriptomic resources. Knowledge of complete gene expression information is very important for the exploration of the functions of genes involved in specific biological processes. In the present study, the three detoxification gene families of C. p. quinquefasciatus were analyzed for phylogenetic classification and compared with those of three other dipteran insects. Gene expression during various developmental stages and the differential expression responsible for parathion resistance were profiled using the digital gene expression (DGE) technique.ResultsA total of 302 detoxification genes were found in C. p. quinquefasciatus, including 71 CCE, 196 P450, and 35 cytosolic GST genes. Compared with three other dipteran species, gene expansion in Culex mainly occurred in the CCE and P450 families, where the genes of α-esterases, juvenile hormone esterases, and CYP325 of the CYP4 subfamily showed the most pronounced expansion on the genome. For the five DGE libraries, 3.5-3.8 million raw tags were generated and mapped to 13314 reference genes. Among 302 detoxification genes, 225 (75%) were detected for expression in at least one DGE library. One fourth of the CCE and P450 genes were detected uniquely in one stage, indicating potential developmentally regulated expression. A total of 1511 genes showed different expression levels between a parathion-resistant and a susceptible strain. Fifteen detoxification genes, including 2 CCEs, 6 GSTs, and 7 P450s, were expressed at higher levels in the resistant strain.ConclusionsThe results of the present study provide new insights into the functions and evolution of three detoxification gene families in mosquitoes and comprehensive transcriptomic resources for C. p. quinquefasciatus, which will facilitate the elucidation of molecular mechanisms underlying the different biological characteristics of the three major mosquito vectors.

Project description:Phylogenetic analysis is used to analyze the evolution of species according to the characteristics of biological sequences. The analytical results are generally represented by phylogenetic trees. NJ (neighbor joining) is a frequently used algorithm for constructing phylogenetic trees because of its few assumptions, fast operation, and high accuracy, and is based on the distance between taxa. It is known that NJ usually constructs different phylogenetic trees for the same dataset with differences in input order, which are known as “tied trees.” This article proposes an improved method of NJ, called ENJ (extended neighbor joining). The ENJ can join several (currently limited to three) nodes with the same minimum distance into a new node, rather than joining two nodes in one iteration, so it can construct triple phylogenetic trees. We have inferred the formulas for updating the distance values and calculating the branch lengths for the ENJ algorithm. We have tested the ENJ with simulated and real data. The experimental results show that, compared with other methods, the trees constructed by the ENJ have greater similarity to the initial trees, and the ENJ is much faster than the NJ algorithm. Moreover, we have constructed a phylogenetic tree for the novel coronavirus (COVID-19) and related coronaviruses by ENJ, which shows that COVID-19 and SARS-CoV are closer than other coronaviruses. Because it differs from the existing phylogenetic trees for those coronaviruses, we constructed a phylogenetic network for them. The network shows those species have had a reticulate evolution. Graphical Abstract Accurately inferring evolutionary relationships between species can help humans to understand the evolutionary history and the mechanism. ENJ is an efficient and effective algorithm for constructing phylogenetic trees, which can construct triple phylogenetic trees, if necessary. The trees constructed by ENJ can better describe the original information and reflect the real evolutionary relationship of species.

Dataset Information

BranchClust: a phylogenetic algorithm for selecting gene families.

Background

Results

Conclusion

Publications

BranchClust: a phylogenetic algorithm for selecting gene families.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure