Does anybody have sample code to calculate the longest common subsequence between two strings using GPU hardware?
Hello
A websearch for something like “longest common subsequence GPU OR CUDA” brings many results, but I assume that you are really looking for source code. I’m not aware of such a snippet, and did not find any ready-to-use CUDA implementation. I’d also be interested to see one, and see whether it could be ported to JCuda with acceptable effort. Maybe I can look at some of the papers, but as long as I have not read them, it’s hard to estimate how much effort it is to really implement something like this…
bye
Marco