{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:38Z","timestamp":1725664178547},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_195","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:43:56Z","timestamp":1330271036000},"page":"315-323","source":"Crossref","is-referenced-by-count":6,"title":["A linear-time algorithm for computing characteristic strings"],"prefix":"10.1007","author":[{"given":"Michio","family":"Nakanishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morio","family":"Hasidume","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minoru","family":"Ito","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,3]]},"reference":[{"key":"37_CR1","first-page":"39","volume":"COMP93-36","author":"M. Hasidume","year":"1993","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).","journal-title":"IEICE Technical Report"},{"issue":"2","key":"37_CR2","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"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"M.Ito, K. Shimizu, M. Nakanishi and A. Hashimoto: \u201cPolynomial-time algorithms for computing characteristic strings,\u201d Proc. of 5th Symposium on Combinatorial Pattern Matching, To apprear (June 1994).","DOI":"10.1007\/3-540-58094-8_24"},{"key":"37_CR4","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"},{"issue":"8","key":"37_CR5","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"V.I. Levenshtein: \u201cBinary codes capable of correcting deletions, insertions, and reversals\u201d, Cybernetics and Control Theory, 10, 8, pp.707\u2013710(1966)","journal-title":"Cybernetics and Control Theory"},{"key":"37_CR6","unstructured":"A.J.L. Macario and E.C. de Macario: \u201cGene Probes for Bacteria,\u201d Academic Press (1990)"},{"issue":"2","key":"37_CR7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight: \u201cA space-economical suffix tree construction algorithm\u201d, Journal of ACM, 23, 2, pp.262\u2013272 (Apr. 1976).","journal-title":"Journal of ACM"},{"key":"37_CR8","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 Biomedical and Environmental Sciences)."},{"key":"37_CR9","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":"37_CR10","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":"37_CR11","doi-asserted-by":"crossref","unstructured":"\u201cGenome Databases,\u201d Science, 254 (Oct. 1991).","DOI":"10.1126\/science.1925577"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_195.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:31Z","timestamp":1605647971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_195","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}