Parallel Algorithm for Longest Common Subsequence in a String
Data Structures and Algorithms
2013-06-20 v1
Abstract
In the area of Pattern Recognition and Matching, finding a Longest Common Subsequence plays an important role. In this paper, we have proposed one algorithm based on parallel computation. We have used OpenMP API package as middleware to send the data to different processors. We have tested our algorithm in a system having four processors and 2 GB physical memory. The best result showed that the parallel algorithm increases the performance (speed of computation) by 3.22.
Cite
@article{arxiv.1306.4627,
title = {Parallel Algorithm for Longest Common Subsequence in a String},
author = {Tirtharaj Dash and Tanistha Nayak},
journal= {arXiv preprint arXiv:1306.4627},
year = {2013}
}
Comments
appeared in: Proceedings of National Conference on Artificial Intelligence, Robotics and Embedded Systems (AIRES) - 2012, Andhra University, Visakhapatnam (29-30 June, 2012), pp. 66-69