A Bayes-optimal solution to the planted motif identification problem

Read full text Summarise with VIRAT
Authors: Edward Wijaya
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The planted (l, d)-motif problem asks whether a short DNA pattern hidden across multiple sequences can be recovered despite random mutations. We pose the identification problem as a Bayesian hypothesis test and derive its optimal scoring function. On the hardest standard benchmark, where approximately five spurious motifs arise by chance, the optimal score identifies the planted motif in 93% of trials; the scoring rule used by all prior algorithms achieves below 1%. An end-to-end algorithm using optimal scoring solves 19 of 20 benchmark instances with no regressions on easier cases.

Fields of Study & Subjects

Algorithms and Data Compression Genomics and Phylogenetic Studies Fractal and DNA sequence analysis

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
28 March 2026
Language
EN
Document type
Preprint