Reconstructing strings from substrings in rounds

Reconstructing strings from substrings in rounds
复制标题

轮次从子字符串重建字符串

DOI:
--
复制
发表时间:
1995
期刊:
Proceedings of IEEE 36th Annual Foundations of Computer Science
影响因子:
--
通讯作者:
S. Skiena
S. Skiena
中科院分区:
--
文献类型:
--
作者:
D. Margaritis;S. Skiena

文献摘要

被引文献

相似文献

我们建立了各种组合边界上的权衡固有的重建字符串使用几轮给定数量的子串查询每轮。这些结果使我们提出了一种新的杂交测序方法(SBH),该方法使用相互作用来显著减少用于大DNA片段从头测序的寡核苷酸的数量,同时保持SBH的主要优势--并行性。
We establish a variety of combinatorial bounds on the tradeoffs inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results lead us to propose a new approach to sequencing by hybridization (SBH), which uses interaction to dramatically reduce the number of oligonucleotides used for de novo sequencing of large DNA fragments, while preserving the parallelism which is the primary advantage of SBH.