Deterministic Longest Common Subsequence Approximation in Near-Linear Time
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909712215179264 |
|---|---|
| author | Boneh, Itai Golan, Shay Kraus, Matan |
| author_facet | Boneh, Itai Golan, Shay Kraus, Matan |
| contents | We provide a deterministic algorithm that outputs an $O(n^{3/4} \log n)$-approximation for the Longest Common Subsequence (LCS) of two input sequences of length $n$ in near-linear time. This is the first deterministic approximation algorithm for LCS that achieves a sub-linear approximation ratio in near-linear time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_22486 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Deterministic Longest Common Subsequence Approximation in Near-Linear Time Boneh, Itai Golan, Shay Kraus, Matan Data Structures and Algorithms F.2.0 We provide a deterministic algorithm that outputs an $O(n^{3/4} \log n)$-approximation for the Longest Common Subsequence (LCS) of two input sequences of length $n$ in near-linear time. This is the first deterministic approximation algorithm for LCS that achieves a sub-linear approximation ratio in near-linear time. |
| title | Deterministic Longest Common Subsequence Approximation in Near-Linear Time |
| topic | Data Structures and Algorithms F.2.0 |
| url | https://arxiv.org/abs/2507.22486 |