In EDS ansehen

Parallel Computation of Longest-Common-Subsequence

Gespeichert in:

Bibliographische Detailangaben
Titel:	Parallel Computation of Longest-Common-Subsequence
Autoren:	Mi Lu (10011950)
Publikationsjahr:	2021
Bestand:	Smithsonian Institution: Digital Repository
Schlagwörter:	Computer System Architecture, Computer Software not elsewhere classified, Parallel Computer Implementation, mesh-con, nCUBE, PRAM, cache, thrashing, Data Compression, dependence analysis, polynomial product
Beschreibung:	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.
Publikationsart:	article in journal/newspaper
Sprache:	unknown
Relation:	https://figshare.com/articles/journal_contribution/Parallel_Computation_of_Longest-Common-Subsequence/13626533
DOI:	10.6084/m9.figshare.13626533.v1
Verfügbarkeit:	https://doi.org/10.6084/m9.figshare.13626533.v1
Rights:	CC BY 4.0
Dokumentencode:	edsbas.A0E5B7E8
Datenbank:	BASE

Beschreibung
Abstract:	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