{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:59Z","timestamp":1725487079187},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-33521-8_16","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T03:10:01Z","timestamp":1183432201000},"page":"163-172","source":"Crossref","is-referenced-by-count":0,"title":["A Similarity Measure between Tandem Duplication Trees"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Koperwas","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"1. Benson G., Dong L. (1999) Reconstructing the Duplication History of a Tandem Repeat. Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology ISMB-99, 44\u201353"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1093\/oxfordjournals.molbev.a004081","volume":"19","author":"O. Elemento","year":"2002","unstructured":"2. Elemento O. et al. (2002) Reconstructing The duplication History Of Tandemly Repeated Genes. Mol.Biol.Evol, 19, 278\u2013288","journal-title":"Mol.Biol.Evol"},{"key":"16_CR3","first-page":"226","volume-title":"A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining","author":"M. Ester","year":"1996","unstructured":"3. Ester M. et al. (1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, 226\u2013231"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"4. Gascuel O. The Combinatorics of Tandem Duplication Trees Systematic Biology 52(1), 110\u2013118","DOI":"10.1080\/10635150309353"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"5. Klein P. (1998) Computing the Edit-Distance between Unrooted Ordered Trees, Proceedings of the 6th Annual European Symposium on Algorithms, August 24-26, 91\u2013102","DOI":"10.1007\/3-540-68530-8_8"},{"key":"16_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86659-3","volume-title":"Evolution by Gene Duplication","author":"S. Ohno","year":"1970","unstructured":"6. Ohno S. (1970) Evolution by Gene Duplication. Springer, New York"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1142\/S012905410400239X","volume":"15","author":"E. Rivals","year":"2004","unstructured":"7. Rivals E. (2004) A Survey on Algorithmic Aspects of Tandem Repeats Evolution International Journal of Foundations of Computer Science, Vol. 15, no. 2, 225\u2013257","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR8","unstructured":"8. Tandem Repeats Database http:\/\/tandem.bu.edu"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-33521-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:56Z","timestamp":1605646556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-33521-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540335207"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-33521-8_16","relation":{},"subject":[]}}