Development of an Efficient Algorithm for DNA Sequence Alignment Based on Cosine Similarity

Abstract

In our thesis we wanted to work with approximate gene matching with the help of the cosine similarity factor. Though several other gene matching algorithms has been invented since the post Sanger method period but quite a little advancement has been done in this field. We have chalked out a new formula for gene sequence matching and implemented gap algorithm in it and then evaluated it with some of the well established algorithm (The Dot-Matrix method, The Dynamic Programming and The Word Method.). We sacrificed efficiency for accuracy but we think our acumen of time was not bad either. We have our sight set upon further developing it and more assessment of it in near future.