Semi-Local LCS Algorithms for paper Efficient Parallel Algorithms for String Comparison
This repository contains the implementation of novel approaches to the semi-local longest common subsequence (LCS) problem, which aims for a detailed comparison between two strings without increasing the computational time. It introduces a hybrid approach and a unique bit-parallel LCS algorithm, marking a significant advancement in string algorithm research.
Hybrid Semi-Local LCS Algorithm: Combines traditional and innovative techniques for enhanced performance. Bit-Parallel LCS Algorithm: A novel approach to LCS computation, leveraging bit-level parallelism for efficiency. Performance Evaluation: Includes comparative analysis of new and existing parallel LCS algorithms, demonstrating the efficacy of the proposed solutions.