{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:13:54Z","timestamp":1759133634196},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0167-739x(02)00057-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:36:45Z","timestamp":1034289405000},"page":"849-854","source":"Crossref","is-referenced-by-count":2,"title":["A parallel algorithm for pattern discovery in biological sequences"],"prefix":"10.1016","volume":"18","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":"78","reference":[{"key":"10.1016\/S0167-739X(02)00057-2_BIB1","doi-asserted-by":"crossref","unstructured":"D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"10.1016\/S0167-739X(02)00057-2_BIB2","doi-asserted-by":"crossref","unstructured":"M.F. Sagot, Spelling approximate repeated or common motifs using a suffix tree, in: Proceedings of Latin \u201998, Lecture Notes on Computer Science, Vol. 1380, Springer, Berlin, 1998, pp. 111\u2013127.","DOI":"10.1007\/BFb0054337"},{"key":"10.1016\/S0167-739X(02)00057-2_BIB3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-739X(02)00057-2_BIB4","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, in: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"10.1016\/S0167-739X(02)00057-2_BIB5","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 Ninth International Conference on Intelligent Systems for Molecular Biology (ISMB 2001), Bioinformatics 17 (2001) S207\u2013S214.","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:24:03Z","timestamp":1555118643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X02000572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0167739X02000572"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(02)00057-2","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}