Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

DOI10.1007/978-3-030-68766-3_14MaRDI QIDQ5014114zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A linear-time algorithm for a special case of disjoint set union
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• On determining if tree-based networks contain fixed trees
• Phylogeny. Discrete and random processes in evolution
• Tree-based networks: characterisations, metrics, and support trees

Cited in

(4)

• Visualizing multispecies coalescent trees: drawing gene trees inside species trees
• Embedding phylogenetic trees in networks of low treewidth
• Embedding phylogenetic trees in networks of low treewidth
• Visualizing geophylogenies -- internal and external labeling with phylogenetic tree constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014114)