Quadratic-Time Hardness of LCS and other Sequence Similarity Measures

@article{Abboud2015QuadraticTimeHO,
  title={Quadratic-Time Hardness of LCS and other Sequence Similarity Measures},
  author={Amir Abboud and Arturs Backurs and Virginia Vassilevska Williams},
  journal={CoRR},
  year={2015},
  volume={abs/1501.07053}
}
Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequences are central tasks in a variety of applications. Simple dynamic programming algorithms solve these tasks in O(n) time, and despite an extensive amount of research, no algorithms with significantly better worst case upper bounds are known. In this paper, we show that an O(n) time algorithm, for some… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…