Realization Of Parallel Non-Alignment Based Approach To Find Longest Common Subsequence Using Hadoop MapReduce
The Longest Common Subsequence (LCS) identiﬁcation of biological sequences has signiﬁcant applications in bioinformatics. Due to the emerging growth in bioinformatics applications, new biological sequences with longer length have been used for processing, making it a great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed buttheir efﬁciency and effectivenessare not satisfactory with increasing complexity and size of the biological data. A parallel non-alignment based map reduce approach which help to solve the problem using distributed platform, is realized using Hadoop MapReduce.