{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:34:39Z","timestamp":1648578879266},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Info. Know. Mgmt."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> Pattern matching is essential in many applications such as information retrieval, logic programming, theorem-proving, term rewriting and DNA-computing. It usually breaks down into two categories: root and complete pattern matching. Root matching determines whether a subject term is an instance of a pattern in a pattern set while complete matching determines whether a subject term contains a sub-term that is an instance of a pattern in a pattern set. For the sake of efficiency, root pattern matching need to be deterministic and lazy. Furthermore, complete pattern matching also needs to be parallel. Unlike root pattern matching, complete matching received little interest from the researchers of the field. In this paper, we present a novel deterministic multi-threaded complete matching method. This method subsumes a deterministic lazy root matching technique that was developped by the authors in an earlier work. We evaluate the performance of proposed method using theorem-proving and DNA-computing applications. <\/jats:p>","DOI":"10.1142\/s0219649206001591","type":"journal-article","created":{"date-parts":[[2007,1,4]],"date-time":"2007-01-04T13:34:23Z","timestamp":1167917663000},"page":"337-343","source":"Crossref","is-referenced-by-count":0,"title":["Complete Pattern Matching for DNA Computing"],"prefix":"10.1142","volume":"05","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[{"name":"Department of Electronics Engineering and Telecommunications, Faculty of Engineering, State University of Riode Janeiro, Brazil"}]},{"given":"Luiza","family":"De Macedo Mourelle","sequence":"additional","affiliation":[{"name":"Department of System Engineering and Computation, Faculty of Engineering, State University of Riode Janeiro, Brazil"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1126\/science.7973651"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881866"},{"key":"rf4","volume-title":"Rewrite systems \u2014 Handbook of Theoretical Computer Science","author":"Dershowitz N.","year":"1990"},{"key":"rf5","volume-title":"Functional Programming","author":"Field A.","year":"1988"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"rf9","volume-title":"Sigplan Notices","author":"Hudak P.","year":"1992"},{"key":"rf10","first-page":"321","author":"Laville A.","journal-title":"Journal of Symbolic Computation"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1126\/science.7725098"},{"key":"rf13","volume":"31","author":"Nedjah N.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<793::AID-SPE254>3.0.CO;2-M"},{"key":"rf18","volume-title":"Equational Logic as Programming Language","author":"O'Donnell M.","year":"1985"},{"key":"rf19","volume-title":"DNA-computing \u2014 New Computing Paradigms","author":"Paun G.","year":"1998"},{"key":"rf20","volume-title":"The Implementation of Functional Programming Languages","author":"Peyton-Jones S. L.","year":"1987"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793246252"}],"container-title":["Journal of Information &amp; Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219649206001591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:28:44Z","timestamp":1565148524000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219649206001591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":14,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0219649206001591"],"URL":"https:\/\/doi.org\/10.1142\/s0219649206001591","relation":{},"ISSN":["0219-6492","1793-6926"],"issn-type":[{"value":"0219-6492","type":"print"},{"value":"1793-6926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}