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

Zhang, Zhaojuan; Wang, Wanliang; Xia, Ruofan; Pan, Gaofeng; Wang, Jiandong; Tang, Jijun

Zhang, Zhaojuan; Wang, Wanliang; Xia, Ruofan; Pan, Gaofeng; Wang, Jiandong; Tang, Jijun.

Afiliação

Zhang Z; College of Computer Science and Technology, Zhejiang University of Technology, Liuhe Road, Hangzhou, China.
Wang W; College of Computer Science and Technology, Zhejiang University of Technology, Liuhe Road, Hangzhou, China. wwl@zjut.edu.cn.
Xia R; Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA.
Pan G; Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA.
Wang J; Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA.
Tang J; Department of Computer Science and Engineering, University of South Carolina, Assembly Street, Columbia, USA.

BMC Bioinformatics ; 21(1): 516, 2020 Nov 11.

Article em En | MEDLINE | ID: mdl-33176688

Assuntos

Algoritmos; Genoma; Rearranjo Gênico

Palavras-chave

Ancestral genome inference; DCJ sorting; Discrete optimization; Genome arrangement; Quantum-behaved particle swarm optimization

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Assunto principal: Algoritmos / Genoma Tipo de estudo: Prognostic_studies Idioma: En Revista: BMC Bioinformatics Assunto da revista: INFORMATICA MEDICA Ano de publicação: 2020 Tipo de documento: Article País de afiliação: China País de publicação: Reino Unido

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google