An Efficient Fast Pruned Parallel Algorithm for finding Longest Common Subsequences in BioSequences

This paper presents an Efficient and fast approach to identify the Longest Common Subsequence between Biosequences. Identifying Longest Common Subsequence between two or more biosequences is an important problem in computer science due to its complexity and applicability to the field of biology. This Algorithm achieves its efficiency in using computational resources by doing specific pruning in the process of identifying the Longest Common Subsequence. The proposed approach has various steps like Identifying Initial Identical Character Pairs between the Sequences, its Successors, Pruning to retain potential successors and backtracking. The execution results indicate that with the proposed algorithm Memory Efficiency and Fast Execution are achieved over the prominent FAST_LCS Algorithm while retaining the precision of FAST_LCS.