{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:45Z","timestamp":1725567045092},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_27","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"251-262","source":"Crossref","is-referenced-by-count":10,"title":["String Coding of Trees with Locality and Heritability"],"prefix":"10.1007","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Quarterly Journal of Mathematics\u00a023, 376\u2013378 (1889)","journal-title":"Quarterly Journal of Mathematics"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-24698-5_38","volume-title":"LATIN 2004: Theoretical Informatics","author":"S. Caminiti","year":"2004","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: A unified approach to coding labeled trees. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 339\u2013348. Springer, Heidelberg (2004)"},{"key":"27_CR3","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. McGraw-Hill, New York (2001)"},{"key":"27_CR4","unstructured":"Deo, N., Micikevicius, P.: Parallel algorithms for computing Pr\u00fcfer-like codes of labeled trees. Computer Science Technical Report, CS-TR-01-06 (2001)"},{"key":"27_CR5","first-page":"754","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000)","author":"W. Edelson","year":"2000","unstructured":"Edelson, W., Gargano, M.L.: Feasible encodings for GA solutions of constrained minimal spanning tree problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), p. 754. Morgan Kaufmann Publishers, San Francisco (2000)"},{"key":"27_CR6","unstructured":"Gottlieb, J., Raidl, G., Julstrom, B.A., Rothlauf, F.: Pr\u00fcfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 343\u2013350 (2001)"},{"key":"27_CR7","unstructured":"Julstrom, B.A.: The Blob Code: A Better String Coding of Spanning Trees for Evolutionary Search. In: 2001 Genetic and Evolutionary Computation Conference Workshop Program, pp. 256\u2013261 (2001)"},{"key":"27_CR8","unstructured":"Kelmans, A., Pak, I., Postnikov, A.: Tree and forest volumes of graphs. DIMACS Technical Report 2000-03 (2000)"},{"key":"27_CR9","first-page":"7","volume":"130","author":"V. Kumar","year":"1998","unstructured":"Kumar, V., Deo, N., Kumar, N.: Parallel generation of random trees and connected graphs. Congressus Numerantium\u00a0130, 7\u201318 (1998)","journal-title":"Congressus Numerantium"},{"key":"27_CR10","unstructured":"Picciotto, S.: How to encode a tree. Ph.D. Thesis, University of California, San Diego (1999)"},{"key":"27_CR11","first-page":"142","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer Beweis eines Satzes \u00fcber Permutationen. Archiv f\u00fcr Mathematik und Physik\u00a027, 142\u2013144 (1918)","journal-title":"Archiv f\u00fcr Mathematik und Physik"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","volume":"30","author":"G. Zhou","year":"1997","unstructured":"Zhou, G., Gen, M.: A note on genetic algorithms for degree-constrained spanning tree problems. Networks\u00a030(2), 91\u201395 (1997)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:53:31Z","timestamp":1553154811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11533719_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}