Show simple item record

dc.contributor.advisorCoulson, Andrew
dc.contributor.advisorWatson, Mark
dc.contributor.advisorCronk, Quentin
dc.contributor.authorBarker, Daniel
dc.date.accessioned2015-04-30T15:07:05Z
dc.date.available2015-04-30T15:07:05Z
dc.date.issued2000-07-18
dc.identifier.urihttp://hdl.handle.net/1842/10326
dc.description.abstractI investigate use of the simulated annealing heuristic to seek phylogenetic trees judged optimal according to the principle of parsimony. I begin by looking into the central data structure in phylogenetic research, the tree. I discuss why it is usually necessary to employ a heuristic, rather than an exact method, when seeking parsimonious trees. I summarise different heuristic approaches. I explain how to use the program LVB, written to use simulated annealing in the search for parsimonious trees. I use LVB, with different combinations of values for parameters controlling the annealing search, to re-analyse two DNA sequence data matrices, one of 50 objects and one of 365 objects. Equations to estimate suitable control parameters, on the basis of desired run time and quality of result, are fitted to data obtained by these analyses. Future directions of research are discussed.en
dc.contributor.sponsorBiotechnology and Biological Sciences Research Council (BBSRC)en
dc.language.isoenen
dc.publisherThe University of Edinburghen
dc.relation.hasversionD. Barker. LVB 1.0: Reconstructing Evolution with Parsimony and Simulated Annealing. Daniel Barker, Edinburgh, 1997.en
dc.subjectSimulated annealingen
dc.subjectPhylogenetic treesen
dc.titleSimulated annealing in the search for phylogenetic treesen
dc.typeThesis or Dissertationen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhD Doctor of Philosophyen


Files in this item

This item appears in the following Collection(s)

Show simple item record