Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/tcbb.2007.1046 | IEEE/ACM Trans. Comput. Biology Bioinform. |
Keywords | Field | DocType |
graph drawing,algorithms,improved layout,spring embedder,phylogenetic networks,better layout,split network,phylogenetic analysis,equal-daylight algorithm,phylogenetics,simple equal angle algorithm,indexing terms,graph theory,genetics,phylogeny,computer networks,phylogenetic network | Graph drawing,Graph theory,Phylogenetic tree,Computer science,Split networks,Theoretical computer science,Bioinformatics | Journal |
Volume | Issue | ISSN |
5 | 3 | 1557-9964 |
Citations | PageRank | References |
6 | 0.56 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Gambette | 1 | 77 | 9.61 |
| Daniel H. Huson | 2 | 765 | 91.20 |