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

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

doi:10.1109/CEC.2012.6256560

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 proceeding › Conference 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 language	English
Title of host publication	2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOIs	https://doi.org/10.1109/CEC.2012.6256560
Publication status	Published - 2012
Externally published	Yes
Event	2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, Australia Duration: 2012 Jun 10 → 2012 Jun 15

Publication series

Name	2012 IEEE Congress on Evolutionary Computation, CEC 2012

Other

Other	2012 IEEE Congress on Evolutionary Computation, CEC 2012
Country/Territory	Australia
City	Brisbane, QLD
Period	12/6/10 → 12/6/15

Keywords

A phylogenetic tree
asynchronous
parallel genetic algorithm

ASJC Scopus subject areas

Computational Theory and Mathematics
Theoretical Computer Science

Access to Document

10.1109/CEC.2012.6256560

Cite this

An asynchronous parallel genetic algorithm for the maximum likelihood phylogenetic tree search. / Tsuji, Miwako; Sato, Mitsuhisa; Tanabe, Akifumi S. et al.
2012 IEEE Congress on Evolutionary Computation, CEC 2012. 2012. 6256560 (2012 IEEE Congress on Evolutionary Computation, CEC 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tsuji, M, Sato, M, Tanabe, AS, 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, 2012 IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, QLD, Australia, 12/6/10. https://doi.org/10.1109/CEC.2012.6256560

@inproceedings{2ccd9b08986e49eeb0c80815738ea68d,

title = "An asynchronous parallel genetic algorithm for the maximum likelihood phylogenetic tree search",

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 = "A phylogenetic tree, asynchronous, parallel genetic algorithm",

author = "Miwako Tsuji and Mitsuhisa Sato and Tanabe, {Akifumi S.} and Yuji Inagaki and Tetsuo Hashimoto",

year = "2012",

doi = "10.1109/CEC.2012.6256560",

language = "English",

isbn = "9781467315098",

series = "2012 IEEE Congress on Evolutionary Computation, CEC 2012",

booktitle = "2012 IEEE Congress on Evolutionary Computation, CEC 2012",

note = "2012 IEEE Congress on Evolutionary Computation, CEC 2012 ; Conference date: 10-06-2012 Through 15-06-2012",

}

TY - GEN

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

AU - Tsuji, Miwako

AU - Sato, Mitsuhisa

AU - Tanabe, Akifumi S.

AU - Inagaki, Yuji

AU - Hashimoto, Tetsuo

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - A phylogenetic tree

KW - asynchronous

KW - parallel genetic algorithm

UR - http://www.scopus.com/inward/record.url?scp=84866843522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866843522&partnerID=8YFLogxK

U2 - 10.1109/CEC.2012.6256560

DO - 10.1109/CEC.2012.6256560

M3 - Conference contribution

AN - SCOPUS:84866843522

SN - 9781467315098

T3 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012

BT - 2012 IEEE Congress on Evolutionary Computation, CEC 2012

T2 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012

Y2 - 10 June 2012 through 15 June 2012

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this