5 citations · 6 across the 3 of their papers we have counts for
3 papers
Approximation Algorithms for LCS and LIS with Truly Improved Running Times
Aviad Rubinstein, Saeed Seddighin, Zhao Song +1
Longest common subsequence () is a classic and central problem in combinatorial optimization. While admits a quadratic time solution, recent evidence s…
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…
String Matching with Wildcards in the Massively Parallel Computation Model
MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin +1
We study distributed algorithms for string matching problem in presence of wildcard characters. Given a string T (a text), we look for all occurrences of another string P (a patter…