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

Authors:
Jean-Frédéric Myoupo;David Semé
Affiliations:
-;-
Venue:
Journal of Parallel and Distributed Computing
Year:
1999

Citing 0
Cited 4

An Efficient Implementation for the BROADCAST Instruction of BSR+

IEEE Transactions on Parallel and Distributed Systems
Optimal BSR Solutions to Several Convex Polygon Problems

The Journal of Supercomputing
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory

The Journal of Supercomputing
A parallel LCS algorithm for biosequences alignment

Proceedings of the 2nd international conference on Scalable information systems

Quantified Score

Hi-index	0.00

Visualization

Abstract