{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:24:47Z","timestamp":1773761087101,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,3]],"date-time":"2005-09-03T00:00:00Z","timestamp":1125705600000},"content-version":"vor","delay-in-days":5390,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0196-6774(90)90011-3","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"581-621","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":75,"title":["Fast algorithms for the unit cost editing distance between trees"],"prefix":"10.1016","volume":"11","author":[{"given":"Dennis","family":"Shasha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90011-3_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","article-title":"Parallel construction of a suffix tree with applications","volume":"3","author":"Apostolico","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0196-6774(90)90011-3_BIB2","first-page":"1","article-title":"RNase III stimulates the translations of the cIII gene of bacteriophage lambda","volume":"85","author":"Alluvia","year":"1987"},{"key":"10.1016\/0196-6774(90)90011-3_BIB3","first-page":"517","article-title":"Lysis gene on bacteriophage MS2 is activated by translation termination at the overlapping coat gene","volume":"195","author":"Berkout","year":"1987"},{"key":"10.1016\/0196-6774(90)90011-3_BIB4","series-title":"Combinatorial Algorithms on Words","first-page":"97","article-title":"Efficient and elegant subword tree construction","volume":"Vol. 12","author":"Chen","year":"1985"},{"key":"10.1016\/0196-6774(90)90011-3_BIB5","doi-asserted-by":"crossref","first-page":"7323","DOI":"10.1093\/nar\/10.22.7323","article-title":"Generalized structures of 5s ribonsomal RNA's","volume":"10","author":"Delihas","year":"1982","journal-title":"Nucleic Acid Res."},{"key":"10.1016\/0196-6774(90)90011-3_BIB6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-2836(87)90693-0","article-title":"S4-alpha mRNA translation regulation complex","volume":"196","author":"Deckman","year":"1987","journal-title":"J. Mol. Biol."},{"key":"10.1016\/0196-6774(90)90011-3_BIB7_1","series-title":"Proceedings, 16th ACM Symposium on Theory of Computing","first-page":"240","article-title":"Optimal parallel algorithms for string matching","author":"Galil","year":"1984"},{"key":"10.1016\/0196-6774(90)90011-3_BIB7_2","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Galil","year":"1985","journal-title":"Inform. and Control"},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90011-3_BIB8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/8307.8309","article-title":"Improved string matching with k mismatches","volume":"17","author":"Galil","year":"1986","journal-title":"SIGACT News"},{"key":"10.1016\/0196-6774(90)90011-3_BIB9","doi-asserted-by":"crossref","unstructured":"Z. Galil and R. Giancarlo, Parallel string matching with k mismatches, Theoret. Comput. Sci.51, 341\u2013348.","DOI":"10.1016\/0304-3975(87)90042-9"},{"key":"10.1016\/0196-6774(90)90011-3_BIB10","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","article-title":"Time-space-optimal string matching","volume":"26","author":"Galil","year":"1983","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90011-3_BIB11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90011-3_BIB12","volume":"Vol. I","author":"Knuth","year":"1974"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90011-3_BIB13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","article-title":"A tree-to-tree distance and its application to cluster analysis","author":"Lu","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0196-6774(90)90011-3_BIB14","series-title":"Proceedings 18th ACM Symposium on Theory of Computing","first-page":"220","article-title":"Introducing efficient parallelism into approximate string matching","author":"Landau","year":"1986"},{"key":"10.1016\/0196-6774(90)90011-3_BIB15","unstructured":"B. A. Shapiro, An algorithm for comparing multiple RNA secondary structures, Comput. Appl. Biosci. in press; Image Processing Section, Frederick Cancer Research Facility, Bldg. 469, Room 150, Frederick, MD 21701."},{"key":"10.1016\/0196-6774(90)90011-3_BIB16","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1126\/science.775636","article-title":"Three dimensional structure of a transfer RNA in two crystal forms","volume":"192","author":"Sussman","year":"1976","journal-title":"Science"},{"key":"10.1016\/0196-6774(90)90011-3_BIB17","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983"},{"key":"10.1016\/0196-6774(90)90011-3_BIB18","unstructured":"B. Schieber and U. Vishkin, \u201cParallel Computation of Lowest Common Ancestor in Trees\u201d, NYU Computer Science Technical Report."},{"key":"10.1016\/0196-6774(90)90011-3_BIB19","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","article-title":"The tree-to-tree correction problem","volume":"26","author":"Tai","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90011-3_BIB20","doi-asserted-by":"crossref","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90011-3_BIB21","first-page":"487","article-title":"On approximate string matching","volume":"Vol. 158","author":"Ukkonen","year":"1983"},{"issue":"No. 6","key":"10.1016\/0196-6774(90)90011-3_BIB22","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90011-3_BIB23","article-title":"The Editing Distance between Trees: Algorithms and Applications","author":"Zhang","year":"1989"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:12:55Z","timestamp":1757463175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677490900113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0196677490900113"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90011-3","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast algorithms for the unit cost editing distance between trees","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(90)90011-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}