Deterministic Longest Common Subsequence Approximation in Near-Linear Time

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.

Publication Details

Journal
ArXiv.org
Published
2025-07-30
Primary Topic
Cell Image Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deterministic Longest Common Subsequence Approximation in Near-Linear Time

ArXiv.org
Cell Image Analysis Techniques
article

Deterministic Longest Common Subsequence Approximation in Near-Linear Time

article en

Abstract

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.

ArXiv.org
Openalex Percentile: Top 50%
Cell Image Analysis Techniques
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Deterministic Longest Common Subsequence Approximation in Near-Linear Time · ArXiv.org (2025) | TGRS Research Map | TGRS