{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:29Z","timestamp":1725487049763},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425229"},{"type":"electronic","value":"9783540447436"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44743-1_48","type":"book-chapter","created":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T02:23:38Z","timestamp":1183083818000},"page":"456-468","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Algorithms for the Analysis of Biological Sequences"],"prefix":"10.1007","author":[{"given":"Giancarlo","family":"Mauri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Pavesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1126\/science.287.5461.2185","volume":"287","author":"M. D. Adams","year":"2000","unstructured":"M. D. Adams et al. The genome sequence of Drosophila Melanogaster. Science\n                           287 (2000), pp. 2185\u20132195.","journal-title":"Science"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1038\/35048692","volume":"408","author":"The Arabidopsis Genome Initiative","year":"2000","unstructured":"The Arabidopsis Genome Initiative. Analysis of the genome sequence of the flowering plant Arabidopsis Thaliana. Nature, 408 (2000), pp. 796\u2013815.","journal-title":"Nature"},{"key":"48_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, NY, 1997."},{"key":"48_CR4","series-title":"Lect Notes Comput Sci","first-page":"111","volume-title":"Proc. of Latin \u22838","author":"M. F. Sagot","year":"1998","unstructured":"M. F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. Proc. of Latin \u22838, Springer Verlag LNCS 1380, pages 111\u2013127, 1998."},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14 (1995), pp. 249\u2013260.","journal-title":"Algorithmica"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. In Proceedings of the 14th IEEE Symp. on Switching and Automata Theory, pp. 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"R. S. Boyer, J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20 (1977), pp. 762\u2013772.","journal-title":"Communications of the ACM"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. H. Morris, V. B. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6 (1977), pp. 323\u2013350.","journal-title":"SIAM Journal of Computing"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/10665270050081360","volume":"7","author":"G. Reinert","year":"2000","unstructured":"G. Reinert, S. Scabath, M.S. Waterman. Probabilistic and statistical properties of words. Journal of Computational Biology, 7 (2000), pp. 1\u201348.","journal-title":"Journal of Computational Biology"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"A. Apostolico, M. E. Bock, S. Lonardi, X. Xu. Efficient detection of unusual words. Journal of Computational Biology, 7 (2000), pp. 71\u201394.","journal-title":"Journal of Computational Biology"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"G. Pavesi, G. Mauri, G. Pesole. An algorithm for finding signals of unknown length in DNA sequences. In Proceedings of the 9th International Conference on Intelligent Systems for Molecular Biology (ISMB 2001), to appear.","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44743-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T10:01:24Z","timestamp":1550397684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44743-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425229","9783540447436"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44743-1_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}