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

Author

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

Author_Institution

Center for Comput. Sci., Univ. of Tsukuba, Tsukuba, Japan

fYear

2012

fDate

10-15 June 2012

Firstpage

1

Lastpage

8

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.

Keywords

biology computing; evolution (biological); genetic algorithms; genetics; parallel algorithms; trees (mathematics); asynchronous parallel genetic algorithm; biological species; evolutionary relationships; maximum likelihood phylogenetic tree search; parallel computation; population diversity; Educational institutions; Electronic mail; Genetic algorithms; Optimization; Phylogeny; Topology; Vegetation; A phylogenetic tree; asynchronous; parallel genetic algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation (CEC), 2012 IEEE Congress on

Conference_Location

Brisbane, QLD

Print_ISBN

978-1-4673-1510-4

Electronic_ISBN

978-1-4673-1508-1

Type

conf

DOI

10.1109/CEC.2012.6256560

Filename

6256560