Mining Longest Common Subsequence and Other Related Patterns Using DNA Operations

Longest Common Subsequence (LCS) and Shortest Common Subsequence (SCS) problems are to find subsequences in given sequences in which the subsequence is as long as possible and as short as possible subsequence respectively. These subsequences are not necessarily contiguous or unique. In this paper, the authors have proposed two new approaches to find LCS and SCS, of N sequences parallely, using DNA operations. These approaches can be used to find LCS and SCS, of any window size, from any number of sequences, and from any type of input data.

Provided by: University of Madeira Topic: Big Data Date Added: Jul 2012 Format: PDF

Download Now

Find By Topic