{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:49Z","timestamp":1725512029115},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797203"},{"type":"electronic","value":"9783540797210"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79721-0_81","type":"book-chapter","created":{"date-parts":[[2008,5,12]],"date-time":"2008-05-12T14:22:49Z","timestamp":1210602169000},"page":"604-611","source":"Crossref","is-referenced-by-count":1,"title":["Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Koperwas","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"81_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-540-71618-1_78","volume-title":"Adaptive and Natural Computing Algorithms","author":"J. Koperwas","year":"2007","unstructured":"Koperwas, J., Walczak, K.: Clustering of leaf-labelled trees. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol.\u00a04431, pp. 702\u2013710. Springer, Heidelberg (2007)"},{"key":"81_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-540-73451-2_77","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"J. Koperwas","year":"2007","unstructured":"Koperwas, J., Walczak, K.: Clustering of leaf labeled-trees on free leafset. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 736\u2013745. Springer, Heidelberg (2007)"},{"key":"81_CR3","unstructured":"Bryant, D.: Building trees, hunting for trees, and comparing trees. Theory And Method. In: Phylogenetic Analysis. Ph.D Thesis University of Canterbury (1997)"},{"key":"81_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D. Robinson","year":"1981","unstructured":"Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Math. Biosciences.\u00a053, 131\u2013147 (1981)","journal-title":"Math. Biosciences."},{"key":"81_CR5","first-page":"241","volume":"37","author":"P. Jaccard","year":"1901","unstructured":"Jaccard, P.: Bulletin del la Soci\u00e9t\u00e9 Vaudoisedes Sciences Naturelles\u00a037, 241\u2013272 (1901)","journal-title":"Vaudoisedes Sciences Naturelles"},{"key":"81_CR6","doi-asserted-by":"crossref","unstructured":"Bryant, D.: The Splits in the Neighborhood of a Tree. Ann. Combinatorics 8 (2004)","DOI":"10.1007\/s00026-004-0200-z"},{"key":"81_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-540-78757-0_9","volume-title":"EvoBIO 2008","author":"J. Koperwas","year":"2008","unstructured":"Koperwas, J., Walczak, K.: Frequent subsplit representation of leaf-labelled trees. In: EvoBIO 2008. LNCS, vol.\u00a04973, pp. 95\u2013105. Springer, Heidelberg (2008)"},{"key":"81_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/bioinformatics\/18.suppl_1.S285","volume":"18","author":"C. Stockham","year":"2002","unstructured":"Stockham, C., Wang, L.S., Warnow, T.: Statistically based postprocessing of phylogenetic analysis by clustering. Bionformatics\u00a018, 285\u2013293 (2002)","journal-title":"Bionformatics"},{"key":"81_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C.R. Finden","year":"1985","unstructured":"Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. Journal of Classification\u00a02, 255\u2013276 (1985)","journal-title":"Journal of Classification"},{"key":"81_CR10","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"163","volume-title":"A classification of consensus methods for phylogenetics, In Bioconsensus","author":"D. Bryant","year":"2002","unstructured":"Bryant, D.: A classification of consensus methods for phylogenetics, In Bioconsensus. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a061, pp. 163\u2013184. AMS Press, New York (2002)"},{"key":"81_CR11","doi-asserted-by":"crossref","unstructured":"Amenta, N., Klingner, J.: Case study: Visualizing sets of evolutionary trees. In: 8th IEEE Symposium on Information Visualization, pp. 71\u201374 (2002)","DOI":"10.1109\/INFVIS.2002.1173150"},{"key":"81_CR12","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Int\u2019l. In: Conference on Very Large Databases (VLDB 1994), Santiago, Chile, pp. 487\u2013499 (1994)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79721-0_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:49Z","timestamp":1619522989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79721-0_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797203","9783540797210"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79721-0_81","relation":{},"subject":[]}}