{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:12:38Z","timestamp":1743120758126,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":10,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_256","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:34:22Z","timestamp":1214505262000},"page":"573-576","source":"Crossref","is-referenced-by-count":2,"title":["Nearest Neighbor Interchange and Related Distances"],"prefix":"10.1007","author":[{"given":"Bhaskar","family":"DasGupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","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","reference":[{"issue":"2","key":"256_CR1_256","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/PL00008273","volume":"25","author":"B. DasGupta","year":"1999","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J.: On the linear-cost subtree-transfer distance. Algorithmica 25(2), 176\u2013195 (1999)","journal-title":"Algorithmica"},{"key":"256_CR2_256","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees, 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0427\u2013436 (1997)"},{"key":"256_CR3_256","doi-asserted-by":"crossref","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Wang, L., Zhang, L.: Computing Distances between Evolutionary Trees. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Norwell, 2, 35\u201376 (1998)","DOI":"10.1007\/978-1-4613-0303-9_11"},{"key":"256_CR4_256","doi-asserted-by":"crossref","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On Computing the Nearest Neighbor Interchange Distance. In: Du, D.Z., Pardalos, P.M., Wang, J. (eds.) Proceedings of the DIMACS Workshop on Discrete Problems with Medical Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Am. Math. Soc. 55, 125\u2013143 (2000)","DOI":"10.1090\/dimacs\/055\/09"},{"key":"256_CR5_256","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J. Hein","year":"1990","unstructured":"Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185\u2013200 (1990)","journal-title":"Math. Biosci."},{"key":"256_CR6_256","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF00182187","volume":"36","author":"J. Hein","year":"1993","unstructured":"Hein, J.: A\u00a0heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396\u2013405 (1993)","journal-title":"J. Mol. Evol."},{"key":"256_CR7_256","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discret. Appl. Math. 71, 153\u2013169 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"256_CR8_256","first-page":"459","volume":"11","author":"M. Kuhner","year":"1994","unstructured":"Kuhner, M., Felsenstein, J.: A\u00a0simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol. 11(3), 459\u2013468 (1994)","journal-title":"Mol. Biol. Evol."},{"key":"256_CR9_256","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0022-5193(73)90251-8","volume":"38","author":"G.W. Moore","year":"1973","unstructured":"Moore, G.W., Goodman, M., Barnabas, J.: An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. J.\u00a0Theor. Biol. 38, 423\u2013457 (1973)","journal-title":"J. Theor. Biol."},{"key":"256_CR10_256","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(71)90020-7","volume":"11","author":"D.F. Robinson","year":"1971","unstructured":"Robinson, D.F.: Comparison of labeled trees with valency three. J\u00a0Combinator. Theory Series B 11, 105\u2013119 (1971)","journal-title":"J. Comb. Theor."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:19:28Z","timestamp":1662175168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_256"}},"subtitle":["1999; DasGupta, He, Jiang, Li, Tromp, Zhang"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_256","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}