{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:50:24Z","timestamp":1773276624163,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":["Information Sciences"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0020-0255(00)00014-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"165-189","source":"Crossref","is-referenced-by-count":8,"title":["Identifying consensus of trees through alignment"],"prefix":"10.1016","volume":"126","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\/S0020-0255(00)00014-1_BIB1","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":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB2","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1093\/nar\/19.suppl.2221","article-title":"Genbank","volume":"19","author":"Burks","year":"1991","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB3","first-page":"7","article-title":"A computational procedure for assessing the significance of RNA secondary structure","volume":"6","author":"Chen","year":"1990","journal-title":"Computer Applications in the Biosciences"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetitions","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completenes","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0020-0255(00)00014-1_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","article-title":"Alignment of trees \u2013 An alternative to tree edit","volume":"143","author":"Jiang","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB7","doi-asserted-by":"crossref","unstructured":"S.K. Kannan, E.W. Myers, An algorithm for locating non-overlapping regions of maximum alignment score, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 684, Springer, Berlin, 1993, pp. 74\u201386","DOI":"10.1007\/BFb0029798"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB8","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-2836(89)90468-3","article-title":"Pattern analysis of RNA secondary structure \u2013 similarity and consensus of minimal energy folding","volume":"207","author":"Konings","year":"1989","journal-title":"Journal of Molecular Biology"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB9","first-page":"153","article-title":"A program for predicting significant RNA secondary structures","volume":"4","author":"Le","year":"1988","journal-title":"Computer Applications in the Biosciences"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB10","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":"Journal of Algorithms"},{"issue":"12","key":"10.1016\/S0020-0255(00)00014-1_BIB11","doi-asserted-by":"crossref","first-page":"4829","DOI":"10.1093\/nar\/17.12.4829","article-title":"Detection of common motifs in RNA secondary structures","volume":"17","author":"Margalit","year":"1989","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB12","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":"Journal of Molecular Biology"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB13","series-title":"Time Warps String Edits and Macromolecules: The Theory and Practice of Sequence Comparision","year":"1983"},{"issue":"1","key":"10.1016\/S0020-0255(00)00014-1_BIB14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1177\/109434209500900103","article-title":"Optimization and performance analysis of a massively parallel dynamic programming algorithm for RNA secondary structure prediction","volume":"9","author":"Shapiro","year":"1995","journal-title":"International Journal of Supercomputer Applications"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB15","doi-asserted-by":"crossref","first-page":"7041","DOI":"10.1093\/nar\/10.21.7041","article-title":"An interactive technique for the display of nucleic acid secondary structure","volume":"10","author":"Shapiro","year":"1982","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1093\/nar\/12.1Part1.75","article-title":"Generating non-overlapping displays of nucleic acid secondary structure","volume":"12","author":"Shapiro","year":"1984","journal-title":"Nucleic Acids Research"},{"issue":"4","key":"10.1016\/S0020-0255(00)00014-1_BIB17","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Computer Applications in the Biosciences"},{"issue":"4","key":"10.1016\/S0020-0255(00)00014-1_BIB18","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/21.286387","article-title":"Exact and approximate algorithms for unordered tree matching","volume":"24","author":"Shasha","year":"1994","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"1","key":"10.1016\/S0020-0255(00)00014-1_BIB19","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":"Journal of Molecular Biology"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB20","doi-asserted-by":"crossref","first-page":"3365","DOI":"10.1093\/nar\/5.9.3365","article-title":"Computer method for predicting the secondary structure of single-stranded RNA","volume":"5","author":"Studnicka","year":"1978","journal-title":"Nucleic Acids Research"},{"issue":"3","key":"10.1016\/S0020-0255(00)00014-1_BIB21","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":"Journal of ACM"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1146\/annurev.bb.17.060188.001123","article-title":"RNA structure predictions","volume":"17","author":"Turner","year":"1988","journal-title":"Ann. Rev. Biophys. Chem."},{"key":"10.1016\/S0020-0255(00)00014-1_BIB23","series-title":"Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications","year":"1999"},{"issue":"8","key":"10.1016\/S0020-0255(00)00014-1_BIB24","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 Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3\u20134","key":"10.1016\/S0020-0255(00)00014-1_BIB25","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0020-0255(99)00100-0","article-title":"Identifying approximately common substructures in trees based on a restricted edit distance","volume":"121","author":"Wang","year":"1999","journal-title":"Information Sciences"},{"issue":"4","key":"10.1016\/S0020-0255(00)00014-1_BIB26","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 Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB27","series-title":"Mathematical Methods for DNA Sequence Analysis","year":"1989"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0025-5564(85)90096-3","article-title":"A dynamic programming algorithm to find all solutions in a neighborhood of the optimum","volume":"77","author":"Waterman","year":"1985","journal-title":"Math. Biosci."},{"key":"10.1016\/S0020-0255(00)00014-1_BIB29","series-title":"Molecular Biology of the Gene","author":"Watson","year":"1987"},{"key":"10.1016\/S0020-0255(00)00014-1_BIB30","series-title":"Principles of Nucleic Acids Structure","author":"Wolfram","year":"1984"},{"issue":"6","key":"10.1016\/S0020-0255(00)00014-1_BIB31","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 Journal on Computing"},{"issue":"1","key":"10.1016\/S0020-0255(00)00014-1_BIB32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jagm.1994.1003","article-title":"Approximate tree matching in the presence of variable length don't cares","volume":"16","author":"Zhang","year":"1994","journal-title":"Journal of Algorithms"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025500000141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025500000141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T14:23:23Z","timestamp":1556288603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025500000141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":32,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0020025500000141"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(00)00014-1","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}