z-logo
open-access-imgOpen Access
A CGM-Based Parallel Algorithm Using the Four-Russians Speedup for the 1-D Sequence Alignment Problem
Author(s) -
Jerry Lacmou Zeutouo,
Grace Colette Tessa Masse,
Franklin Ingrid Kamga Youmbi
Publication year - 2020
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - speedup , longest common subsequence problem , sequence (biology) , computer science , longest increasing subsequence , algorithm , task (project management) , subsequence , dynamic programming , parallel computing , computation , similarity (geometry) , parallel algorithm , edit distance , execution time , theoretical computer science , mathematics , artificial intelligence , genetics , biology , mathematical analysis , image (mathematics) , management , economics , bounded function

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom