{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:59Z","timestamp":1772119859931,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_69","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"757-768","source":"Crossref","is-referenced-by-count":39,"title":["RISOTTO: Fast Extraction of Motifs with Mismatches"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Pisanti","sequence":"first","affiliation":[]},{"given":"Alexandra M.","family":"Carvalho","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Marsan","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"69_CR1","unstructured":"Allali, J.: Structures d\u2019indexation: les arbres des facteurs. Memoire de maitrise, University of Marne-la-Vall\u00e9e (2000)"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.-F.: A highly scalable algorithm for the extraction of cis-regulatory regions. In: Proc. APBC 2005, pp. 273\u2013282. Imperial College Press (2005)","DOI":"10.1142\/9781860947322_0027"},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1093\/bioinformatics\/17.7.608","volume":"17","author":"D. Guha-Thakurta","year":"2001","unstructured":"Guha-Thakurta, D., Stormo, G.D.: Identifying target sites for cooperatively binding factors. Bioinformatics\u00a017, 608\u2013621 (2001)","journal-title":"Bioinformatics"},{"key":"69_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on words. Cambridge University Press, Cambridge (2005)"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L. Marsan","year":"2001","unstructured":"Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. J. Comp. Bio.\u00a07, 345\u2013360 (2001)","journal-title":"J. Comp. Bio."},{"key":"69_CR6","unstructured":"Pevzner, P.A., Sze, S.H.: Combinatorial algorithm for finding subtle signals in dna sequences. In: Proc. ISMB 2000, pp. 269\u2013278 (2000)"},{"key":"69_CR7","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M.-F. Sagot","year":"1998","unstructured":"Sagot, M.-F.: Spelling Approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 111\u2013127. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T06:57:11Z","timestamp":1552373831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11682462_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}