{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:16:34Z","timestamp":1770909394163,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613329","type":"print"},{"value":"9783540684619","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_168","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:34:11Z","timestamp":1330292051000},"page":"343-351","source":"Crossref","is-referenced-by-count":13,"title":["Some notes on the nearest neighbour interchange distance"],"prefix":"10.1007","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0165-4896(83)90028-8","volume":"4","author":"R. P. Boland","year":"1983","unstructured":"R. P. Boland, E. K. Brown and W. H. E. Day, Approximating minimum-length-sequence metrics: a cautionary note, Mathematical Social Sciences 4, 261\u2013270, 1983.","journal-title":"Mathematical Social Sciences"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K. Culik II","year":"1982","unstructured":"Karel Culik II and Derick Wood, A note on some tree similarity measures, Information Processing Letters 15, 39\u201342, 1982.","journal-title":"Information Processing Letters"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-5193(83)90341-7","volume":"101","author":"W. H. E. Day","year":"1983","unstructured":"W. H. E. Day, Properties of the Nearest Neighbour Interchange Metric for Tress of Small Size, Journal of Theoretical Biology 101, 275\u2013288, 1983.","journal-title":"Journal of Theoretical Biology"},{"key":"36_CR4","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979."},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0165-4896(83)90029-X","volume":"4","author":"J. P. Jarvis","year":"1983","unstructured":"J. P. Jarvis, J. K. Luedeman and D. R. Shier, Counterexamples in measuring the distance between binary trees, Mathematical Social Sciences 4, 271\u2013274, 1983.","journal-title":"Mathematical Social Sciences"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0022-5193(83)90439-3","volume":"100","author":"J. P. Jarvis","year":"1983","unstructured":"J. P. Jarvis, J. K. Luedeman and D. R. Shier, Counterexamples in measuring the distance between binary trees, Journal of Theoretical Biology 100, 427\u2013433, 1983.","journal-title":"Journal of Theoretical Biology"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01896811","volume":"3","author":"M. K\u0159iv\u00e1nek","year":"1986","unstructured":"M. K\u0159iv\u00e1nek, Computing the Nearest Neighbour Interchange Metric for Unlabeled Binary Trees is NP-Complete, Journal of Classification 3, 55\u201360, 1986.","journal-title":"Journal of Classification"},{"key":"36_CR8","unstructured":"V. King and T. Warnow, On Measuring the nni Distance Between Two Evolutionary Trees, DIMACS mini workshop on combinatorial structures in molecular biology, Rutgers University, Nov 4, 1994."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0022-5193(73)90251-8","volume":"38","author":"G. W. Moore","year":"1973","unstructured":"G. W. Moore, M. Goodman and J. Barnabas, An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets, Journal of Theoretical Biology 38, 423\u2013457, 1973.","journal-title":"Journal of Theoretical Biology"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis, Optimization, Approximation, and complexity classes, Journal of Computer and System Sciences 43, 425\u2013440, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0095-8956(71)90020-7","volume":"11","author":"D. F. Robinson","year":"1971","unstructured":"D. F. Robinson, Comparison of Labeled Trees with Valency Three, Journal of Combinatorial Theory 11, 105\u2013119, 1971.","journal-title":"Journal of Combinatorial Theory"},{"key":"36_CR12","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1137\/0405034","volume":"5","author":"D. Sleator","year":"1992","unstructured":"D. Sleator, R. Tarjan, W. Thurston, Short encodings of evolving structures, SIAM Journal on Discrete Mathematics 5, 428\u2013450, 1992.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0022-5193(78)90137-6","volume":"73","author":"M. S. Waterman","year":"1978","unstructured":"M, S. Waterman and T. F. Smith, On the Similarity of Dendrograms, Journal of Theoretical Biology 73, 789\u2013800, 1978.","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_168.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:37Z","timestamp":1619573497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_168","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}