{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T22:12:24Z","timestamp":1719007944400},"reference-count":20,"publisher":"Wiley","issue":"14","license":[{"start":{"date-parts":[[2004,8,25]],"date-time":"2004-08-25T00:00:00Z","timestamp":1093392000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[2004,11,25]]},"abstract":"Abstract<\/jats:title>In this paper we consider the problem of DNA compression. It is well known that one of the main features of DNA sequences is that they contain substrings which are duplicated except for a few random mutations. For this reason most DNA compressors work by searching and encoding approximate repeats. We depart from this strategy by searching and encoding only exact repeats. However, we use an encoding designed to take advantage of the possible presence of approximate repeats. Our approach leads to an algorithm which is an order of magnitude faster than any other algorithm and achieves a compression ratio very close to the best DNA compressors. Another important feature of our algorithm is its small space occupancy which makes it possible to compress sequences hundreds of megabytes long, well beyond the range of any previous DNA compressor. Copyright \u00a9 2004 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/spe.619","type":"journal-article","created":{"date-parts":[[2004,8,25]],"date-time":"2004-08-25T11:01:43Z","timestamp":1093431703000},"page":"1397-1411","source":"Crossref","is-referenced-by-count":38,"title":["A simple and fast DNA compressor"],"prefix":"10.1002","volume":"34","author":[{"given":"Giovanni","family":"Manzini","sequence":"first","affiliation":[]},{"given":"Marcella","family":"Rastero","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,8,25]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"409","volume-title":"Proceedings of the 11th ACM\u2010SIAM Symposium on Discrete Algorithms (SODA '00)","author":"Lanctot JK","year":"2000"},{"key":"e_1_2_1_3_2","volume-title":"Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB\u201000)","author":"Chen X","year":"2000"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.2.149"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-8485(00)80006-6"},{"key":"e_1_2_1_6_2","first-page":"32","article-title":"Chain letters and evolutionary histories","author":"Bennet C","year":"2003","journal-title":"Scientific American"},{"key":"e_1_2_1_7_2","first-page":"68","article-title":"Discovering by minimal length encoding: A case study in molecular evolution","volume":"12","author":"Milosavjevic A","year":"1993","journal-title":"Machine Learning"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)90014-0"},{"key":"e_1_2_1_10_2","first-page":"143","volume-title":"Proceedings Data Compression Conference","author":"Apostolico A","year":"2000"},{"key":"e_1_2_1_11_2","first-page":"43","volume-title":"Proceedings of the Genome Informatics Workshop","author":"Matsumoto T","year":"2000"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.12.1696"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.440"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.892709"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00097-4"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.3.193"},{"key":"e_1_2_1_18_2","unstructured":"National Center for Biotechnology Information.http:\/\/www.ncbi.nih.gov[2003]."},{"key":"e_1_2_1_19_2","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"Witten IH","year":"1999"},{"key":"e_1_2_1_20_2","unstructured":"LonardiS. Off\u2010line home page.http:\/\/www.cs.ucr.edu\/\u02dcstelo\/Offline[2003]."},{"key":"e_1_2_1_21_2","unstructured":"ChenX.Personal communication 2003."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T12:26:03Z","timestamp":1700223963000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,25]]},"references-count":20,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2004,11,25]]}},"alternative-id":["10.1002\/spe.619"],"URL":"http:\/\/dx.doi.org\/10.1002\/spe.619","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,25]]}}}
