Parallelization of the dynamic programming algorithm for solving the longest common subsequence problem

We address in this paper the design and analysis of cost-optimal parallel algorithms for solving the problem of the longest common subsequence. Starting from the standard sequential dynamic programming algorithm which has the structure of a perfect nest of two embedded loops, we make use of a specif...

Full description

Bibliographic Details

Published in:	ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 pp. 1 - 8
Main Authors:	Ben Mabrouk, Bchira, Hasni, Hamadi, Mahjoub, Zaher
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2010
Subjects:	Arrays Artificial neural networks bioinformatics Complexity theory dependence analysis dynamic program-ming greedy approch Lead longest common subsequence loop nest makespan parallel algorithm Phase change random access memory scheduling unimodular transformation
ISBN:	9781424477166, 1424477166
ISSN:	2161-5322
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!