Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer

Antibiotic resistance in plant growth promoting bacteria: A comprehensive review and future perspectives to mitigate potential gene invasion risks

Plant growth-promoting bacteria (PGPB) are endowed with several attributes that can be beneficial for host plants. They opened myriad doors toward green technology approach to reduce the use of chemical inputs, improve soil fertility, and promote plants' health. However, many of these PGPB harbor antibiotic resistance genes (ARGs). Less attention has been given to multi-resistant bacterial bioinoculants which may transfer their ARGs to native soil microbial communities and other environmental reservoirs including animals, waters, and humans. Therefore, large-scale inoculation of crops by ARGs-harboring bacteria could worsen the evolution and dissemination of antibiotic resistance and aggravate the negative impacts on such ecosystem and ultimately public health. Their introduction into the soil could serve as ARGs invasion which may inter into the food chain. In this review, we underscore the antibiotic resistance of plant-associated bacteria, criticize the lack of consideration for this phenomenon in the screening and application processes, and provide some recommendations as well as a regulation framework relating to the development of bacteria-based biofertilizers to aid maximizing their value and applications in crop improvement while reducing the risks of ARGs invasion.

A new fast method for inferring multiple consensus trees using k-medoids

Background

Gene trees carry important information about specific evolutionary patterns which characterize the evolution of the corresponding gene families. However, a reliable species consensus tree cannot be inferred from a multiple sequence alignment of a single gene family or from the concatenation of alignments corresponding to gene families having different evolutionary histories. These evolutionary histories can be quite different due to horizontal transfer events or to ancient gene duplications which cause the emergence of paralogs within a genome. Many methods have been proposed to infer a single consensus tree from a collection of gene trees. Still, the application of these tree merging methods can lead to the loss of specific evolutionary patterns which characterize some gene families or some groups of gene families. Thus, the problem of inferring multiple consensus trees from a given set of gene trees becomes relevant.

Results

We describe a new fast method for inferring multiple consensus trees from a given set of phylogenetic trees (i.e. additive trees or X-trees) defined on the same set of species (i.e. objects or taxa). The traditional consensus approach yields a single consensus tree. We use the popular k-medoids partitioning algorithm to divide a given set of trees into several clusters of trees. We propose novel versions of the well-known Silhouette and Caliński-Harabasz cluster validity indices that are adapted for tree clustering with k-medoids. The efficiency of the new method was assessed using both synthetic and real data, such as a well-known phylogenetic dataset consisting of 47 gene trees inferred for 14 archaeal organisms.

Conclusions

The method described here allows inference of multiple consensus trees from a given set of gene trees. It can be used to identify groups of gene trees having similar intragroup and different intergroup evolutionary histories. The main advantage of our method is that it is much faster than the existing tree clustering approaches, while providing similar or better clustering results in most cases. This makes it particularly well suited for the analysis of large genomic and phylogenetic datasets.

Inferring and validating horizontal gene transfer events using bipartition dissimilarity

Horizontal gene transfer (HGT) is one of the main mechanisms driving the evolution of microorganisms. Its accurate identification is one of the major challenges posed by reticulate evolution. In this article, we describe a new polynomial-time algorithm for inferring HGT events and compare 3 existing and 1 new tree comparison indices in the context of HGT identification. The proposed algorithm can rely on different optimization criteria, including least squares (LS), Robinson and Foulds (RF) distance, quartet distance (QD), and bipartition dissimilarity (BD), when searching for an optimal scenario of subtree prune and regraft (SPR) moves needed to transform the given species tree into the given gene tree. As the simulation results suggest, the algorithmic strategy based on BD, introduced in this article, generally provides better results than those based on LS, RF, and QD. The BD-based algorithm also proved to be more accurate and faster than a well-known polynomial time heuristic RIATA-HGT. Moreover, the HGT recovery results yielded by BD were generally equivalent to those provided by the exponential-time algorithm LatTrans, but a clear gain in running time was obtained using the new algorithm. Finally, a statistical framework for assessing the reliability of obtained HGTs by bootstrap analysis is also presented.