An asynchronous parallel genetic algorithm for the maximum likelihood phylogenetic tree search

Miwako Tsuji, Mitsuhisa Sato, Akifumi S. Tanabe, Yuji Inagaki, Tetsuo Hashimoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A phylogenetic tree represents the evolutionary relationships among biological species. Although parallel computation is essential for the phylogenetic tree searches, it is not easy to maintain the diversity of population in a parallel genetic algorithm. In this paper, we design a new asynchronous parallel genetic algorithm for tree optimization which maintain the diversity of population without any communication or synchronization.

Original languageEnglish
Title of host publication2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOIs
Publication statusPublished - 2012 Oct 4
Externally publishedYes
Event2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, Australia
Duration: 2012 Jun 102012 Jun 15

Publication series

Name2012 IEEE Congress on Evolutionary Computation, CEC 2012

Other

Other2012 IEEE Congress on Evolutionary Computation, CEC 2012
CountryAustralia
CityBrisbane, QLD
Period12/6/1012/6/15

Keywords

  • A phylogenetic tree
  • asynchronous
  • parallel genetic algorithm

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'An asynchronous parallel genetic algorithm for the maximum likelihood phylogenetic tree search'. Together they form a unique fingerprint.

  • Cite this

    Tsuji, M., Sato, M., Tanabe, A. S., Inagaki, Y., & Hashimoto, T. (2012). An asynchronous parallel genetic algorithm for the maximum likelihood phylogenetic tree search. In 2012 IEEE Congress on Evolutionary Computation, CEC 2012 [6256560] (2012 IEEE Congress on Evolutionary Computation, CEC 2012). https://doi.org/10.1109/CEC.2012.6256560