{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:16:10Z","timestamp":1761401770851},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T00:00:00Z","timestamp":1445212800000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10618-015-0439-5","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:37:25Z","timestamp":1445240245000},"page":"1249-1272","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Mining rooted ordered trees under subtree homeomorphism"],"prefix":"10.1007","volume":"30","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,19]]},"reference":[{"key":"439_CR1","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Satamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the second SIAM international conference on data mining (SDM), SIAM, pp 158\u2013174","DOI":"10.1137\/1.9781611972726.10"},{"issue":"1\u20132","key":"439_CR2","first-page":"1","volume":"78","author":"JL Balcazar","year":"2010","unstructured":"Balcazar JL, Bifet A, Lozano A (2010) Mining frequent closed rooted trees. Mach Learn 78(1\u20132):1\u201333","journal-title":"Mach Learn"},{"issue":"3","key":"439_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1978782.1978793","volume":"7","author":"P Bille","year":"2011","unstructured":"Bille P, Gortz I (2011) The tree inclusion problem: in linear space and faster. ACM Trans Algorithm 7(3):1\u201347","journal-title":"ACM Trans Algorithm"},{"key":"439_CR4","doi-asserted-by":"crossref","unstructured":"Chalmers R, Almeroth K (2001) Modeling the branching characteristics and efficiency gains of global multicast trees. In: Proceedings of the 20th IEEE international conference on computer communications (INFOCOM), pp 449\u2013458","DOI":"10.1109\/INFCOM.2001.916734"},{"key":"439_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/TNET.2002.804835","volume":"11","author":"RC Chalmers","year":"2003","unstructured":"Chalmers RC, Member S, Almeroth KC (2003) On the topology of multicast trees. IEEE\/ACM Trans Netw 11:153\u2013165","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"439_CR6","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10618-008-0098-x","volume":"17","author":"V Chaoji","year":"2008","unstructured":"Chaoji V, Hasan MA, Salem S, Zaki MJ (2008) An integrated, generic approach to pattern mining: data mining template library. Data Min Knowl Discov 17(3):457\u2013495","journal-title":"Data Min Knowl Discov"},{"key":"439_CR7","doi-asserted-by":"crossref","unstructured":"Chehreghani MH (2011) Efficiently mining unordered trees. In: Proceedings of the 11th IEEE international conference on data mining (ICDM), pp 111\u2013120","DOI":"10.1109\/ICDM.2011.62"},{"issue":"5","key":"439_CR8","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TSMCA.2010.2096808","volume":"41","author":"MH Chehreghani","year":"2011","unstructured":"Chehreghani MH, Chehreghani MH, Lucas C, Rahgozar M (2011) OInduced: an efficient algorithm for mining induced patterns from rooted ordered trees. IEEE Trans Syst Man Cybern A 41(5):1013\u20131025","journal-title":"IEEE Trans Syst Man Cybern A"},{"issue":"1\u20132","key":"439_CR9","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi Y, Muntz RR, Nijssen S, Kok JN (2005) Frequent subtree mining\u2014an overview. Fundam Inf 66(1\u20132):161\u2013198","journal-title":"Fundam Inf"},{"key":"439_CR10","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: Proceedings of the third IEEE international conference on data mining (ICDM), pp 509\u2013512","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"439_CR11","doi-asserted-by":"crossref","unstructured":"Cui J, Kim J, Maggiorini D, Boussetta K, Gerla M (2002) Aggregated multicast\u2014a comparative study. In: Proceedings of the second international IFIP-TC6 networking conference on networking technologies, services, and protocols; performance of computer and communication networks; and mobile and wireless communications (NETWORKING), pp 1032\u20131044","DOI":"10.1007\/3-540-47906-6_84"},{"key":"439_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory, 4th edn. Springer, Heidelberg","edition":"4"},{"key":"439_CR13","doi-asserted-by":"crossref","unstructured":"Dietz PF (1982) Maintaining order in a linked list. In: Proceedings of the 14th ACM symposium on theory of computing (STOC), pp 122\u2013127","DOI":"10.1145\/800070.802184"},{"issue":"1","key":"439_CR14","first-page":"77","volume":"3","author":"R Ivancsy","year":"2006","unstructured":"Ivancsy R, Vajk I (2006) Frequent pattern mining in web log data. Acta Polytech Hung 3(1):77\u201390","journal-title":"Acta Polytech Hung"},{"issue":"2","key":"439_CR15","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P Kilpelainen","year":"1995","unstructured":"Kilpelainen P, Mannila H (1995) Ordered and unordered tree inclusion. SIAM J Comput 24(2):340\u2013356","journal-title":"SIAM J Comput"},{"key":"439_CR16","doi-asserted-by":"crossref","unstructured":"Miyahara T, Suzuki Y, Shoudai T, Uchida T, Takahashi K, Ueda H (2004) Discovery of maximally frequent tag tree patterns with contractible variables from semistructured documents. In: Proceedings of the 8th Pacific Asia conference on knowledge discovery and data mining (PAKDD), pp 133\u2013144","DOI":"10.1007\/978-3-540-24775-3_17"},{"key":"439_CR17","unstructured":"Nijssen S, Kok JN (2003) Efficient discovery of frequent unordered trees. In: Proceedings of the first international workshop on mining graphs, trees, and sequences (MGTS), pp 55\u201364"},{"key":"439_CR18","doi-asserted-by":"crossref","unstructured":"Qin L, Yu JX, Ding B (2007) TwigList: make twig pattern matching fast. In: Proceedings of the 12th international conference on database systems for advanced applications (DASFAA), pp 850\u2013862","DOI":"10.1007\/978-3-540-71703-4_70"},{"key":"439_CR19","first-page":"39","volume-title":"Database modeling in biology: practices and challenges","author":"AS Sidhu","year":"2006","unstructured":"Sidhu AS, Dillon TS, Chang E (2006) Protein ontology. In: Ma Z, Chen JY (eds) Database modeling in biology: practices and challenges. Springer, New York, pp 39\u201360"},{"issue":"2","key":"439_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1376815.1376818","volume":"2","author":"H Tan","year":"2008","unstructured":"Tan H, Hadzic F, Dillon TS, Chang E, Feng L (2008) Tree model guided candidate generation for mining frequent subtrees from XML documents. ACM Trans Knowl Discov Data 2(2):43. doi: 10.1145\/1376815.1376818","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1","key":"439_CR21","doi-asserted-by":"crossref","first-page":"694","DOI":"10.14778\/1687627.1687706","volume":"2","author":"S Tatikonda","year":"2009","unstructured":"Tatikonda S, Parthasarathy S (2009) Mining tree-structured data on multicore systems. Proc VLDB Endow 2(1):694\u2013705","journal-title":"Proc VLDB Endow"},{"key":"439_CR22","doi-asserted-by":"crossref","unstructured":"Tatikonda S, Parthasarathy S, Kurc TM (2006) TRIPS and TIDES: new algorithms for tree mining. In: Proceedings of the 15th ACM international conference on information and knowledge management (CIKM), pp 455\u2013464 (2006)","DOI":"10.1145\/1183614.1183680"},{"key":"439_CR23","doi-asserted-by":"crossref","unstructured":"Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B (2004) Efficient pattern-growth methods for frequent tree pattern mining. In: Proceedings of the 8th Pacific Asia conference on knowledge discovery and data mining (PAKDD), pp 441\u2013451","DOI":"10.1007\/978-3-540-24775-3_54"},{"key":"439_CR24","doi-asserted-by":"crossref","unstructured":"Xiao Y, Yao JF, Li Z, Dunham MH (2003) Efficient data mining for maximal frequent subtrees. In: Proceedings of the third IEEE international conference on data mining (ICDM), pp 379\u2013386","DOI":"10.1109\/ICDM.2003.1250943"},{"issue":"1\u20132","key":"439_CR25","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent embedded unordered trees. Fundam Inf 66(1\u20132):33\u201352","journal-title":"Fundam Inf"},{"issue":"8","key":"439_CR26","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Tran Knowl Data Eng 17(8):1021\u20131035","journal-title":"IEEE Tran Knowl Data Eng"},{"issue":"1\u20132","key":"439_CR27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10994-006-5832-2","volume":"62","author":"MJ Zaki","year":"2006","unstructured":"Zaki MJ, Aggarwal CC (2006) XRules: an effective algorithm for structural classification of XML data. Mach Learn 62(1\u20132):137\u2013170","journal-title":"Mach Learn"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0439-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0439-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0439-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:47Z","timestamp":1559244587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0439-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,19]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["439"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0439-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,19]]}}}