{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:20:37Z","timestamp":1743052837259,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":10,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_256","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:18Z","timestamp":1461268998000},"page":"1402-1405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"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":"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","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"unstructured":"DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (1997) On distances between phylogenetic trees. In: 8th annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp\u00a0427\u2013436","key":"254_CR148"},{"key":"254_CR149","first-page":"35","volume-title":"Handbook of combinatorial optimization","author":"B DasGupta","year":"1998","unstructured":"DasGupta B, He X, Jiang T, Li M, Tromp J, Wang L, Zhang L (1998) Computing distances between evolutionary trees. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization, vol\u00a02. Kluwer Academic, Norwell, pp\u00a035\u201376"},{"issue":"2","key":"254_CR1410","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 (1999) On the linear-cost subtree-transfer distance. Algorithmica 25(2):176\u2013195","journal-title":"Algorithmica"},{"key":"254_CR1411","series-title":"DIMACS series in discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1090\/dimacs\/055\/09","volume-title":"Proceedings of the DIMACS workshop on discrete problems with medical applications","author":"B DasGupta","year":"2000","unstructured":"DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (2000) On computing the nearest neighbor interchange distance. In: Du DZ, Pardalos PM, Wang J (eds) Proceedings of the DIMACS workshop on discrete problems with medical applications. DIMACS series in discrete mathematics and theoretical computer science, vol\u00a055. American Mathematical Society, Providence, Rhode Island, USA, pp\u00a0125\u2013143"},{"key":"254_CR1412","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 (1990) Reconstructing evolution of sequences subject to recombination using parsimony. Math Biosci 98:185\u2013200","journal-title":"Math Biosci"},{"key":"254_CR1413","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF00182187","volume":"36","author":"J Hein","year":"1993","unstructured":"Hein J (1993) A heuristic method to reconstruct the history of sequences subject to recombination. J Mol Evol 36:396\u2013405","journal-title":"J Mol Evol"},{"key":"254_CR1414","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 (1996) On the complexity of comparing evolutionary trees. Discret Appl Math 71:153\u2013169","journal-title":"Discret Appl Math"},{"issue":"3","key":"254_CR1415","first-page":"459","volume":"11","author":"M Kuhner","year":"1994","unstructured":"Kuhner M, Felsenstein J (1994) A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol Biol Evol 11(3):459\u2013468","journal-title":"Mol Biol Evol"},{"key":"254_CR1416","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0022-5193(73)90251-8","volume":"38","author":"GW Moore","year":"1973","unstructured":"Moore GW, Goodman M, Barnabas J (1973) An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. J Theor Biol 38:423\u2013457","journal-title":"J Theor Biol"},{"key":"254_CR1417","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(71)90020-7","volume":"11","author":"DF Robinson","year":"1971","unstructured":"Robinson DF (1971) Comparison of labeled trees with valency three. J Comb Theory Ser B 11:105\u2013119","journal-title":"J Comb Theory Ser B"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:43:25Z","timestamp":1553100205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_256","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}