{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:24:27Z","timestamp":1773278667795,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T00:00:00Z","timestamp":1143072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1186\/1748-7188-1-4","type":"journal-article","created":{"date-parts":[[2006,4,6]],"date-time":"2006-04-06T12:49:20Z","timestamp":1144327760000},"source":"Crossref","is-referenced-by-count":13,"title":["Mining, compressing and classifying with extensible motifs"],"prefix":"10.1186","volume":"1","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Comin","sequence":"additional","affiliation":[]},{"given":"Laxmi","family":"Parida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.12.013","volume":"335","author":"A Chattaraj","year":"2005","unstructured":"Chattaraj A, Parida L: An inexact suffix tree based algorithm for extensible pattern discovery. Theoretical Computer Science. 2005, 335: 3-14. 10.1016\/j.tcs.2004.12.013.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1093\/bioinformatics\/btg005","volume":"19","author":"S Vinga","year":"2003","unstructured":"Vinga S, Almeida J: Alignment-free sequence comparison \u2013 a review. Bioinformatics. 2003, 19 (4): 513-523.","journal-title":"Bioinformatics"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1997","unstructured":"Li M, Vitanyi P: An Introduction to Kolmogorov Complexity and Its Applications. 1997, Springer Verlag"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel A, Ziv J: On the Complexity of Finite Sequences. IEEE Transactions on Information Theory. 1976, 22: 75-81. 10.1109\/TIT.1976.1055501.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR5","first-page":"72","volume-title":"Proceedings of IEEE DCC Data Compression Conference","author":"A Apostolico","year":"2004","unstructured":"Apostolico A, Comin M, Parida L: Motifs in Ziv-Lempel-Welch Clef. Proceedings of IEEE DCC Data Compression Conference. 2004, 72-81."},{"key":"4_CR6","first-page":"257","volume-title":"Proceedings of IEEE DCC Data Compression Conference","author":"C Nevill-Manning","year":"1999","unstructured":"Nevill-Manning C, Witten I: Protein is Incompressible. Proceedings of IEEE DCC Data Compression Conference. 1999, 257-266."},{"issue":"12","key":"4_CR7","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li M, Chen X, Li X, Ma B, Vitanyi P: The Similarity Metric. IEEE Transactions on Information Theory. 2004, 50 (12): 3250-3254. 10.1109\/TIT.2004.838101.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M Li","year":"2001","unstructured":"Li M, Badger J, Chen X, Kwong S, Kearney P, Zhang H: An Information-based Sequence Distance and its Application to whole Mitochondrial Genome Phylogeny. Bioinformatics. 2001, 17 (2): 149-154.","journal-title":"Bioinformatics"},{"key":"4_CR9","volume-title":"Data Compression: Methods and Theory","author":"JA Storer","year":"1988","unstructured":"Storer JA: Data Compression: Methods and Theory. 1988, Computer Science Press"},{"issue":"11","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/5.892709","volume":"88","author":"A Apostolico","year":"2000","unstructured":"Apostolico A, Lonardi S: Off-line Compression by Greedy Textual Substitution. Proceedings of the IEEE. 2000, 88 (11): 1733-1744. 10.1109\/5.892709.","journal-title":"Proceedings of the IEEE"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"J Kieffer","year":"2000","unstructured":"Kieffer J, Yang E: Grammar-based Codes: a New Class of Universal Lossless Source Codes. IEEE Transactions on Information Theory. 2000, 46: 737-754. 10.1109\/18.841160.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/DCC.1994.305932","volume-title":"Proceedings of IEEE DCC Data Compression Conference","author":"C Neville-Manning","year":"1994","unstructured":"Neville-Manning C, Witten IH, Maulsby D: Compression by Induction of Hierarchical Grammars. Proceedings of IEEE DCC Data Compression Conference. 1994, 244-253."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(96)00068-3","volume":"59","author":"S DeAgostino","year":"1996","unstructured":"DeAgostino S, Storer JA: On-line Versus Off-line Computation in Dynamic Text Compression. Inform Process Lett. 1996, 59 (3): 169-174. 10.1016\/0020-0190(96)00068-3.","journal-title":"Inform Process Lett"},{"key":"4_CR14","first-page":"205","volume-title":"Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"E Lehman","year":"2002","unstructured":"Lehman E, Shelat A: Approximation Algorithms for Grammar Based Compression. Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA). 2002, 205-212."}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-1-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-1-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-1-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:34:52Z","timestamp":1548113692000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-1-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,23]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-1-4","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,23]]},"article-number":"4"}}