A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem

In this paper, we study the sequential substring constrained longest common subsequence (SSCLCS) problem. It is widely used in the bioinformatics field. Given two strings X and Y with respective lengths m and n, formed on an alphabet Σ and a constraint sequence C formed by ordered strings (c1,c2,…,c...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 111; p. 102927
Main Authors:	Kengne Tchendji, Vianney, Bogning Tepiele, Hermann, Akong Onabid, Mathias, Myoupo, Jean Frédéric, Lacmou Zeutouo, Jerry
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2022 Elsevier
Subjects:	Coarse-grained multicomputer Computer Science Constrained LCS Dynamic programming Parallel algorithm Task graph Three-dimensional partitioning Parallel algorithm Dynamic programming Constrained LCS Three-dimensional partitioning Coarse-grained multicomputer Task graph
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!