{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:45Z","timestamp":1751282865791},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:12:07Z","timestamp":1330269127000},"page":"274-288","source":"Crossref","is-referenced-by-count":6,"title":["Polynomial-time algorithms for computing characteristic strings"],"prefix":"10.1007","author":[{"given":"Minoru","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuniyasu","family":"Shimizu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michio","family":"Nakanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Hashimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"10","key":"24_CR1","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"R.S.Boyer and J.S.Moore: \u201cA fast string searching algorithm,\u201d Comm. ACM, 20, 10, pp.762\u2013772 (Oct. 1977).","journal-title":"Comm. ACM"},{"issue":"5","key":"24_CR2","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1128\/JCM.26.5.1068-1069.1988","volume":"26","author":"R. Dular","year":"1988","unstructured":"R.Dular, R.Kajioka and S.Kasatiya: \u201cComparison of Gene-Probe Commercial Kit and Culture Technique for the Diagnosis of Mycoplasma pneumoniae Infection,\u201d Journal of Clinical Microbiology, 26, 5, pp.1068\u20131069 (May 1988).","journal-title":"Journal of Clinical Microbiology"},{"key":"24_CR3","unstructured":"M.Hasidume, M.Ito, M.Nakanishi and A.Hashimoto: \u201cA linear-time algorithm for computing a shortest characteristic substring of strings\u201d (in Japanese), IEICE Technical Report, COMP93-36, pp.39\u201346 (July 1993)."},{"issue":"2","key":"24_CR4","first-page":"151","volume":"5","author":"D.G. Higgins","year":"1989","unstructured":"D.G.Higgins and P.M.Sharp: \u201cFast and sensitive multiple sequence alignments on a microcomputer,\u201d CABIOS, 5, 2, pp.151\u2013153 (Apr. 1989).","journal-title":"CABIOS"},{"issue":"2","key":"24_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E.Knuth, J.H.Morris and V.R. Pratt: \u201cFast pattern matching in strings,\u201d SIAM Journal on Computing, 6, 2, pp.323\u2013350 (June 1977).","journal-title":"SIAM Journal on Computing"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"G.M.Landau and U.Vishkin: \u201cIntroducing efficient parallelism into approximate string matching and a new serial algorithm,\u201d Proc. 18th ACM Symp. on Theory of Computing, pp.220\u2013230 (May 1986).","DOI":"10.1145\/12130.12152"},{"key":"24_CR7","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, 10, pp.157\u2013169 (June 1989).","journal-title":"Journal of Algorithms"},{"key":"24_CR8","unstructured":"A.J.L.Macario and E.C.de Macario: \u201cGene Probes for Bacteria,\u201d Academic Press (1990)"},{"key":"24_CR9","unstructured":"M.Nasu, K.Shimada, S.Inaoka, K.Tani and M.Kondo: \u201c Natural bacterial populations in river water determined by 16S and 23S rRNA-targeted oligonucleotide probes,\u201d (submitted to Biom\u00e9dical and Environmental Sciences)."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"W.R.Pearson and D.J.Lipman: \u201cImproved tools for biological sequence comparison,\u201d Proc. Natl. Acad. Sci. USA, 85, pp.2444\u20132448 (Apr. 1988).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Sellers","year":"1980","unstructured":"P.H.Sellers: \u201cThe theory and computation of evolutionary distances: Pattern recognition,\u201d Journal of Algorithms, 1, pp.359\u2013373 (Dec. 1980).","journal-title":"Journal of Algorithms"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-12689-9_129","volume":"158","author":"E. Ukkonen","year":"1983","unstructured":"E.Ukkonen: \u201cOn approximate string matching,\u201d Lecture Notes in Computer Science, 158, pp.487\u2013495 (Aug. 1983).","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"24_CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E.Ukkonen: \u201cFinding approximate patterns in strings,\u201d Journal of Algorithms, 6, 1, pp.132\u2013137 (Mar. 1985).","journal-title":"Journal of Algorithms"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"E.Ukkonen: \u201cAlgorithms for approximate string matching,\u201d Information and Control, 64, pp.100\u2013118 (Mar. 1985).","journal-title":"Information and Control"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"P.Weiner: \u201cLinear pattern matching algorithms,\u201d Proc. IEEE 14th Symposium on Switching and Automata Theory, pp.1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"\u201dGenome Databases,\u201d Science, 254 (Oct. 1991).","DOI":"10.1126\/science.1925577"}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:10:55Z","timestamp":1619572255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}