PSA: an effective method for predicting horizontal gene transfers through parsimonious phylogenetic networks

Author:

Zhang Yuan1,Wang Juan1,Yu Jing2

Affiliation:

1. School of Computer Science Inner Mongolia University Hohhot 010021 China

2. College of Education Inner Mongolia Normal University Hohhot 010022 China

Abstract

AbstractHorizontal gene transfer (HGT) from one organism to another, according to some researchers, can be abundant in the evolution of species. A phylogenetic network is a network structure that describes the HGTs among species. Several studies have proposed methods to construct phylogenetic networks to predict HGTs based on parsimony values. Existing definitions of parsimony values for a phylogenetic network are based on the assumption that each gene site or segment evolves independently along different trees in the network. However, in the current study, we define a novel parsimony value, denoted the p definition, for phylogenetic networks, considering that a gene as a whole typically evolves along a tree. Using Simulated Annealing, a new method called the Phylogeny with Simulated Annealing (PSA) algorithm is proposed to search for an optimal network based on the p definition. The PSA method is tested on the simulated data. The results reveal that the parsimonious networks constructed using PSA can better represent the evolutionary relationships of species involving HGTs. Additionally, the HGTs predicted using PSA are more accurate than those predicted using other methods. The PSA algorithm is publicly accessible at http://github.com/imustu/sap.

Funder

National Natural Science Foundation of China

Publisher

Wiley

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3