{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T15:28:44Z","timestamp":1747322924538,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648246"},{"type":"electronic","value":"9783540685357"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","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":[[1998]]},"DOI":"10.1007\/3-540-68535-9_12","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:31:22Z","timestamp":1193473882000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Better Approximation of Diagonal-Flip Transformation and Rotation Transformation"],"prefix":"10.1007","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/00029890.1994.11996934","volume":"89","author":"D. Aldous","year":"1994","unstructured":"D. Aldous, Triangulating the circle, at random. Amer Math. Monthly89(1994), 223\u2013234.","journal-title":"Amer Math. Monthly"},{"key":"12_CR2","unstructured":"B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang, On distance between phylogenetic trees. Proc. of the SIAM-ACM 8th Annual Symposium on Discrete Algorithms, 427\u2013436, 1997."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K. Culik","year":"1982","unstructured":"K. Culik and D. Wood, A note on some tree similarity measures, Information Processing Letters15(1982), 39\u201342.","journal-title":"Information Processing Letters"},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-58325-4_179","volume-title":"Proceeding of the 5th Inter. Symposium on Algorithm and Computation","author":"J.-Y. Cai","year":"1994","unstructured":"J.-Y. Cai and M. D. Hirsch, Rotation distance, triangulation of planar surfaces and hyperbolic geometry, Proceeding of the 5th Inter. Symposium on Algorithm and Computation, Lecture Notes in Computer Science, vol. 834, 172\u2013180, 1994."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(73)90076-9","volume":"4","author":"A. K. Dewdney","year":"1973","unstructured":"A. K. Dewdney, Wagner\u2019s theorem for torus graphs, Discrete Math. 4(1973), 139\u2013149.","journal-title":"Discrete Math"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"L. Guibas and J. Hershberger, Morphing simple polygons, Proceeding of the ACM 10th Annual Sym. of Comput. Geometry, 267\u2013276, 1994.","DOI":"10.1145\/177424.177987"},{"key":"12_CR7","unstructured":"S. Hanke, T. Ottmann and S. Schuierer, The edge-flipping distance of triangulations. Proc. of the European Workshop of Comput. Geometry, 1996. Technical Report 76, Insttut fur Informatik, Universitat Freiburg, 1996."},{"key":"12_CR8","unstructured":"J. Hershberger and S. Suri, Morphing binary trees. Proceeding of the ACM-SIAM 6th Annual Symposium of Discrete Algorithms, 396\u2013404, 1995."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"F. Hurtado, M. Noy, and J. Urrutia, Flipping edges in triangulations, Proc. of the ACM 12th Annual Sym. of Comput. Geometry, 214\u2013223, 1996.","DOI":"10.1145\/237218.237367"},{"key":"12_CR10","volume-title":"The art of computer programming, Vol. 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The art of computer programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973."},{"key":"12_CR11","unstructured":"D. Knuth, Computer Musings (Videotape): The associative law, or the anatomy of rotations in binary trees, University Video Communications, 1993."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0020-0190(87)90214-6","volume":"25","author":"J. Pallo","year":"1987","unstructured":"J. Pallo, On rotation distance in the lattice of binary trees, Infor. Proc. Letters25(1987), 369\u2013373.","journal-title":"Infor. Proc. Letters"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mach.32(1985), 652\u2013686.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"D. D. Sleator, R. Tarjan and W. Thurston, Rotation distance, in T.M. Cover and B. Gopinath eds, Open problems in communication and computation, Springer-Verlag, 1987.","DOI":"10.1007\/978-1-4612-4808-8_36"},{"key":"12_CR15","unstructured":"D. D. Sleator, R. Tarjan and W. Thurston, Rotation distance, triangulations, and hyperbolic geometry, Proc. of the 18th Annual ACM Symposium on Theory of Comput., Berkeley, CA., 122\u2013135, 1986. Also appearing on J. of American Math. Soc. 1(1988), No. 3, 647 \u2014 681."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1137\/0405034","volume":"5","author":"D. D. Sleator","year":"1992","unstructured":"D. D. Sleator, R. Tarjan and W. Thurston, Short encoding of evolving structures, SIAM J. Disc. Math.5(1992), 428\u2013450.","journal-title":"SIAM J. Disc. Math."},{"key":"12_CR17","unstructured":"D. Swofford, G. J. Olsen, P. J. Waddell and D. M. Hillis, Phylogenetic Inference, In Molecular Systematics, 2nd Edition, edited by D. M. Hillis, C. Moritz and B. K. Mable, Sinauer Associates, Mass., 1996."},{"key":"12_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan, Data structures and network algorithms, Soc. Indus. Appl. Math., Philadelphia, PA. 1983."},{"key":"12_CR19","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"K. Wagner, Bemerkungen zum vierfarbenproblem, J. Deutschen Math.-Verin. 46(1936), 26\u201332.","journal-title":"J. Deutschen Math.-Verin"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68535-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:52:10Z","timestamp":1589881930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68535-9_12"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648246","9783540685357"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-68535-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"4 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}