Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

V. Tchendji, H. Tepiele, M. Onabid, J. Myoupo, and J. Zeutouo. Parallel Comput., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jerry Chou

Jerry Ding

Jerry Mackel

Jerry Easo

Jerry Folk

Other publications of authors with the same name

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.V. Tchendji, A. Ngomade, J. Zeutouo, and J. Myoupo. Parallel Comput., (2020)High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem.J. Zeutouo, V. Tchendji, and J. Myoupo. J. Supercomput., 78 (4): 5306-5332 (2022)A Parallel Tiled and Sparsified Four-Russians Algorithm for Nussinov's RNA Folding.V. Tchendji, F. Youmbi, C. Djamégni, and J. Zeutouo. IEEE ACM Trans. Comput. Biol. Bioinform., 20 (3): 1795-1806 (2023)Separation of Concerns in an Edge-Based Compartmental Modeling Framework.A. Fodjo, J. Zeutouo, and S. Bowong. BIOINFORMATICS, page 262-269. SCITEPRESS, (2023)A fast sequential algorithm for the matrix chain ordering problem.J. Zeutouo, V. Tchendji, and J. Myoupo. Concurr. Comput. Pract. Exp., (2021)Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem.J. Zeutouo, V. Tchendji, and J. Myoupo. CoRR, (2022)An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph.V. Tchendji, and J. Zeutouo. Data Sci. Eng., 4 (2): 141-156 (2019)A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem.V. Tchendji, H. Tepiele, M. Onabid, J. Myoupo, and J. Zeutouo. Parallel Comput., (2022)Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem.J. Zeutouo, V. Tchendji, and J. Myoupo. ARIMA J., (2023)

BibSonomy

Disambiguation of "Zeutouo, Jerry Lacmou"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Jerry Chou

Jerry Ding

Jerry Mackel

Jerry Easo

Jerry Folk

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Zeutouo, Jerry Lacmou"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem.

Please choose a person to relate this publication to

Jerry Chou

Jerry Ding

Jerry Mackel

Jerry Easo

Jerry Folk

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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