 |
 |
|
|
| HAL: lirmm-00309694, version 1 |
| DOI: 10.1109/tcbb.2007.1046 |
| Detailed view |  Export this paper |
|
|
| IEEE/ACM Transactions on Computational Biology and Bioinformatics 5, 3 (2008) 472-479 |
|
|
|
|
| Improved Layout of Phylogenetic Networks |
|
|
Philippe Gambette 1Daniel Huson 2 |
|
|
| (2008) |
|
|
|
| Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal angle algorithm is used to draw such networks, producing layouts that leave much room for improvement. Addressing the problem of producing better layouts of split networks, this paper presents an algorithm for maximizing the area covered by the network, describes an extension of the equal-daylight algorithm to networks, looks into using a spring embedder and discusses how to construct rooted split networks. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc |
|
|
| 2: | Institut Wilhelm Schickard |
|
|
|
Tübingen Universität - Tübingen University |
|
|
|
|
|
|
|
|
|
| [INFO/MAB : Méthodes et Algorithmes pour la Bioinformatique][INFO/VAG : Visualisation et Algorithmes de Graphes] |
|
|
|
|
| Subject | : | Computer Science/Bioinformatics Life Sciences/Quantitative Methods |
|
|
| phylogenetics – phylogenetic networks – graph drawing – algorithms |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| lirmm-00309694, version 1 | |
| http://hal-lirmm.ccsd.cnrs.fr/lirmm-00309694 | |
| oai:hal-lirmm.ccsd.cnrs.fr:lirmm-00309694 | |
| From: Algo Ligm | |
| Submitted on: Tuesday, 16 September 2008 16:29:45 | |
| Updated on: Friday, 19 September 2008 16:56:51 | |
