{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:26:29Z","timestamp":1787325989491,"version":"build-2736575974"},"reference-count":29,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>The ease with which genomic data can now be generated using Next Generation Sequencing technologies combined with a wealth of legacy data holds great promise for exciting new insights into the evolutionary relationships between and within the kingdoms of life. At the subspecies level (e.g., varieties or strains) dendograms, that is, certain edge-weighted rooted trees whose leaves are the elements of a set $X$ of organisms under consideration, are often used to represent those relationships. As is well known, dendrograms can be uniquely reconstructed from distances provided all distances on $X$ are known. More often than not, real biological datasets do not satisfy this assumption, implying that the sought dendrogram need not be uniquely determined by the available distances with regard to topology, edge-weighting, or both. To better understand the structural properties a set $\\mathcal{L}\\subseteq\\binom{X}{2}$ has to satisfy to overcome this problem, various types of lassos have been introduced. Here, we focus on the question of when a lasso uniquely determines the topology of a dendrogram; that is, it is a topological lasso for its underlying tree. We show that any set-inclusion minimal topological lasso for such a tree $T$ can be transformed into a structurally nice minimal topological lasso for $T$. Calling such a lasso a distinguished minimal topological lasso for $T$, we characterize it in terms of the novel concept of a cluster marker map for $T$. In addition, we present novel results concerning the heritability of such lassos in the context of the subtree and supertree problems.<\/jats:p>","DOI":"10.1137\/130927644","type":"journal-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T11:29:18Z","timestamp":1432639758000},"page":"940-961","source":"Crossref","is-referenced-by-count":1,"title":["Distinguished Minimal Topological Lassos"],"prefix":"10.1137","volume":"29","author":[{"given":"Katharina T.","family":"Huber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Kettleborough","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,5,26]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2013.779268"},{"key":"atypb2","unstructured":"J. P. Barthe\u0301lemy and A. Gue\u0301noche,\n                      Trees and Proximity Representations\n                      , Wiley, New York, 1991."},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"O. R. P. Bininda-Emonds,\n                      Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life\n                      , Springer, New York, 2004.","DOI":"10.1007\/978-1-4020-2330-9"},{"key":"atypb4","first-page":"160","author":"Brandsta\u0308dt A.","year":"2008","journal-title":"Heidelberg"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0500-7-841"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-011-1040-3"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01890124"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"R. Diestel,\n                      Graph Theory\n                      , 3rd ed., Springer, Berlin, 2005.","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp327"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"A. Dress, K. T. Huber, J. Koolen, V. Moulton, and A. Spillner,\n                      Basic Phylogenetic Combinatorics\n                      , Cambridge University Press, Cambridge, UK, 2012.","DOI":"10.1017\/CBO9781139019767"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/s00285-011-0450-4"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188585"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00045-3"},{"key":"atypb14","first-page":"51","volume":"146","author":"Gue\u0301noche A.","year":"1999","journal-title":"Math. Inform. Sci. Humaines"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00294-2"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00187-4"},{"key":"atypb17","unstructured":"F. Harary,\n                      Graph Theory\n                      , Addison-Wesley, Reading, MA, 1972."},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"H. Huang and L. Knowles,\n                      Unforeseen consequences of excluding missing data from next-generation sequences: Simulation study of RAD sequences\n                      , Syst. Biol., Jul. 4, 2014, PII syu046 (Epub ahead of print).","DOI":"10.1093\/sysbio\/syu046"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-013-9815-8"},{"key":"atypb20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.37236\/3388","volume":"21","author":"Huber K. T.","year":"2014","journal-title":"Electron. J. Combin."},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"G. Kettleborough, J. Dicks, I. N. Roberts, and K. T. Huber,\n                      Reconstructing (super)trees from data sets with missing distances: Not all is lost\n                      , Mol. Biol. Evol., Feb. 4, 2015, PII msv027 (Epub ahead of print).","DOI":"10.1093\/molbev\/msv027"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2997"},{"key":"atypb23","first-page":"238","author":"Makarenkov V.","year":"2001","journal-title":"Guadeloupe"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.2298\/PIM0693001M"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1093\/molbev\/msh182"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2148-10-155"},{"key":"atypb27","first-page":"107","author":"Schader M.","year":"1992","journal-title":"New York"},{"key":"atypb28","unstructured":"C. Semple and M. Steel,\n                      Phylogenetics\n                      , Oxford Lecture Ser. Math. Appl. 24, Oxford University Press, Oxford, UK, 2003."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2009.08.009"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/130927644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:25:08Z","timestamp":1787322308000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/130927644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/130927644"],"URL":"https:\/\/doi.org\/10.1137\/130927644","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}