This includes work that deals with query language [35], data storage [36],[37], data compression [38],[39], index design [40], I/O scheduling [41], and data provenance [42].
Here, applications of data compression ideas in indexing, read alignment and other vital problems are discussed.
One aspect of data compression in genomics, index structures for sequencing data, is thoroughly discussed by Vyverman et al.[ 11].
Wavelet Trees have been introduced by Grossi et al. in SODA 2003 and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compression algorithms.
Figure 8 Data set for evaluation of data compression.
Although several papers have investigated the properties and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored.
Fingerprinting, copy control, broadcast monitoring, data authentication, multimedia indexing, content-based retrieval applications, medical imaging applications, error concealment, quality assessment, and improved data compression are only a few of the applications where watermarking can be usefully employed.
Examples are text conversion, data compression, and data encryption.
For example, I avoid almost any type of backup solution that involves data compression, even though compression speeds the backup process by squeezing more files onto fewer disks.
See also information theory: Data compression; telecommunication: Source encoding.
