Optimal algorithms for computing edge weights in planar split networks

DOI10.1007/S12190-011-0506-ZMaRDI QIDQ2511048zbMATH OpenOpenAlexFDO

Authors Andreas Spillner, Vincent Moulton

Publication date 5 August 2014

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-011-0506-z

zbMATH Keywords

crofton formulaflat split systemsplit network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• When can splits be drawn in the plane?
• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• Clustered SplitsNetworks
• A space of phylogenetic networks
• Fishing for minimum evolution trees with neighbor-nets

Cites work

• 4n-10
• A canonical decomposition theory for metrics on a finite set
• A note on circular decomposable metrics
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1945177 (Why is no real title available?)
• scientific article; zbMATH DE number 2109336 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Linearly independent split systems

Cited in

(7)

• On the Wimer method for designing edge-based algorithms
• Order distances and split systems
• Fishing for minimum evolution trees with neighbor-nets
• Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks
• When can splits be drawn in the plane?
• Edge-Cuts of Optimal Average Weights
• Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks

This page was built for publication: Optimal algorithms for computing edge weights in planar split networks

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