Approximating LCS in linear time: Beating the sqrt{n} Barrier

symposium on discrete algorithms, pp. 1181-1200, 2019.

Cited by: 0|Bibtex|Views91
Other Links: academic.microsoft.com|arxiv.org

Abstract:

Longest common subsequence (LCS) is one of the most fundamental problems in combinatorial optimization. Apart from theoretical importance, LCS has enormous applications in bioinformatics, revision control systems, and data comparison programs. Although a simple dynamic program computes LCS in quadratic time, it has been recently proven ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments