Approximating LCS in linear time: beating the [MATH HERE] barrier

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 1181-1200, 2019.

Cited by: 0|Bibtex|Views22|DOI:https://doi.org/10.5555/3310435.3310507
EI
Other Links: dl.acm.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 programs1. Although a simple dynamic program computes LCS in quadratic time, it has been recently proven t...More

Code:

Data:

Your rating :
0

 

Tags
Comments