{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:40Z","timestamp":1725484300515},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_7","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"64-75","source":"Crossref","is-referenced-by-count":2,"title":["The Problem of Context Sensitive String Matching"],"prefix":"10.1007","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[]},{"given":"Rajasekar","family":"Krishnamurthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Proc. 3rd Italian Conf. on Algorithms and Complexity","author":"P. Alimonti","year":"1997","unstructured":"P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd Italian Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, 1203, pages 288\u2013298. Springer-Verlag, 1997."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir, Y. Aumann, G. Landau, M. Lewenstein, and N. Lewenstein. Pattern matching with swaps. In Proc. 38th IEEE Conf. on Foundations of Computer Science (FOCS), pages 144\u2013153, 1997.","DOI":"10.1109\/SFCS.1997.646103"},{"key":"7_CR3","unstructured":"A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching. In Proceeding of the Twelfth Annual Symposium on Discrete algorithms (SODA), pages 279\u2013288, 2001."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. In Journal of Computer and Systems Sciences, volume 21, pages 46\u201362, 1980.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"A. Apostolico and Z. Galil (eds.). Pattern Matching Algorithms. Oxford Univ. Press, 1997.","DOI":"10.1201\/9781420049503-c14"},{"key":"7_CR6","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford Univ. Press, 1994."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S012905419300002X","volume":"4","author":"J. Dassow","year":"1993","unstructured":"J. Dassow, Gh. Paun, and A. Salomaa. Grammars based on patterns. In Intl. Journal on Foundations of Computer Science, volume 4, pages 1\u201314, 1993.","journal-title":"Intl. Journal on Foundations of Computer Science"},{"key":"7_CR8","first-page":"113","volume":"7","author":"M.J. Fischer","year":"1974","unstructured":"M.J. Fischer and M.S. Paterson. String matching and other products. In Complexity of Computation, SIAM-AMS Proceedings, pages 7:113\u2013125, 1974.","journal-title":"Complexity of Computation, SIAM-AMS Proceedings"},{"key":"7_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"7_CR10","unstructured":"C. Heitsch. Computational Complexity of Generalized Pattern Matching. Ph.D thesis, Dept. of Math., Univ. of California at Berkeley, 2000."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T. Jiang","year":"1995","unstructured":"T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. In Journal of Computer and Systems Sciences, volume 50, pages 53\u201363, 1995.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"M. Karpinski. Approximating bounded degree instances of NP-Hard problems. In Electronic Colloquium on Computational Complexity, ECCC Report TR01-042, 2001.","DOI":"10.1007\/3-540-44669-9_4"},{"key":"7_CR13","unstructured":"M. Lothaire. Combinatorics on Words. Addison-Wesley, 1983."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)00258-4","volume":"154","author":"V. Mitrana","year":"1996","unstructured":"V. Mitrana, Gh. Paun, G. Rozenberg, and A. Salomaa. Patttern systems. In Theoretical Computer Science, volume 154, pages 183\u2013201, 1996.","journal-title":"Theoretical Computer Science"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(96)00289-7","volume":"186","author":"E. Ohlebusch","year":"1997","unstructured":"E. Ohlebusch and E. Ukkonen. On the equivalence problem for e-pattern languages. In Theoretical Computer Science, volume 186, pages 231\u2013248, 1997.","journal-title":"Theoretical Computer Science"},{"key":"7_CR16","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"7_CR17","first-page":"363","volume":"119","author":"A. I. Zimin","year":"1982","unstructured":"A. I. Zimin. Blocking sets of terms. In Math. Sbornik, volume 119, pages 363\u2013375, 1982.","journal-title":"Math. Sbornik"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:52:44Z","timestamp":1556412764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}