Achieving large and distant ancestral genome inference by using an improved discrete quantum-behaved particle swarm optimization algorithm

BMC Bioinformatics

Zhaojuan Zhang¹  Wanliang Wang¹  Ruofan Xia²  Jiandong Wang²  Gaofeng Pan²  Jijun Tang³ 

[1]College of Computer Science and Technology, Zhejiang University of Technology, Liuhe Road, Hangzhou, China

[2]Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA

[3]Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA

[4]Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin University, Yaguan Road, Tianjin, China

关键词: Ancestral genome inference;    Genome arrangement;    DCJ sorting;    Discrete optimization;    Quantum-behaved particle swarm optimization;   

DOI  :  10.1186/s12859-020-03833-7

来源: Springer

【 摘 要 】

BackgroundReconstructing ancestral genomes is one of the central problems presented in genome rearrangement analysis since finding the most likely true ancestor is of significant importance in phylogenetic reconstruction. Large scale genome rearrangements can provide essential insights into evolutionary processes. However, when the genomes are large and distant, classical median solvers have failed to adequately address these challenges due to the exponential increase of the search space. Consequently, solving ancestral genome inference problems constitutes a task of paramount importance that continues to challenge the current methods used in this area, whose difficulty is further increased by the ongoing rapid accumulation of whole-genome data.ResultsIn response to these challenges, we provide two contributions for ancestral genome inference. First, an improved discrete quantum-behaved particle swarm optimization algorithm (IDQPSO) by averaging two of the fitness values is proposed to address the discrete search space. Second, we incorporate DCJ sorting into the IDQPSO (IDQPSO-Median). In comparison with the other methods, when the genomes are large and distant, IDQPSO-Median has the lowest median score, the highest adjacency accuracy, and the closest distance to the true ancestor. In addition, we have integrated our IDQPSO-Median approach with the GRAPPA framework. Our experiments show that this new phylogenetic method is very accurate and effective by using IDQPSO-Median.ConclusionsOur experimental results demonstrate the advantages of IDQPSO-Median approach over the other methods when the genomes are large and distant. When our experimental results are evaluated in a comprehensive manner, it is clear that the IDQPSO-Median approach we propose achieves better scalability compared to existing algorithms. Moreover, our experimental results by using simulated and real datasets confirm that the IDQPSO-Median, when integrated with the GRAPPA framework, outperforms other heuristics in terms of accuracy, while also continuing to infer phylogenies that were equivalent or close to the true trees within 5 days of computation, which is far beyond the difficulty level that can be handled by GRAPPA.

【 授权许可】

CC BY