A New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem

Simple item page
dc.contributor.authorKorkin, Dmitry
dc.date.accessioned2023-03-01T18:28:55Z
dc.date.available2023-03-01T18:28:55Z
dc.description.abstractThis work introduces a new parallel algorithm for computing a multiple longest common subsequence (MLCS). Given a set of strings, the longest common subsequence can be obtained by removing a number of symbols from each sequence. Although there was a lot of research done in the parallelization of MLCS algorithms for the special case of two sequences, so far there were no any general parallel methods for computing MLCS of an arbitrary number of sequences. Our method is a parallel approach to dominant points-based method recently proposed by Hakata and Imai. The parallel algorithm is presented and the related theoretical results as well as the algorithm’s implementation on IBM SP3 using MPI system are discussed. Keywords: longest common subsequence, dominant points, parallel algorithms, IBM SP3
dc.description.copyrightCopyright @ Dmitry Korkin.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14885
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleA New Dominant Point-Based Parallel Algorithm for Multiple Longest Common Subsequence Problem
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
69.95 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports