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

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

Abstract Background Reconstructing 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 int...

Full description

Bibliographic Details
Main Authors: Zhaojuan Zhang, Wanliang Wang, Ruofan Xia, Gaofeng Pan, Jiandong Wang, Jijun Tang
Format: Article
Language:English
Published: BMC 2020-11-01
Series:BMC Bioinformatics
Subjects:
Ancestral genome inference
Genome arrangement
DCJ sorting
Discrete optimization
Quantum-behaved particle swarm optimization
Online Access:http://link.springer.com/article/10.1186/s12859-020-03833-7

Internet

http://link.springer.com/article/10.1186/s12859-020-03833-7

Similar Items