2013/06/19 by Tirtharaj Dash, Dash, Tirtharaj, Tanistha Nayak +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Network Packet Processing and Optimization #cs.DS
paper · pdf · doi:10.48550/arxiv.1306.4627
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
arxiv created 2013/06/19 · openalex publication_date 2013/06/19 · arxiv updated 2013/06/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.