Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

DOI10.1007/978-3-030-68766-3_14OpenAlexW3135747055MaRDI QIDQ5014114

Jonathan Klawitter, Peter Stumpf

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.08960

zbMATH Keywords

crossing minimizationphylogenetic networktree-based

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Visualizing multispecies coalescent trees: drawing gene trees inside species trees

Cites Work

• Unnamed Item
• Unnamed Item
• On determining if tree-based networks contain fixed trees
• A linear-time algorithm for a special case of disjoint set union
• Tree-based networks: characterisations, metrics, and support trees
• Algorithms for visualizing phylogenetic networks
• Visualizing co-phylogenetic reconciliations
• Phylogeny

This page was built for publication: Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings