A Fuzzy Approach to Multiple Sequence Alignment

Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of matching in sequence alignment is generally finding longest common subsequences (LCS). However, finding a longest common subsequence may not be the best solution. This paper attempts to provide a fuzzy approach to multiple sequences alignment (MSA). It is attempted to improve the speed and flexibility of sequences identification. This algorithm is a hybrid algorithm for MSA. The algorithm involves Dynamic Programming (DP) technique to align sequences progressively. Fuzzy logic is used to increase the flexibility. We have found that the algorithm was useful and in some cases better than existing techniques.