乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T04:30:17Z","timestamp":1717216217077},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2481,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1016\/j.tcs.2006.05.031","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T14:21:22Z","timestamp":1152282082000},"page":"33-53","source":"Crossref","is-referenced-by-count":8,"title":["An algebraic view of the relation between largest common subtrees and smallest common supertrees"],"prefix":"10.1016","volume":"362","author":[{"given":"Francesc","family":"Rossell\u00f3","sequence":"first","affiliation":[]},{"given":"Gabriel","family":"Valiente","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.tcs.2006.05.031_bib1","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1137\/S0097539794269461","article-title":"Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms","volume":"26","author":"Amir","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2006.05.031_bib2","series-title":"Proc. 14th Internat. Conf. Genome Informatics","first-page":"134","article-title":"Efficient tree-matching methods for accurate carbohydrate database queries","author":"Aoki","year":"2003"},{"issue":"5","key":"10.1016\/j.tcs.2006.05.031_bib3","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1002\/asi.20140","article-title":"Graph theoretic methods for the analysis of structural relationships in biological macromolecules","volume":"56","author":"Artymiuk","year":"2005","journal-title":"J. Amer. Soc. Inform. Sci. Technol."},{"key":"10.1016\/j.tcs.2006.05.031_bib4","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1021\/ci00014a001","article-title":"Substructure searching methods: old and new","volume":"33","author":"Barnard","year":"1993","journal-title":"J. Chem. Inform. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2006.05.031_bib5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0196-6774(87)90030-7","article-title":"O(n2.5) time algorithms for the subgraph homeomorphism problem on trees","volume":"8","author":"Chung","year":"1987","journal-title":"J. Algorithms"},{"issue":"5","key":"10.1016\/j.tcs.2006.05.031_bib6","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1137\/S0097539796313477","article-title":"An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees","volume":"30","author":"Cole","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2006.05.031_bib7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","article-title":"Thirty years of graph matching in pattern recognition","volume":"18","author":"Conte","year":"2004","journal-title":"Internat. J. Pattern Recognition Artificial Intell."},{"issue":"1","key":"10.1016\/j.tcs.2006.05.031_bib8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s004530010023","article-title":"Faster algorithms for subgraph isomorphism of k-connected partial k-trees","volume":"27","author":"Dessmark","year":"2000","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2006.05.031_bib9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/S0304-3975(03)00323-2","article-title":"RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm","volume":"306","author":"Dulucq","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"6\u20137","key":"10.1016\/j.tcs.2006.05.031_bib10","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","article-title":"A graph distance measure combining maximum common subgraph and minimum common supergraph","volume":"22","author":"Fern\u00e1ndez","year":"2001","journal-title":"Pattern Recognition Lett."},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1021\/ci025592e","article-title":"Similarity searching using reduced graphs","volume":"43","author":"Gillet","year":"2003","journal-title":"J. Chem. Inform. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/PL00009212","article-title":"Finding largest subtrees and smallest supertrees","volume":"21","author":"Gupta","year":"1998","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2006.05.031_bib13","first-page":"105","article-title":"A fast algorithm for optimal alignment between similar ordered trees","volume":"56","author":"Jansson","year":"2003","journal-title":"Fund. Inform."},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1570-8667(03)00080-7","article-title":"The longest common subsequence problem for arc-annotated sequences","volume":"2","author":"Jiang","year":"2004","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2006.05.031_bib15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","article-title":"Alignment of trees\u2014an alternative to tree edit","volume":"143","author":"Jiang","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib16","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1137\/S0097539791218202","article-title":"Ordered and unordered tree inclusion","volume":"24","author":"Kilpel\u00e4inen","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2006.05.031_bib17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","article-title":"On the complexity of finding isomorphisms and other morphisms for partial k-trees","volume":"108","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.tcs.2006.05.031_bib18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S0129054100000259","article-title":"Finding smallest supertrees under minor containment","volume":"11","author":"Nishimura","year":"2000","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"10.1016\/j.tcs.2006.05.031_bib19","series-title":"Proc. 15th Annu. Symp. Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 3109","first-page":"55","article-title":"Approximate labelled subtree homeomorphism","author":"Pinter","year":"2004"},{"issue":"16","key":"10.1016\/j.tcs.2006.05.031_bib20","doi-asserted-by":"crossref","first-page":"3401","DOI":"10.1093\/bioinformatics\/bti554","article-title":"Alignment of metabolic pathways","volume":"21","author":"Pinter","year":"2005","journal-title":"Bioinformatics"},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1999.1044","article-title":"Faster subtree isomorphism","volume":"33","author":"Shamir","year":"1999","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2006.05.031_bib22","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 Trans. Systems, Man Cybernat."},{"issue":"4","key":"10.1016\/j.tcs.2006.05.031_bib23","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","article-title":"Fast algorithms for the unit cost editing distance between trees","volume":"11","author":"Shasha","year":"1990","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2006.05.031_bib24","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","article-title":"Kaikoura tree theorems: computing the maximum agreement subtree","volume":"48","author":"Steel","year":"1993","journal-title":"Inform. Process. Lett."},{"issue":"7","key":"10.1016\/j.tcs.2006.05.031_bib25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/TPAMI.2005.146","article-title":"Polynomial-time metrics for attributed trees","volume":"27","author":"Torsello","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.tcs.2006.05.031_bib26","series-title":"Algorithms on Trees and Graphs","author":"Valiente","year":"2002"},{"key":"10.1016\/j.tcs.2006.05.031_bib27","series-title":"Proc. 14th Annu. Symp. Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 2676","first-page":"361","article-title":"Constrained tree inclusion","author":"Valiente","year":"2003"},{"issue":"2\u20134","key":"10.1016\/j.tcs.2006.05.031_bib28","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.jda.2004.08.017","article-title":"Constrained tree inclusion","volume":"3","author":"Valiente","year":"2005","journal-title":"J. Discrete Algorithms"},{"issue":"17","key":"10.1016\/j.tcs.2006.05.031_bib29","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1093\/bioinformatics\/btg305","article-title":"Parametric alignment of ordered trees","volume":"19","author":"Wang","year":"2003","journal-title":"Bioinformatics"},{"key":"10.1016\/j.tcs.2006.05.031_bib30","series-title":"Data Mining in Bioinformatics","first-page":"59","article-title":"RNA structure comparison and alignment","author":"Zhang","year":"2005"},{"issue":"6","key":"10.1016\/j.tcs.2006.05.031_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 J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506003173?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506003173?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:19:03Z","timestamp":1656371943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397506003173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["S0304397506003173"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.05.031","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}