Fundamental Limits of Reference-Based Sequence Reordering

IEEE Transactions on Information Theory(2023)

引用 0|浏览9
暂无评分
摘要
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the fragments are relatively long, and typically no fragment appears more than once, the scaling of the failure probability of maximum likelihood reconstruction algorithm is exactly determined for perfect reconstruction and bounded for partial reconstruction. Second, the regime in which the fragments are relatively short and repeating fragments abound is characterized. A trade-off is stated between the fraction of fragments that cannot be adequately reconstructed vs. the distortion level allowed for the reconstruction of each fragment, while still allowing vanishing failure probability
更多
查看译文
关键词
Fragment reordering,permutation reconstruction,reference sequence,side information,sequence reconstruction,sliced sequences,DNA sequencing,bee-identification problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要