Time-efficient parallel algorithms for the longest common subsequence and related problems

DOI10.1006/jpdc.1999.1534zbMath0931.68053OpenAlexW2087191404MaRDI QIDQ1291016

Jean-Frédéric Myoupo, David Semé

Publication date: 3 June 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1999.1534

zbMATH Keywords

broadcasting with selective reduction

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (2)

Novel evolutionary models and applications to sequence alignment problems ⋮ OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval

This page was built for publication: Time-efficient parallel algorithms for the longest common subsequence and related problems