Positional_LCS: A position based algorithm to find Longest Common Subsequence (LCS) in Sequence Database (SDB)

Finding Longest Common Subsequence (LCS) involves comparison of two or more sequences and find the Longest Subsequence which is common to all sequences. This NP hard problem is useful in various Sequence Database (SDB) applications such as finding Motif, gene/protein sequence comparisons in Biological SDB, finding the highly demanded item list from the Inventory SDB, finding the most traded Shares list in Stock Trading SDB. The existing algorithms have drawbacks of high computational time as they focused on both matched and unmatched positions of sequences to get LCS. This is overcome by proposed Positional_LCS by focusing only on matched positions. Thus the Positional_LCS reduces the time complexity than the existing algorithms.