Learn More
In bioinformatics, the discovery of transcription factor binding affinities is important. This is done by sequence analysis of micro array data. The determination of continuous and gapped motifs accurately from the given long sequence of data, say genetic data is challenging and requires a detailed study. In this paper, we propose an algorithm that can be(More)
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 we have proposed two new approaches to find LCS and SCS, of N(More)
The Wyllie's list ranking algorithm takes a linked list data structure as an input and it pass the linked list successor elements to the succ1 array to find the Rank. The algorithm depends upon the Pointer jumping operation and its concepts. The motivation for this work is to parallelize the Wyllie's list ranking algorithm using three different parallel(More)
  • 1