Communication Dans Un Congrès Année : 1997

Efficient parallel computing of the length of a longest common subsequence of three strings

Fichier non déposé

Dates et versions

hal-03268037 , version 1 (22-06-2021)

Identifiants

  • HAL Id : hal-03268037 , version 1

Citer

Guillaume Luce, Jean-Frédéric Myoupo. Efficient parallel computing of the length of a longest common subsequence of three strings. SIAM Conference on Parallel Processing for Scientific Computing (PPSC ), 1997, Minneapolis,, United States. ⟨hal-03268037⟩
40 Consultations
0 Téléchargements

Partager

  • More