{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:14:13Z","timestamp":1763140453806,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/iri.2010.5558954","type":"proceedings-article","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T10:37:14Z","timestamp":1282905434000},"page":"109-114","source":"Crossref","is-referenced-by-count":8,"title":["A Nettree for pattern Matching with flexible wildcard Constraints"],"prefix":"10.1109","author":[{"given":"Youxi","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Min","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"113","article-title":"String matching and other products","volume":"7","author":"fischer","year":"1974","journal-title":"Complexity of Computation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0016-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2009.65"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.160"},{"key":"ref14","first-page":"2934","article-title":"Mining Complex Patterns across Sequences with Gap Requirements","author":"zhu","year":"2007","journal-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence"},{"key":"ref4","first-page":"167","article-title":"Pattern matching with wildcards based on key character location","author":"liu","year":"2009","journal-title":"Proceedings of the 2009 IEEE International Conference on Information Reuse and Integration (IEEE IRI-09)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"article-title":"System and method for tree structure indexing that provides at least one constraint sequence to preserve query-equivalence between xml document structure match and subsequence match","year":"2009","author":"fan","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191925"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0057-6"},{"key":"ref7","first-page":"44","article-title":"Efficient stream sequence matching algorithms for handheld devices on time-series stream data","author":"moon","year":"2006","journal-title":"Proceedings of the 24th IASTED international conference on Database and applications table of contents"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IRI.2007.4296642"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1093\/nar\/gki038","article-title":"The Ribosomal Database Project (RDP-II): sequences and tools for high-throughput rRNA analysis","volume":"33","author":"cole","year":"2005","journal-title":"Nucleic Acids Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.10.016"}],"event":{"name":"Integration (2010 IRI)","start":{"date-parts":[[2010,8,4]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2010,8,6]]}},"container-title":["2010 IEEE International Conference on Information Reuse & Integration"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5550513\/5558895\/05558954.pdf?arnumber=5558954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T09:11:03Z","timestamp":1497863463000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5558954\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iri.2010.5558954","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}