Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets

03/08/2018
by   Kuan Cheng, et al.
0

Synchronization strings are recently introduced by Haeupler and Shahrasbi (STOC 2017) in the study of codes for correcting insertion and deletion errors (insdel codes). They showed that for any parameter ε>0, synchronization strings of arbitrary length exist over an alphabet whose size depends only on ε. Specifically, they obtained an alphabet size of O(ε^-4), which left an open question on where the minimal size of such alphabets lies between Ω(ε^-1) and O(ε^-4). In this work, we partially bridge this gap by providing an improved lower bound of Ω(ε^-3/2), and an improved upper bound of O(ε^-2). We also provide fast explicit constructions of synchronization strings over small alphabets. Further, along the lines of previous work on similar combinatorial objects, we study the extremal question of the smallest possible alphabet size over which synchronization strings can exist for some constant ε < 1. We show that one can construct ε-synchronization strings over alphabets of size four while no such string exists over binary alphabets. This reduces the extremal question to whether synchronization strings exist over ternary alphabets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2021

Synchronization Strings and Codes for Insertions and Deletions – a Survey

Already in the 1960s, Levenshtein and others studied error-correcting co...
research
10/01/2019

Scalable String Reconciliation by Recursive Content-Dependent Shingling

We consider the problem of reconciling similar, but remote, strings with...
research
11/30/2022

Approximating binary longest common subsequence in almost-linear time

The Longest Common Subsequence (LCS) is a fundamental string similarity ...
research
05/31/2021

Lower Bounds for the Number of Repetitions in 2D Strings

A two-dimensional string is simply a two-dimensional array. We continue ...
research
04/19/2023

Optimal Codes Detecting Deletions in Concatenated Binary Strings Applied to Trace Reconstruction

Consider two or more strings 𝐱^1,𝐱^2,…, that are concatenated to form 𝐱=...
research
10/10/2022

Generalized Unique Reconstruction from Substrings

This paper introduces a new family of reconstruction codes which is moti...
research
01/25/2022

The development of a portable elbow exoskeleton with a Twisted Strings Actuator to assist patients with upper limb inhabitation

Over the years, the number of exoskeleton devices utilized for upper-lim...

Please sign up or login with your details

Forgot password? Click here to reset