{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:21:42Z","timestamp":1742952102611,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232077"},{"type":"electronic","value":"9783642232084"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23208-4_14","type":"book-chapter","created":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T21:35:11Z","timestamp":1314135311000},"page":"153-167","source":"Crossref","is-referenced-by-count":1,"title":["Removing Artifacts of Approximated Motifs"],"prefix":"10.1007","author":[{"given":"Maria","family":"Federico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Blanchette, M., Sinha, S.: Separating real motifs from their artifacts. In: Proceedings of the 9th Int. Conf. on Intell. Syst. for Mol. Biol., ISMB, Copenhagen, Denmark, July 21-25, pp. 30\u201338 (2001), Supplement of Bioinformatics","DOI":"10.1093\/bioinformatics\/17.suppl_1.S30"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Federico, M., Pisanti, N.: Suffix tree characterization of maximal motifs in biological sequences. In: BIRD, pp. 456\u2013465 (2008)","DOI":"10.1007\/978-3-540-70600-7_35"},{"issue":"43","key":"14_CR3","doi-asserted-by":"publisher","first-page":"4391","DOI":"10.1016\/j.tcs.2009.07.020","volume":"410","author":"M. Federico","year":"2009","unstructured":"Federico, M., Pisanti, N.: Suffix tree characterization of maximal motifs in biological sequences. Theor. Comput. Sci.\u00a0410(43), 4391\u20134401 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1089\/cmb.2010.0177","volume":"18","author":"R. Grossi","year":"2011","unstructured":"Grossi, R., Pietracaprina, A., Pisanti, N., Pucci, G., Upfal, E., Vandin, F.: Madmx: A strategy for maximal dense motif extraction. J. of Comput. Biol.\u00a018(4), 535\u2013545 (2011)","journal-title":"J. of Comput. Biol."},{"key":"14_CR5","unstructured":"Haubler, M.: Motif discovery on promotor sequences. Master\u2019s thesis, Institut fur Informatik and IRISA\/INRIA Rennes, Universitat Potsdam, Supervised by Dr. Torsten Schaub and Dr. Jacques Nicolas (2005)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44676-1_14","volume-title":"Algorithms - ESA 2001","author":"R. Kolpakov","year":"2001","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under hamming distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 170\u2013181. Springer, Heidelberg (2001)"},{"key":"14_CR7","unstructured":"Kurtz, S., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: Computation and visualization of degenerate repeats in complete genomes. In: Proceedings of the 8th Int. Conf. on Intell. Syst. for Mol. Biol. (ISMB), pp. 228\u2013238 (2000)"},{"issue":"3-4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L. Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. of Comput. Biol.\u00a07(3-4), 345\u2013362 (2000)","journal-title":"J. of Comput. Biol."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Marsan, L., Sagot, M.-F.: Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. In: RECOMB, pp. 210\u2013219 (2000)","DOI":"10.1145\/332306.332553"},{"key":"14_CR10","unstructured":"Parida, L., Rigoutsos, I., Floratos, A., Platt, D.E., Gao, Y.: Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. In: SODA, pp. 297\u2013308 (2000)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2005.5","volume":"2","author":"N. Pisanti","year":"2005","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: Bases of motifs for generating repeated patterns with wild cards. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a02(1), 40\u201350 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0167-8655(94)00095-K","volume":"16","author":"H. Soldano","year":"1995","unstructured":"Soldano, H., Viari, A., Champesme, M.: Searching for flexible repeated patterns using a non-transitive similarity relation. Pattern Recognition Letters\u00a016, 243\u2013246 (1995)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Information Technology in Bio- and Medical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23208-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T05:30:11Z","timestamp":1560490211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23208-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232077","9783642232084"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23208-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}