{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:15Z","timestamp":1759638375299},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447529"},{"type":"electronic","value":"9783662447536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44753-6_12","type":"book-chapter","created":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T08:08:34Z","timestamp":1408090114000},"page":"148-160","source":"Crossref","is-referenced-by-count":2,"title":["Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences"],"prefix":"10.1007","author":[{"given":"Laxmi","family":"Parida","sequence":"first","affiliation":[]},{"given":"Cinzia","family":"Pizzi","sequence":"additional","affiliation":[]},{"given":"Simona E.","family":"Rombo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms\u00a02, 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"12_CR2","unstructured":"Allali, A., Sagot, M.-F.: The at most k deep factor tree. Technical Report (2004)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652704773416867","volume":"11","author":"A. Apostolico","year":"2004","unstructured":"Apostolico, A., Parida, L.: Incremental paradigms of motif discovery. Journal of Computational Biology\u00a011, 1 (2004)","journal-title":"Journal of Computational Biology"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/1748-7188-6-5","volume":"6","author":"A. Apostolico","year":"2011","unstructured":"Apostolico, A., Pizzi, C., Ukkonen, E.: Efficient algorithms for the discovery of gapped factors. Algorithms for Molecular Biology\u00a06, 5 (2011)","journal-title":"Algorithms for Molecular Biology"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-39159-0_25","volume-title":"Pattern Recognition in Bioinformatics","author":"M. Comin","year":"2013","unstructured":"Comin, M., Antonello, M.: Fast Computation of Entropic Profiles for the Detection of Conservation in Genomes. In: Ngom, A., Formenti, E., Hao, J.-K., Zhao, X.-M., van Laarhoven, T. (eds.) PRIB 2013. LNCS, vol.\u00a07986, pp. 277\u2013288. Springer, Heidelberg (2013)"},{"issue":"43","key":"12_CR6","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. Theoretical Computer Science\u00a0410(43), 4391\u20134401 (2009)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","unstructured":"Fernandes, F., Freitas, A.T., Vinga, S.: Detection of conserved regions in genomes using entropic profiles. INESC-ID Tec. Rep. 33\/2007"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1186\/1756-0500-2-72","volume":"2","author":"F. Fernandes","year":"2009","unstructured":"Fernandes, F., Freitas, A.T., Almeida, J.S., Vinga, S.: Entropic Profiler \u2013 detection of conservation in genomes using information theory. BMC Research Notes\u00a02, 72 (2009)","journal-title":"BMC Research Notes"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"5061","DOI":"10.1103\/PhysRevE.50.5061","volume":"50","author":"H. Herzel","year":"1994","unstructured":"Herzel, H., Ebeling, W., Schmitt, A.O.: Entropies of biosequences: The role of repeats. Physical Review E\u00a050, 5061\u20135071 (1994)","journal-title":"Physical Review E"},{"issue":"4","key":"12_CR10","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. Journal of Computational Biology\u00a018(4), 535\u2013545 (2011)","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2005.5","volume":"2","author":"R. Grossi","year":"2005","unstructured":"Grossi, R., Pisanti, N., Crochemore, M., Sagot, M.-F.: Bases of motifs for generating repeated patterns with wild cards. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a02(1), 40\u201350 (2005)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"1-3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(03)00053-7","volume":"304","author":"J.C. Na","year":"2003","unstructured":"Na, J.C., Apostolico, A., Iliopulos, C.S., Park, K.: Truncated suffix trees and their application to data compression. Theoretical Computer Science\u00a0304(1-3), 87\u2013101 (2003)","journal-title":"Theoretical Computer Science"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Parida, L.: Pattern Discovery in Bioinformatics: Theory & Algorithms. Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010732"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-34109-0_41","volume-title":"String Processing and Information Retrieval","author":"L. Parida","year":"2012","unstructured":"Parida, L., Pizzi, C., Rombo, S.E.: Characterization and Extraction of Irredundant Tandem Motifs. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 385\u2013397. Springer, Heidelberg (2012)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2013.08.012","volume":"525","author":"L. Parida","year":"2014","unstructured":"Parida, L., Pizzi, C., Rombo, S.E.: Irredundant tandem motifs. Theoretical Computer Science\u00a0525, 89\u2013102 (2014)","journal-title":"Theoretical Computer Science"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2012.06.021","volume":"460","author":"S.E. Rombo","year":"2012","unstructured":"Rombo, S.E.: Extracting string motif bases for quorum higher than two. Theoretical Computer Science\u00a0460, 94\u2013103 (2012)","journal-title":"Theoretical Computer Science"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1186\/1471-2105-8-393","volume":"8","author":"S. Vinga","year":"2007","unstructured":"Vinga, S., Almeida, J.S.: Local Renyi entropic profiles of DNA sequences. BMC Bioinformatics\u00a08, 393 (2007)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44753-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:03:44Z","timestamp":1558958624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44753-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447529","9783662447536"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44753-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}