Research Article
An Optimal Seed Based Compression Algorithm for DNA Sequences
| Begin | | Read number of seeds from table. | | While 0) do | | Begin | | Read the at along with the (no. of repeats) for that seed. | | Store as Extended seed. | | Read the position of seed that is the last entry under that seed taken as . | | Insert the into sequence at . | | Decrement () by 1 | | While ( 0) do | | Begin | | Extended seed = seed | | Read position and type of repeat at | | Read the corresponding mismatch details. | | Make necessary changes to the extended seed, based on type of repeat and mismatch details. | | Insert this modified extended seed into the sequence at the position specified. | | Decrement by 1 | | End | | Decrement () by 1 | | End | | Output decompressed sequence. | | End |
|
