Informatics Seminar (Perspective in Informatics 4B) 2011 - 2012
October 27 (Thu), 14:45 - 16:15
- Place:
Lecture Hall 1, Faculty of Engineering Bldg. No.10, Main Campus
- Title:
Combinatorial algorithms for constructing phylogenetic trees
- Speaker:
Jesper Jansson (Ochanomizu University)
- Abstract:
A more than 150-year-old data structure known as a "phylogenetic tree" can
be used to describe the evolutionary history of a given set of related
objects such as biological species, proteins, natural languages, spam e-mail
messages, etc.
Formally, we can define a phylogenetic tree as a rooted, unordered tree with
distinctly labeled leaves.
This talk is a short introduction to the important task of building
phylogenetic trees, as seen from an algorithmic point of view.
In the presentation, I will review some simple and famous algorithms for
constructing phylogenetic trees based on: (1) pairwise distance data,
(2) character state matrices, and (3) consensus.
(No background in biology is necessary to understand the presentation.)
If time permits, I will discuss a number of recent extensions of these
algorithms and present some interesting related open problems.
Kyoto University
> Graduate School of Informatics
> International Courses
> Informatics Seminar