arXiv Open Access 2012

Solving Cyclic Longest Common Subsequence in Quadratic Time

Andy Nguyen

Lihat Sumber

Abstrak

We present a practical algorithm for the cyclic longest common subsequence (CLCS) problem that runs in O(mn) time, where m and n are the lengths of the two input strings. While this is not necessarily an asymptotic improvement over the existing record, it is far simpler to understand and to implement.

Topik & Kata Kunci

cs.DS

Penulis (1)

Andy Nguyen

Format Sitasi

APA MLA BibTeX

Nguyen, A. (2012). Solving Cyclic Longest Common Subsequence in Quadratic Time. https://arxiv.org/abs/1208.0396

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓