Obtaining splits from cut sets of tight spans

被引:2
作者
Dress, Andreas [1 ]
Moulton, Vincent [2 ]
Spinner, Andreas [3 ]
Wu, Taoyang [2 ,4 ]
机构
[1] Chinese Acad Sci, Shanghai Inst Biol Sci, CAS MPG Partner Inst Computat Biol PICB, Shanghai 200031, Peoples R China
[2] Univ E Anglia, Sch Comp Sci, Norwich NR4 7TJ, Norfolk, England
[3] Ernst Moritz Arndt Univ Greifswald, Dept Math & Comp Sci, Greifswald, Germany
[4] Natl Univ Singapore, Dept Math, Singapore 119076, Singapore
关键词
Metric space; Tight span; Split index; Cut set; Phylogenetic network; PHYLOGENETIC NETWORKS; METRIC-SPACES; DECOMPOSITION;
D O I
10.1016/j.dam.2013.02.001
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
To any metric D on a finite set X, one can associate a metric space T (D) known as its tight span. Properties of T (D) often reveal salient properties of D. For example, cut sets of T(D), i.e., subsets of T (D) whose removal disconnect T (D), can help to identify clusters suggested by D and indicate how T (D) (and hence D) may be decomposed into simpler components. Given a bipartition or splits of X, we introduce in this paper a real-valued index epsilon((D,S)) that comes about by considering cut sets of T (D). We also show that this index is intimately related to another, more easily computable index delta((D,S)) whose definition does not directly depend on T (D). In addition, we provide an illustration for how these two new indices could help to extend and complement current distance-based methods for phylogenetic network construction such as split decomposition and NeighborNet. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:1409 / 1420
页数:12
相关论文
共 41 条
  • [31] Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
    Huber, Katharina T.
    van Iersel, Leo
    Moulton, Vincent
    Scornavacca, Celine
    Wu, Taoyang
    ALGORITHMICA, 2017, 77 (01) : 173 - 200
  • [32] Modeling Neurovascular Coupling from Clustered Parameter Sets for Multimodal EEG-NIRS
    Talukdar, M. Tanveer
    Frost, H. Robert
    Diamond, Solomon G.
    COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2015, 2015
  • [33] Effects of precursor chemistry and thermal treatment conditions on obtaining phase pure bismuth ferrite from aqueous gel precursors
    Hardy, A.
    Gielis, S.
    Van den Rul, H.
    D'Haen, J.
    Van Bael, M. K.
    Mullens, J.
    JOURNAL OF THE EUROPEAN CERAMIC SOCIETY, 2009, 29 (14) : 3007 - 3013
  • [34] Obtaining of Ni/NiO nanopowder from aqua solutions of Ni(CH3COO)2 ammonia complexes
    Dulina, Iryna
    Lobunets, Tetyana
    Klochkov, Leonid
    Ragulya, Andrey
    NANOSCALE RESEARCH LETTERS, 2015, 10
  • [36] COMPUTATION OF SOBOL INDICES IN GLOBAL SENSITIVITY ANALYSIS FROM SMALL DATA SETS BY PROBABILISTIC LEARNING ON MANIFOLDS
    Arnst, Maarten
    Soize, Christian
    Bulthuis, Kevin
    INTERNATIONAL JOURNAL FOR UNCERTAINTY QUANTIFICATION, 2021, 11 (02) : 1 - 23
  • [37] Spatial variability of soil fungal and bacterial abundance: Consequences for carbon turnover along a transition from a forested to clear-cut site
    Churchland, Carolyn
    Grayston, Sue J.
    Bengtson, Per
    SOIL BIOLOGY & BIOCHEMISTRY, 2013, 63 : 5 - 13
  • [38] Development of environmentally oriented processes for obtaining the articles from aluminum powders by powder metallurgy: Report 1. Functional simulation of processes of powder metallurgy of aluminum
    A. Yu. Kem
    Russian Journal of Non-Ferrous Metals, 2011, 52 : 324 - 328
  • [39] Radiation-thermocatalytic and thermocatalytic properties of n-ZrO2-n-SiO2 systems in the process of obtaining hydrogen from water at different temperatures
    Imanova, Gunel T.
    Agayev, Teymur N.
    Garibov, Adil A.
    Melikova, Sevinj Z.
    Jabarov, Sakin H.
    Akhundzada, Haji, V
    JOURNAL OF MOLECULAR STRUCTURE, 2021, 1241
  • [40] Development of environmentally oriented processes for obtaining the articles from aluminum powders by powder metallurgy: Report 1. Functional simulation of processes of powder metallurgy of aluminum
    Kem, A. Yu.
    RUSSIAN JOURNAL OF NON-FERROUS METALS, 2011, 52 (03) : 324 - 328