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

Celý popis

Podrobná bibliografie

Vydáno v:	Concurrency and computation Ročník 31; číslo 18
Hlavní autoři:	João, Mario, Sena, Alexandre C., Rebello, Vinod E. F.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc 25.09.2019
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!