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 条
  • [1] On Tight Spans for Directed Distances
    Hirai, Hiroshi
    Koichi, Shungo
    ANNALS OF COMBINATORICS, 2012, 16 (03) : 543 - 569
  • [2] Metric stability of trees and tight spans
    Lang, Urs
    Pavon, Mael
    Zuest, Roger
    ARCHIV DER MATHEMATIK, 2013, 101 (01) : 91 - 100
  • [3] Metric stability of trees and tight spans
    Urs Lang
    Maël Pavón
    Roger Züst
    Archiv der Mathematik, 2013, 101 : 91 - 100
  • [4] Trees, tight-spans and point configurations
    Herrmann, Sven
    Moulton, Vincent
    DISCRETE MATHEMATICS, 2012, 312 (16) : 2506 - 2521
  • [5] Searching for realizations of finite metric spaces in tight spans
    Herrmann, Sven
    Moulton, Vincent
    Spillner, Andreas
    DISCRETE OPTIMIZATION, 2013, 10 (04) : 310 - 319
  • [6] TIGHT SPANS, ISBELL COMPLETIONS AND SEMI-TROPICAL MODULES
    Willerton, Simon
    THEORY AND APPLICATIONS OF CATEGORIES, 2013, 28 : 696 - 732
  • [7] Three new cut sets of fuzzy sets and new theories of fuzzy sets
    Yuan, Xue-hai
    Li, Hongxing
    Lee, E. Stanley
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (05) : 691 - 701
  • [8] Matroids from hypersimplex splits
    Joswig, Michael
    Schroeter, Benjamin
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 151 : 254 - 284
  • [9] Parameterizing cut sets in a graph by the number of their components
    Ito, Takehiro
    Kaminski, Marcin
    Paulusma, Daniel
    Thilikos, Dimitrios M.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6340 - 6350
  • [10] Structures of compactly generated lattices described by cut sets of L-valued sets
    Kai Zuo
    Xue-ping Wang
    Xiaohong Zhang
    Soft Computing, 2019, 23 : 3913 - 3920