We study the problem of finding the sequence of an unknown DNA fragment given the set of its k-long subsequences and a homologous sequence, namely a sequence that is similar to the target sequence. Such a sequence is available in some applications, e.g., when detecting single nucleotide polymorphisms. Pe'er and Shamir studied this problem and presented a heuristic algorithm for it. In this paper, we give an algorithm with provable performance: We show that under some assumptions, the algorithm can reconstruct a random sequence of length O(4k) with high probability. We also show that no algorithm can reconstruct sequences of length Ω(log k· 4k). © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Tsur, D. (2003). Bounds for resequencing by hybridization. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2812, 498–511. https://doi.org/10.1007/978-3-540-39763-2_35
Mendeley helps you to discover research relevant for your work.