The primary purpose of this work is to study, implement and analyze the performance of parallel algorithms related to subsequence problems. The problems include string to string correction problem, to determine the longest common subse-quence problem and solving the sum-range-product, 1 — D pattern matching, longest non-decreasing (non-increasing) (LNS) and… (More)

@inproceedings{Shahrokhi2014StudyOP,
title={Study of Parallel Algorithms Related to Subsequence Problems on the Sequent Multiprocessor System},
author={Farhad Shahrokhi and Surendra Pothuru},
year={2014}
}