' E. Rivals, J-P. Delahaye, M. Dauchet and O. Delgrange. A Guaranteed Compression Scheme for Repetitive DNA Sequences. LIFL Lille I University, technical report IT-285, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Compression Algorithm for DNA Sequences and Its Applications in.. - Chen (1999) (5 citations) (Correct)
....support that the DNA sequences should be reasonably compressible. However, such regularities are often blurred by random mutation, translocation, cross over, and reversal events, as well as sequencing errors. It is well recognized that the compression of DNA sequences is a very difficult task [5, 7, 16, 10]. The DNA sequences only consist of 4 nucleotide bases fa; c; g; tg, 2 bits are enough to store each base. However, if one applies standard compression software such as the Unix compress and compact or the MS DOS archive programs pkzip and arj , they all expand the file with more than 2 ....
....them by repeat length and the position of a previous repeat occurrence. In addition, they also use arithmetic coding of order 2 if no significant repetition is found. In fact, the difference between Biocompress and Biocompress 2 is the addition of order 2 arithmetic coding. E. Rivals et al. [16] give another compression algorithm Cfact, which searches the longest exact matching repeat using suffix tree data structure in an entire sequence. The idea of Cfact is basically the same as Biocompress 2 except that Cfact is a two pass algorithm. It builds the suffix tree in the first pass. In ....
[Article contains additional citation context not shown here]
' E. Rivals, J-P. Delahaye, M. Dauchet and O. Delgrange. A Guaranteed Compression Scheme for Repetitive DNA Sequences. LIFL Lille I University, technical report IT-285, 1995.
Compression of Biological Sequences by Greedy Off-line.. - Apostolico, Lonardi (2000) (Correct)
....been associated with the compressibility of a sequence. From such a perspective, the amount of compression achievable on genetic sequences has been used in the detection of fragments carrying biological significance, or in assessing the relatedness of fragments and sequences. We refer to, e.g. [2, 6, 7, 8, 10, 11, 12, 15, 16] and references therein for a sampler of the rich literature existing on these subjects. In bio sequence repositories and other applications, like for instance in the production of a Cd rom or magnetic disk for massive data dissemination, one could afford the extra cost of performing compression ....
E. Rivals, J. P. Delahaye, M. Dauchet, and O. Delgrange. A guaranteed compression scheme for repetitive DNA sequences. In J. A. Storer and M. Cohn, eds., Data Compression Conference, page 453, Snowbird, Utah, 1996.
Off-line Compression by Greedy Textual Substitution - Apostolico, Lonardi (2000) (1 citation) (Correct)
....From such a perspective, the amount of compression achievable on genetic sequences has been used in the detection of fragments carrying biological signi cance, or in assessing the relatedness of fragments and sequences. We refer to, e.g. 23] 24] 22] 25] 26] 27] 28] 29] 30] [31], 32] and references therein for a sampler of the rich literature existing on these subjects. The structure of the paper is as follows. In sections II and III we give some background and notation, and describe a data structure used to gather the statistics of the text. The overall design is ....
E. Rivals, J. P. Delahaye, M. Dauchet, and O. Delgrange, \A guaranteed compression scheme for repetitive DNA sequences, " in Data Compression Conference, J. A. Storer and M. Cohn, Eds., Snowbird, Utah, 1996, p. 453, IEEE Computer Society Press, TCC.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC