- Correction
- Open Access
- Published:
Correction to: Classes of tree-based networks
Visual Computing for Industry, Biomedicine, and Art volume 4, Article number: 2 (2021)
Correction to: Vis Comput Ind Biomed Art 3, 12 (2020)
https://doi.org/10.1186/s42492-020-00043-z
Following publication of the original article [1], in the description of the leaf shrinking procedure as well as in Algorithm 1 and the definition of edge-based graphs in [1], the condition that G contains at least two leaves (i.e., the condition |VL(G)| ≥ 2) needs to be omitted. Moreover, in line 2 of Algorithm 1 it should read \( \left|V\left(\mathcal{LS}(G)\right)\right|>2 \).
In particular, Algorithm 1 and Definition 3 should read as follows:

Definition 3 Let G be a connected graph with |V(G)| ≥ 2. If the leaf shrink graph \( \mathcal{LS}(G) \) of G is a single edge, G is called edge-based. Else, G is called non-edge-based. If G = Nu is a proper phylogenetic network with |V(Nu)| ≥ 2 and |X| ≥ 2 and \( \mathcal{LS}\left({N}^u\right) \) is a single edge, we call Nu an edge-based network. Else, Nu is called non-edge-based.
We thank Tom Niklas Hamann for bringing this issue to our attention.
Reference
Fischer M, Herbst L, Galla M, Long Y, Wicke K (2020) Classes of tree-based networks. Vis Comput Ind Biomed Art 3:12
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Fischer, M., Herbst, L., Galla, M. et al. Correction to: Classes of tree-based networks. Vis. Comput. Ind. Biomed. Art 4, 2 (2021). https://doi.org/10.1186/s42492-021-00069-x
Published:
DOI: https://doi.org/10.1186/s42492-021-00069-x