With the rapid growth in the size of DNA-related databases, methods for efficient sequence storage, Internet transmission, and search algorithms are urgently needed.
Most computers allocate one byte of disk space for character storage.
In this method, a DNA sequence is divided into a series of subsequences of four bases. A character symbol representing one of 256 combinations of the four base codes is stored instead of the full code. A four-fold increase in storage efficiency is achieved by this scheme. Using DSAS, Internet transmission of DNA sequences is also accelerated by a factor of four. An efficient DNA sequence comparison algorithm using DSAS will also be presented.