Dresden 2011 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
BP: Fachverband Biologische Physik
BP 7: Posters: Statistical Physics in Biological Systems
BP 7.25: Poster
Monday, March 14, 2011, 17:15–20:00, P3
Construction of Phylogenetic Trees Using a Clustering Approach — •Johannes Josef Schneider1, Thomas Bukur2, and Antje Krause2 — 1Department of Physics, Mathematics, and Computer Science, Johannes Gutenberg University of Mainz, Staudinger Weg 7, 55099 Mainz, Germany — 2Fachhochschule Bingen -- University of Applied Sciences, 55411 Bingen, Germany
Recently, we introduced an extension of the Traveling Salesman Problem which we coined Traveling Salesman Problem with Clustering [1]. In this extension, the constraint that nodes close to each other should be visited contiguously in the tour is added to the original problem, thus minimizing the overall tour length and generating clusters in parallel. In this talk, we demonstrate how this approach is adopted to the problem of constructing phylogenetic trees, defining the distances between various species with the overlap between them.
[1] Johannes J. Schneider, Thomas Bukur, and Antje Krause, Traveling Salesman Problem with Clustering, J. Stat. Phys. 141, 767-784, 2010.