Zobrazit v EDS

Parallel Computation of Longest-Common-Subsequence

Uloženo v:
Podrobná bibliografie
Název: Parallel Computation of Longest-Common-Subsequence
Autoři: Mi Lu (10011950)
Rok vydání: 2021
Sbírka: Smithsonian Institution: Digital Repository
Témata: Computer System Architecture, Computer Software not elsewhere classified, Parallel Computer Implementation, mesh-con, nCUBE, PRAM, cache, thrashing, Data Compression, dependence analysis, polynomial product
Popis: A parallel algorithm for finding the longest common subsequence of two strings is presented. Our algorithm is executed on r processors, with r equal to the total number of pairs of positions at which two symbols match. Given two strings of length m and n respectively, m ≤ n, with preprocessing allowed, our algorithm achieves O(log⍴ log 2 n) time complexity where ⍴ is the longest common subsequence. Fast computing of Longest-Common-Subsequence is made possible due to the exploiting of the parallelism.
Druh dokumentu: article in journal/newspaper
Jazyk: unknown
Relation: https://figshare.com/articles/journal_contribution/Parallel_Computation_of_Longest-Common-Subsequence/13626533
DOI: 10.6084/m9.figshare.13626533.v1
Dostupnost: https://doi.org/10.6084/m9.figshare.13626533.v1
Rights: CC BY 4.0
Přístupové číslo: edsbas.A0E5B7E8
Databáze: BASE
Popis
Abstrakt:A parallel algorithm for finding the longest common subsequence of two strings is presented. Our algorithm is executed on r processors, with r equal to the total number of pairs of positions at which two symbols match. Given two strings of length m and n respectively, m ≤ n, with preprocessing allowed, our algorithm achieves O(log⍴ log 2 n) time complexity where ⍴ is the longest common subsequence. Fast computing of Longest-Common-Subsequence is made possible due to the exploiting of the parallelism.
DOI:10.6084/m9.figshare.13626533.v1