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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 31; H. 18
Hauptverfasser:	João, Mario, Sena, Alexandre C., Rebello, Vinod E. F.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 25.09.2019
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!