{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:05:48Z","timestamp":1742987148105,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252544"},{"type":"electronic","value":"9783319252551"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25255-1_9","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T01:39:46Z","timestamp":1443058786000},"page":"104-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Discovering Restricted Regular Expressions with Interleaving"],"prefix":"10.1007","author":[{"given":"Feifei","family":"Peng","sequence":"first","affiliation":[]},{"given":"Haiming","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Bourhis, P., Vianu, V.: Highly expressive query languages for unordered data trees. In: Proceedings of the 15th International Conference on Database Theory, pp. 46\u201360 (2012)","DOI":"10.1145\/2274576.2274583"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Gelade, W., Martens, W., Neven, F.: Simplifying XML schema: effortless handling of nondeterministic regular expressions. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 731\u2013744 (2009)","DOI":"10.1145\/1559845.1559922"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Boneva, I., Ciucanu, R., Staworko, S.: Simple schemas for unordered XML. arXiv preprint arXiv:1303.4277 (2013)","DOI":"10.1007\/s00224-014-9593-1"},{"key":"9_CR4","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Vansummeren, S.: Inference of concise DTDs from XML data. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 115\u2013126. VLDB Endowment, September 2006"},{"key":"9_CR5","unstructured":"Bex, G.J., Neven, F., Vansummeren, S.: Inferring XML schema definitions from XML data. In: Proceedings of the 33rd international conference on Very large data bases, pp. 998\u20131009. VLDB Endowment, September 2007"},{"issue":"4","key":"9_CR6","first-page":"14","volume":"4","author":"G.J. Bex","year":"2010","unstructured":"Bex, G.J., Wouter, G., Neven, F., Vansummeren, S.: Learning deterministic regular expressions for the inference of schemas from XML data. ACM Transactions on the Web (TWEB)\u00a04(4), 14 (2010)","journal-title":"ACM Transactions on the Web (TWEB)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-319-09284-3_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"A. Ignatiev","year":"2014","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: On reducing maximum independent set to minimum satisfiability. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol.\u00a08561, pp. 103\u2013120. Springer, Heidelberg (2014)"},{"key":"9_CR8","unstructured":"Clark, J.: Trang: Multi-format schema converter based on RELAX NG. \n                      \n                        http:\/\/www.thaiopensource.com\/relaxng\/trang.html"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s003550050123","volume":"15","author":"R.W. Bailey","year":"1998","unstructured":"Bailey, R.W.: The number of weak orderings of a finite set. Social Choice and Welfare\u00a015(4), 559\u2013562 (1998)","journal-title":"Social Choice and Welfare"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"de Koninck, J.M.: Those Fascinating Numbers. American Mathematical Soc. (2009)","DOI":"10.1090\/mbk\/064"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Freydenberger, D.D., K\u00f6tzing, T.: Fast learning of restricted regular expressions and DTDs. In: Proceedings of the 16th International Conference on Database Theory, pp. 45\u201356 (2013)","DOI":"10.1145\/2448496.2448504"},{"key":"9_CR13","unstructured":"Ciucanu, R., Staworko, S.: Learning schemas for unordered xml. arXiv preprint arXiv:1307.6348 (2013)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gionis, A., Kujala, T., Mannila, H.: Fragments of order. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 129\u2013136 (2003)","DOI":"10.1145\/956750.956768"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Mannila, H., Meek, C.: Global partial orders from sequential data. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 161\u2013168 (2000)","DOI":"10.1145\/347090.347122"},{"key":"9_CR16","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, vol.\u00a01215, pp. 487\u2013499. VLDB (1994)"},{"issue":"11","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1109\/TKDE.2006.172","volume":"18","author":"J. Pei","year":"2006","unstructured":"Pei, J., Wang, H., Liu, J., Wang, K., et al.: Discovering frequent closed partial orders from strings. IEEE Transactions on Knowledge and Data Engineering\u00a018(11), 1467\u20131481 (2006)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR18","unstructured":"Miklau, G.: XMLData Repository, November 2002. \n                      \n                        http:\/\/www.cs.washington.edu\/research\/xmldatasets\/"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Boppana, R., Halld\n                      \n                        \n                      \n                      $\\acute{o}$\n                    rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics 32(2), 180\u2013196 (1992)","DOI":"10.1007\/BF01994876"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR21","unstructured":"Algorithm to divide a set of symbols with constraints into minimun number of subsets. \n                      \n                        http:\/\/stackoverflow.com\/q\/29117747\/4684328"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25255-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:32:19Z","timestamp":1559251939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25255-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252544","9783319252551"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25255-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}