← Search

Alan J.X. Guo

4 accepted papers

2026

Disturbance-based Discretization, Differentiable IDS Channel, and an IDS-Correcting Code for DNA-based Storage

AAAI 2026technical

With recent advancements in next-generation data storage, especially in biological molecule-based storage, insertion, deletion, and substitution (IDS) error-correcting codes have garnered increased attention. However, a universal method for designing tailored IDS-correcting codes across varying chan

Cited by 0SourcePDFScholar
2025

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel

NeurIPS 2025poster

With the emergence of new storage and communication methods, the insertion, deletion, and substitution (IDS) channel has attracted considerable attention. However, many topics on the IDS channel and the associated Levenshtein distance remain open, making the invention of a novel IDS-correcting code…

Cited by 0SourceScholar
2024

Levenshtein Distance Embedding with Poisson Regression for DNA Storage

AAAI 2024technical

Efficient computation or approximation of Levenshtein distance, a widely-used metric for evaluating sequence similarity, has attracted significant attention with the emergence of DNA storage and other biological applications. Sequence embedding, which maps Levenshtein distance to a conventional dist…

Cited by 2SourcePDFScholar
2022

Deep Squared Euclidean Approximation to the Levenshtein Distance for DNA Storage

ICML 2022spotlight

Storing information in DNA molecules is of great interest because of its advantages in longevity, high storage density, and low maintenance cost. A key step in the DNA storage pipeline is to efficiently cluster the retrieved DNA sequences according to their similarities. Levenshtein distance is the…

Cited by 7SourcePDFScholar