While technology keeps growing, the world keeps shrinking, and this transformation is possible through compression. Earlier, computers occupied a room, now people are conveniently carrying in their hand. These massive developments are possible through compression in internet and other real time applications. Many English text compression algorithms fail to compress genetic sequences due to “the specialty of encoded text in genetic sequences”. In addition to that in text compression very rare code word repetitions occur, where as, in DNA (Deoxyribo Nucleic Acid) the repetitions of codewords are more and more. So there may be a possibility that the compression ratio and gain will be more in DNA (Genomic) sequences. This assumption makes true when the Human genome project is deciphered. Many State-of-theart compression algorithms are existing in connection with DNA sequences. Existing techniques are focused on compression rate, compress gain, time and space as metrics, and questions arise such that whether encoded and decoded sequence is valid or not?. The resultant answer is validation. Validation is highly required for resultant sequence. In this paper, the proposed novel methodology SDV (Shift Distance Validation) an algorithmic approach is employed, to test the validity of decompressed sequences which is more important in security applications.