Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism

DOI10.1007/11751649_18zbMath1175.68553OpenAlexW1590304071MaRDI QIDQ3603043

Peter Krusche, Alexander Tiskin

Publication date: 12 February 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751649_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

This page was built for publication: Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism