Algorithms in Bioinformatics
Teaching Winter Semester 2005/06 Phylogenetic Networks
 
Welcome
People
Research
Publications
Software
Talks
Teaching
  Summer Semester 2008
  Winter Semester 2007/08
  Summer Semester 2007
  Winter Semester 2006/07
  Summer Semester 2006
  Winter Semester 2005/06
  Informatik I
  Gene Genealogies, Variation and Evolution
  Algorithms in Phylogeny
  Phylogenetic Networks
  Summer Semester 2005
  Winter Semester 2004/05
  Summer Semester 2004
  Winter Semester 2003/04
  Summer Semester 2003
  Winter Semester 2002/03
  Summer Semester 2002
Bachelor Thesis/ Student Projects
Master Thesis/ Diploma Projects
Studienkommission
Contents
Search
Address
ZBIT
CS Dept.
University
 

Oberseminar Phylogenetic Networks



Lecturer Prof. Dr. Daniel Huson
Time and Place:
Fr, 16-18h, start: 4. November, C306
Credits:
none
Prerequites:
Research in phylogeny


This oberseminar gives an introduction to the area of phylogenetic networks. The concept of a phylogenetic tree is well defined and it is assumed that students taking this course are familar with the topic of phylogenetic trees. The concept of a phylogenetic network, however, is not clearly defined and there is much confusion over the topic. The goal of this course is to give a systematic overview over the different approaches and concepts and will explore and highlight some of the connections between the different ideas.

Here is a rough list of contents:

0. Overview
1. On implicit and explicit networks
2. Split Networks
2.1 Distance methods
2.1.1 The four point condition
2.1.2 Buneman trees
2.1.3 The split decomposition
2.1.4 Neighbor-net
2.2 Sequence methods
2.2.1 Parsimony splits
2.2.2 Median networks
2.2.3 Spectral analysis and splits
2.3 Tree methods
2.3.1 Consensus trees
2.3.2 Consensus networks
2.3.3 Super networks and the Z-closure method

3. Reticulate Networks
3.1 Galled trees
3.2 Reticulations and SPRs
3.3. Reticulations and splits
3.4 Hybridization networks
3.5 Recombination networks
3.5.1 Ancestor recombination graphs
3.5.2 Branch-and bound approaches
3.5.3 Heuristics
3.6 Lower and Upper bounds

4. DLT Networks

5. Haplotype networks

6. Reticulgrams

7. Statistical Parsimony

8. Netting

9. Median joining networks

 
University of Tübingen