On the parallelization of Hirschberg's algorithm for multi‐core and many‐core systems

Summary Finding the longest common subsequence between two strings in acceptable time frames is crucial to solving various problems in different fields of study. To ensure the optimal solution is found, algorithms based on dynamic programming are employed almost exclusively. While the most commonly...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 31; no. 18
Main Authors:	João, Mario, Sena, Alexandre C., Rebello, Vinod E. F.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 25.09.2019
Subjects:	Algorithms Complexity Dynamic programming Hirschberg's algorithm longest common subsequence (LCS) problem many‐core processors multi‐core systems Parallel processing Performance enhancement SIMD instructions
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!