Lpnet: Reconstructing phylogenetic networks from distances using integer linear programming

Author:

Guo Mengzhen1ORCID,Grünewald Stefan1ORCID

Affiliation:

1. Shanghai Institute of Nutrition and Health University of Chinese Academy of Sciences Chinese Academy of Sciences Shanghai People's Republic of China

Abstract

AbstractNeighbor‐net is a widely used network reconstructing method that approximates pairwise distances between taxa by a circular phylogenetic network.We present Lpnet, a variant of Neighbor‐net. We first apply standard methods to construct a binary phylogenetic tree and then use integer linear programming to compute an optimal circular ordering that agrees with all tree splits.This approach achieves an improved approximation of the input distance for the clear majority of experiments that we have run for simulated and real data. We release an implementation in R that can handle up to 94 taxa and usually needs about 1 min on a standard computer for 80 taxa. For larger taxa sets, we include a top‐down heuristic which also tends to perform better than Neighbor‐net.Our Lpnet provides an alternative to Neighbor‐net and performs better in most cases. We anticipate Lpent will be useful to generate phylogenetic hypotheses.

Publisher

Wiley

Subject

Ecological Modeling,Ecology, Evolution, Behavior and Systematics

Reference25 articles.

1. A study of evidences for introgression among Viburnum lentago, V. prunifolium, and V. rufidulum based on leaf characteristics;Brumbaugh J.;Proceedings of the Indiana Academy of Sciences,1956

2. Neighbor-Net: An Agglomerative Method for the Construction of Phylogenetic Networks

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. NeighborNet: improved algorithms and implementation;Frontiers in Bioinformatics;2023-09-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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