DagRep.9.10.134.pdf
- Filesize: 2.79 MB
- 18 pages
Document
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 9, Issue 10
Volume: Dagstuhl Reports, Volume 9
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-02-26
Cite AsGet BibTex
Magnus Bordewich, Britta Dorn, Simone Linz, and Rolf Niedermeier. Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). In Dagstuhl Reports, Volume 9, Issue 10, pp. 134-151, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/DagRep.9.10.134
https://doi.org/10.4230/DagRep.9.10.134
Abstract
Phylogenetics is the study of ancestral relationships between species. Its central goal is the reconstruction and analysis of phylogenetic trees and networks. Even though research in phylogenetics is motivated by biological questions and applications, it heavily relies on mathematics and computer science.
Dagstuhl Seminar 19443 on Algorithms and Complexity in Phylogenetics aimed at bringing together researchers from phylogenetics and theoretical computer science to enable an exchange of expertise, facilitate interactions across both research areas, and establish new collaborations. This report documents the program and outcomes of the seminar. It contains an executive summary, abstracts of talks, short summaries of working groups, and a list of open problems that were posed during the seminar.
Keywords
- Approximation algorithms
- Evolution
- Parameterized algorithms
- Phylogenetic trees and networks
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads