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

DOI10.1006/JPDC.1999.1534MaRDI QIDQ1291016zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(9)

• Finding least-weight subsequences with fewer processors
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Systolic-based parallel architecture for the longest common subsequences problem
• scientific article; zbMATH DE number 1444291 (Why is no real title available?)
• OpenMP implementation of parallel longest common subsequence algorithm for mathematical expression retrieval
• Mining Bit-Parallel LCS-length Algorithms
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• Novel evolutionary models and applications to sequence alignment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291016)