{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:18Z","timestamp":1775281218977,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580942","type":"print"},{"value":"9783540484509","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:12:15Z","timestamp":1330269135000},"page":"240-249","source":"Crossref","is-referenced-by-count":3,"title":["Approximate string matching with don't care characters"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. \u201cGenaralized string matching\u201d. SIAM Journal on Computing, Vol. 16, pp. 1039\u20131051, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"A. Amir and G. Landau. \u201cFast parallel and serial multidimensional approximate array matching\u201d. Theoretical Computer Science, Vol. 81, pp. 97\u2013115, 1991.","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. \u201cParallel construction of a suffix tree with applications\u201d. Algorithmica, Vol. 3, pp. 347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"21_CR4","volume-title":"Introduction to Protein Structure","author":"C. Branden","year":"1991","unstructured":"C. Branden and J. Tooze. Introduction to Protein Structure. Garland Publishing Inc., New York, 1991."},{"key":"21_CR5","first-page":"113","volume":"7","author":"M. Fisher","year":"1974","unstructured":"M. Fisher and M. Paterson. \u201cString matching and other products\u201d. In Complexity of Computation (SIAM-AMS Proceedings), volume 7, pp. 113\u2013125, 1974.","journal-title":"Complexity of Computation (SIAM-AMS Proceedings)"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Z. Galil and R. Giancarlo. \u201cData structures and algorithms for approximate string matching\u201d. Journal of Complexity, Vol. 4, pp. 33\u201372, 1988.","journal-title":"Journal of Complexity"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z. Galil","year":"1990","unstructured":"Z. Galil and K. Park. \u201cAn improved algorithm for approximate string matching\u201d. SIAM Journal on Computing, Vol. 19, pp. 989\u2013999, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR8","volume-title":"Sequence Analysis in Molecular Biology \u2014 Treasure Trove or Trivial Pursuit","author":"G. Heijne","year":"1987","unstructured":"G. Heijne. Sequence Analysis in Molecular Biology \u2014 Treasure Trove or Trivial Pursuit. Academic Press, Inc., San Diego, 1987."},{"key":"21_CR9","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J. J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison-Wesley, Massachusetts, 1992."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin. \u201cFast parallel and serial approximate string matching\u201d. Journal of Algorithms, Vol. 10, pp. 157\u2013169, 1989.","journal-title":"Journal of Algorithms"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","volume":"37","author":"U. Manber","year":"1991","unstructured":"U. Manber and R. Baeza-Yates. \u201cAn algorithm for string matching with a sequence of don't cares\u201d. Information Processing Letters, Vol. 37, pp. 133\u2013136, 1991.","journal-title":"Information Processing Letters"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"P. Weiner. \u201cLinear pattern matching algorithms\u201d. In Proceedings of IEEE Symposium on Switching and Automata Theory, pp. 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:10:53Z","timestamp":1619572253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}