{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:10:33Z","timestamp":1725505833587},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787563"},{"type":"electronic","value":"9783540787570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78757-0_9","type":"book-chapter","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T13:05:09Z","timestamp":1207141509000},"page":"95-105","source":"Crossref","is-referenced-by-count":1,"title":["Frequent Subsplit Representation of Leaf-Labelled Trees"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Koperwas","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","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":"9_CR2","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"163","volume-title":"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":"9_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Int\u2019l. Conference on Very Large Databases (VLDB 1994), Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"9_CR4","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":"9_CR5","series-title":"Lecture Notes in Computer Science","first-page":"156","volume-title":"Algorithms in Bioinformatics","author":"G. Ganeshkumar","year":"2001","unstructured":"Ganeshkumar, G., Warnow, T.: Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree is Solvable in Polynomial Time. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 156\u2013163. Springer, Heidelberg (2001)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02638451","volume":"10","author":"M.D. Hendy","year":"1993","unstructured":"Hendy, M.D., Penny, D.: Spectral analysis of phylogenetic data. Journal of Classification\u00a010, 5\u201324 (1993)","journal-title":"Journal of Classification"},{"key":"9_CR7","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":"9_CR8","unstructured":"Tubingen, U., Huson, D.: Algorithms in Bioinformatics, Lecture Notes, \n                  \n                    http:\/\/www-ab.informatik.uni-tuebingen.de"},{"key":"9_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-39763-2_13","volume-title":"Algorithms in Bioinformatics","author":"B. Holland","year":"2003","unstructured":"Holland, B., Moulton, V.: Consensus networks: A method for visualising incompatibilities in a collection of trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 165\u2013176. Springer, Heidelberg (2003)"},{"key":"9_CR10","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":"9_CR11","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":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bryant, D.: The Splits in the Neighborhood of a Tree. Ann. Combinatorics\u00a08 (2004)","DOI":"10.1007\/s00026-004-0200-z"},{"key":"9_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78757-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:15Z","timestamp":1619522475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78757-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787563","9783540787570"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78757-0_9","relation":{},"subject":[]}}