{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T04:25:14Z","timestamp":1662179114301},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:p> The subtree transfer (STT) distance is one of the distance metric for comparing phylogenies. Previous work on computing the STT distance considered degree-3 trees only. In this paper, we give an approximation algorithm for the STT distance for degree-d trees with arbitrary d and with generalized STT operations. Also, some NP-hardness results related to STT distance are presented. <\/jats:p>","DOI":"10.1142\/s0129054104002807","type":"journal-article","created":{"date-parts":[[2004,12,28]],"date-time":"2004-12-28T12:24:48Z","timestamp":1104236688000},"page":"893-909","source":"Crossref","is-referenced-by-count":3,"title":["SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES"],"prefix":"10.1142","volume":"15","author":[{"given":"WING-KAI","family":"HON","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, China"}]},{"given":"TAK-WAH","family":"LAM","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, China"}]},{"given":"SIU-MING","family":"YIU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, China"}]},{"given":"MING-YANG","family":"KAO","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Northwestern University, Evanston, Illinois 60201, USA"}]},{"given":"WING-KIN","family":"SUNG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National University of Singapore, Singapore"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008273"},{"key":"rf2","unstructured":"B.\u00a0DasGupta, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (1997)\u00a0pp. 427\u2013436."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908061"},{"key":"rf4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(90)90123-G"},{"key":"rf6","first-page":"396","volume":"36","author":"Hein J.","journal-title":"Jounal of Molecular Evolution"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00062-5"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1996.0188"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(81)90043-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:39:40Z","timestamp":1565138380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":9,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1142\/S0129054104002807"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002807","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}