Paper Info
Title
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Abstract
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the tree (given a model of the evolutionary process and a data set). The combinatorial complexity of inferring the topology of the best tree makes phylogenetic inference ideal for genetic algorithms. In this paper, two existing algorithms for phylogenetic inference (neighbour-joining and maximum likelihood) are co-utilised within a GA and enable the phenotype and genotype to be assigned quite different representations. The exploration vs. exploitation aspects of the algorithm are examined in some test cases. The GA is compared to the well known phylogenetic inference program PHYLIP.
Year
DOI
Venue
2005
10.1145/1068009.1068076
GECCO
Keywords
Field
DocType
maximum likelihood phylogenetic inference,combinatorial complexity,maximum likelihood,evolutionary relationship,statistical likelihood,phylogenetic inference ideal,best tree,phylogenetic inference program,phylogenetic inference,phylogenetic tree,genetic algorithm,genetic algorithms
Genotype,Phylogenetic tree,Tree rearrangement,Pattern recognition,Computer science,Computational phylogenetics,Artificial intelligence,Test case,Phylogenetics,Machine learning,Genetic algorithm,Phylogenetic network
Conference
ISBN
Citations 
PageRank 
1-59593-010-8
9
0.56
References 
Authors
12
1
Name
Order
Citations
PageRank
Leon Poladian1162.72