{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:17Z","timestamp":1780743677431,"version":"3.54.1"},"reference-count":21,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1051\/ita:2001132","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:11:23Z","timestamp":1068822683000},"page":"565-577","source":"Crossref","is-referenced-by-count":10,"title":["Forbidden Factors and Fragment Assembly"],"prefix":"10.1051","volume":"35","author":[{"given":"F.","family":"Mignosi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2002,7,15]]},"reference":[{"key":"R1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,Data Structures and Algorithms. Addison Wesley, Reading, Mass (1983)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/aama.2000.0682","volume":"25","author":"B\u00e9al","year":"2000","journal-title":"Adv. in Appl. Math."},{"key":"R3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. Carpi, A. de Luca and S. Varricchio, Words, univalent factors, and boxes.Acta Inform.(to appear).","DOI":"10.1007\/s002360100079"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"M. Crochemore and C. Hancart, Automata for matching patterns, inHandbook of Formal Languages, Vol. 2, Chap. 9, edited by G. Rosenberg and A. Salomaan. Springer (1997) 399-462.","DOI":"10.1007\/978-3-662-07675-0_9"},{"key":"R6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"Crochemore","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"M. Crochemore, F. Mignosi, A. Restivo and S. Salemi, Data compression using antidictionaries, inProc. of the IEEE, Special Issue on Lossless Data Compression, Vol. 88, edited by J.A. Storer (2000) 1756-1768.","DOI":"10.1109\/5.892711"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"A. Frieze and B.V. Halld\u00f3rsson, Optimal Sequencing by Hybridization in Rounds, inProc. of RECOMB 2001, edited by T. Lengauer, D. Sankoff, S. Istrail, P. Pevzner and M. Waterman. ACM Press (2001) 141-148","DOI":"10.1145\/369133.369187"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"D. Gusfield,Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press (1997).","DOI":"10.1017\/CBO9780511574931"},{"key":"R10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","volume":"2","author":"Idury","year":"1995","journal-title":"J. Comput. Biol."},{"key":"R11","unstructured":"F. Mignosi and A. Restivo, Periodicity, inM. Lothaire, Algebraic Combinatorics on Words, Chap. 8. Cambridge University Press (to appear) 237-274. Also available at url: http:\/\/www-igm.univ-mlv.fr\/ berstel\/Lothaire\/index.html"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"F. Mignosi, A. Restivo and M. Sciortino, Forbidden Factors and Fragment Assembly.Lecture Notes in Comput. Sci.(2001). Proceedings of DLT'01.","DOI":"10.1051\/ita:2001132"},{"key":"R13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"Mignosi","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"R14","unstructured":"F. Mignosi, A. Restivo, M. Sciortino and J. Storer,On Sequence Assembly, Technical Report cs-00-210. Brandeis University (2000)."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan and S.C. Sahinalp, Approximate nearest neighbors and sequence comparison with block operations. ACM Press (2000).Proceedings of STOC 2000.","DOI":"10.1145\/335305.335353"},{"key":"R16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/5992.764214","volume":"3","author":"Myers","year":"1999","journal-title":"IEEE Comput. Engrg. Sci."},{"key":"R17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/nar\/12.1Part1.307","volume":"12","author":"Peltola","year":"1984","journal-title":"Nucl. Acids Res."},{"key":"R18","unstructured":"M. Peltola, H. Soderlund, J. Tarhio and E. Ukkonen, Algorithms for some string matching problems arising in molecular genetics, inProc. of the 9th IFIP World Computer Congress(1983) 59-64."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"P.A. Pevzner, H. Tang and M. Waterman, A New Approach Fragment Assembly in DNA Sequencing, inProc. of RECOMB 2001, edited by T. Lengauer, D. Sankoff, S. Istrail, P. Pevzner and M. Waterman. ACM Press (2001) 141-148.","DOI":"10.1145\/369133.369230"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"R. Shamir and D. Tsur, Large Scale Sequencing by Hybridization, inProc. of RECOMB 2001, edited by T. Lengauer, D. Sankoff, S. Istrail, P. Pevzner and M. Waterman. ACM Press (2001) 269-278.","DOI":"10.1145\/369133.369233"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"M.S. Waterman,Introduction to computational biology: Maps, sequences and genomes. Chapman & Hall (1995).","DOI":"10.1007\/978-1-4899-6846-3"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001132\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:01:30Z","timestamp":1585263690000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":21,"journal-issue":{"issue":"6"},"alternative-id":["ita02S6"],"URL":"https:\/\/doi.org\/10.1051\/ita:2001132","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}