Mathematical Problems in Molecular Evolution and Next Generation Sequencing
Abstract:
The focus of this work is the development of new mathematical methods for problems in phylogenetic tree inferences.
In the first part we solve several problems related to so-called partitioned alignments.
In the second part we demonstrate how to calculate all identical subtrees of a given labeled tree. We make use of this to implement an efficient method for avoiding redundant likelihood operations during phylogenetic tree inferences.
In the first part we solve several problems related to so-called partitioned alignments.
In the second part we demonstrate how to calculate all identical subtrees of a given labeled tree. We make use of this to implement an efficient method for avoiding redundant likelihood operations during phylogenetic tree inferences.
| Zugehörige Institution(en) am KIT | Institut für Theoretische Informatik (ITI) |
| Publikationstyp | Hochschulschrift |
| Publikationsjahr | 2016 |
| Sprache | Englisch |
| Identifikator | urn:nbn:de:swb:90-560768 KITopen-ID: 1000056076 |
| Verlag | Karlsruher Institut für Technologie (KIT) |
| Umfang | 171 S. |
| Art der Arbeit | Dissertation |
| Fakultät | Fakultät für Informatik (INFORMATIK) |
| Institut | Institut für Theoretische Informatik (ITI) |
| Prüfungsdaten | 02.05.2016 |
| Referent/Betreuer | Stamatakis, A. |
