{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:53:52Z","timestamp":1759683232022},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0031-3203(99)00199-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:01:39Z","timestamp":1027594899000},"page":"127-137","source":"Crossref","is-referenced-by-count":36,"title":["Finding similar consensus between trees: an algorithm and a distance hierarchy"],"prefix":"10.1016","volume":"34","author":[{"given":"Jason T.L.","family":"Wang","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\/S0031-3203(99)00199-5_BIB1","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218001488000157","article-title":"The tree-to-tree editing problem","volume":"2","author":"Tanaka","year":"1988","journal-title":"Int. J. Pattern Recognition Artif. Intell."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB3","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/TPAMI.1982.4767246","article-title":"Distance transform for images represented by quadtrees","volume":"4","author":"Samet","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB4","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/TPAMI.1986.4767798","article-title":"A tree system approach for fingerprint pattern recognition","volume":"8","author":"Moyer","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB5","doi-asserted-by":"crossref","unstructured":"M. Neff, B.K. Boguraev, Dictionaries, dictionary grammars and dictionary entry parsing, Proceedings 27th Annual Meeting of the Association for Computational Linguistics, 1989.","DOI":"10.3115\/981623.981635"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB6","doi-asserted-by":"crossref","unstructured":"P. Kilpelainen, H. Mannila, Retrieval from hierarchical texts by partial patterns, Proceedings 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1993, pp. 214\u2013222.","DOI":"10.1145\/160688.160722"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB7","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. Ass. Comput. Mach"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB8","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\/S0031-3203(99)00199-5_BIB9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","article-title":"Fast algorithms for the constrained editing distance between ordered labeled trees and related problems","volume":"28","author":"Zhang","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB10","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB11","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, K. Zhang, C.Y. Chang, Identifying approximately common substructures in trees based on a restricted edit distance, Inform. Sci. accepted.","DOI":"10.1016\/S0020-0255(99)00100-0"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/spe.4380210706","article-title":"Identifying syntactic differences between two programs","volume":"21","author":"Yang","year":"1991","journal-title":"Software \u2014 Practice Exper."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(95)80015-8","article-title":"Alignment of trees \u2013 an alternative to tree edit","volume":"143","author":"Jiang","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.2307\/2412432","article-title":"Consensus techniques and the comparison of taxonomic trees","volume":"21","author":"Adams","year":"1972","journal-title":"Systematic Zool."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","article-title":"Efficient algorithms for inferring evolutionary trees","volume":"21","author":"Gusfield","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","article-title":"Comparison of phylogenetic trees","volume":"53","author":"Robinson","year":"1981","journal-title":"Math. Biosci."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB17","series-title":"Analysis of Human Genetic Linkage","author":"Ott","year":"1991"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB18","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TSE.1975.6312866","article-title":"The source code control system","volume":"1","author":"Rochkind","year":"1975","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB20","first-page":"63","article-title":"Transducers and repetitions, Theoreti","volume":"45","author":"Crochemore","year":"1986","journal-title":"Comput. Sci."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB21","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(NlogN) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0031-3203(99)00199-5_BIB22","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/34.709622","article-title":"An algorithm for finding the largest approximately common substructures of two trees","volume":"20","author":"Wang","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB23","unstructured":"J.T.L. Wang, K. Zhang, Identifying consensus of trees through alignment, submitted for publication."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB24","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/69.298173","article-title":"A system for approximate tree matching","volume":"6","author":"Wang","year":"1994","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB25","doi-asserted-by":"crossref","first-page":"2769","DOI":"10.1093\/nar\/22.14.2769","article-title":"Discovering active motifs in sets of related protein sequences and using them for classification","volume":"22","author":"Wang","year":"1994","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB26","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB27","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0031-3203(99)00199-5_BIB28","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399001995?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399001995?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:52:06Z","timestamp":1556373126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320399001995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0031320399001995"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(99)00199-5","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}