通过极值de Bruijn子图实现最小标签数下的DNA标记容量
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs
AI总结:
本文研究在DNA标记中,用最少等长标签达到最大标记容量(DNA序列为2,任意字母表为$\log_2q$)的问题,通过分析de Bruijn图的极值路径唯一子图,给出上下界并证明渐近结果。
摘要:
DNA标记是分子生物学和生物技术中的一种工具,用于在分子水平上可视化、检测和研究DNA。在此过程中,DNA分子被一组特定模式(称为标签)标记,然后进行成像。生成的图像被建模为一个$(\ell+1)$元序列,其中$\ell$是标签的数量,在该序列中,任何非零符号表示DNA分子中相应标签的出现。标记容量是指在给定任意标签集合的情况下,标记过程所能达到的最大信息速率。本文的主要目标是研究在DNA序列上实现最大标记容量2,或在大小为$q$的任意字母表上实现$\log_2q$所需的最短长度标签的最小数量。解决此问题需要研究de Bruijn图中具有最多边数的路径唯一子图。我们给出了该值的上界和下界。我们与现有文献建立了新的联系,从而证明了当标签长度趋于无穷时的一个渐近结果。
英文摘要:
DNA labeling is a tool in molecular biology and biotechnology to visualize, detect, and study DNA at the molecular level. In this process, a DNA molecule is labeled by a set of specific patterns, referred to as labels, and is then imaged. The resulting image is modeled as an $(\ell+1)$-ary sequence, where $\ell$ is the number of labels, in which any non-zero symbol indicates the appearance of the corresponding label in the DNA molecule. The labeling capacity refers to the maximum information rate that can be achieved by the labeling process for any given set of labels. The main goal of this paper is to study the minimum number of labels of the same length required to achieve the maximum labeling capacity of 2 for DNA sequences or $\log_2q$ for an arbitrary alphabet of size $q$. The solution to this problem requires the study of path unique subgraphs of the de Bruijn graph with the largest number of edges. We provide upper and lower bounds on this value. We draw new connections to existing literature that let us prove an asymptotic result as the label length tends to infinity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。