activity
20192021
most citedString Matching with Wildcards in the Massively Parallel Computation Model

5 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.DS2020

Approximating LCS in Linear Time: Beating the Barrier

MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin +1

Longest common subsequence (LCS) is one of the most fundamental problems in combinatorial optimization. Apart from theoretical importance, LCS has enormous applications in bioinfor…