{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:05:53Z","timestamp":1768305953863,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_11","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"148-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unique Least Common Ancestors and\u00a0Clusters in\u00a0Directed Acyclic Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0038-5492","authenticated-orcid":false,"given":"Ameera Vaheeda","family":"Shanavas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7257-6031","authenticated-orcid":false,"given":"Manoj","family":"Changat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1620-5508","authenticated-orcid":false,"given":"Marc","family":"Hellmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02458841","volume":"51","author":"HJ Bandelt","year":"1989","unstructured":"Bandelt, H.J., Dress, A.W.M.: Weak hierarchies associated with similarity measures \u2013 an additive clustering technique. Bull. Math. Biol. 51, 133\u2013166 (1989). https:\/\/doi.org\/10.1007\/BF02458841","journal-title":"Bull. Math. Biol."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(94)00105-R","volume":"136","author":"HJ Bandelt","year":"1994","unstructured":"Bandelt, H.J., Dress, A.W.M.: An order theoretic framework for overlapping clustering. Discret. Math. 136, 21\u201337 (1994). https:\/\/doi.org\/10.1016\/0012-365X(94)00105-R","journal-title":"Discret. Math."},{"issue":"8","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1016\/j.dam.2007.05.024","volume":"156","author":"JP Barth\u00e9lemy","year":"2008","unstructured":"Barth\u00e9lemy, J.P., Brucker, F.: Binary clustering. Discret. Appl. Math. 156(8), 1237\u20131250 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.05.024","journal-title":"Discret. Appl. Math."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Pemmasani, G., Skiena, S., Sumazin, P.: Finding least common ancestors in directed acyclic graphs. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, pp. 845\u2013853. Society for Industrial and Applied Mathematics, Washington, D.C., USA (2001). https:\/\/doi.org\/10.5555\/365411.365795","DOI":"10.5555\/365411.365795"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.dam.2016.12.019","volume":"222","author":"P Bertrand","year":"2017","unstructured":"Bertrand, P., Diatta, J.: Multilevel clustering models and interval convexities. Discret. Appl. Math. 222, 54\u201366 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.12.019","journal-title":"Discret. Appl. Math."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Changat, M., Mathews, J., Peterin, I., Narasimha-Shenoi, P.G.: $$n$$-ary transit functions in graphs. Discussiones Math. Graph Th. 30(4), 671\u2013685 (2010). https:\/\/eudml.org\/doc\/270794","DOI":"10.7151\/dmgt.1522"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Changat, M., Narasimha-Shenoi, P.G., Stadler, P.F.: Axiomatic characterization of transit functions of weak hierarchies. Art Discret. Appl. Math. 2, P1.01 (2019). https:\/\/doi.org\/10.26493\/2590-9770.1260.989","DOI":"10.26493\/2590-9770.1260.989"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Changat, M., Shanavas, A.V., Stadler, P.F.: Transit functions and pyramid-like binary clustering systems. Technical report. 2212.08721, arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2212.08721","DOI":"10.48550\/arXiv.2212.08721"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Dress, A.: Towards a theory of holistic clustering. In: Mirkin, B., McMorris, F.R., Roberts, F.S., Rzhetsky, A. (eds.) Mathematical Hierarchies and Biology. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 37, pp. 271\u2013290. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/037\/19"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s12064-023-00398-w","volume":"142","author":"M Hellmuth","year":"2023","unstructured":"Hellmuth, M., Schaller, D., Stadler, P.F.: Clustering systems of phylogenetic networks. Theory Biosci. 142(4), 301\u2013358 (2023). https:\/\/doi.org\/10.1007\/s12064-023-00398-w","journal-title":"Theory Biosci."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"DH Huson","year":"2011","unstructured":"Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol. 3, 23\u201335 (2011). https:\/\/doi.org\/10.1093\/gbe\/evq077","journal-title":"Genome Biol. Evol."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11567752_6","volume-title":"Transactions on Computational Systems Biology II","author":"L Nakhleh","year":"2005","unstructured":"Nakhleh, L., Wang, L.-S.: Phylogenetic networks: properties and relationship to trees and clusters. In: Priami, C., Zelikovsky, A. (eds.) Transactions on Computational Systems Biology II. LNCS, vol. 3680, pp. 82\u201399. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11567752_6"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Nebesk\u00fd, L.: On a certain numbering of the vertices of a hypergraph. Czechoslovak Math. J. 33, 1\u20136 (1983). https:\/\/doi.org\/10.21136\/CMJ.1983.101849","DOI":"10.21136\/CMJ.1983.101849"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:25Z","timestamp":1768281745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}