Abstract
The process of reading a DNA molecule can be divided into three phases: sequencing,assembly and finishing. The draft sequence after assembly has gaps with no coverage and regions of poor coverage. Finishing by walks is a process by which the DNA in these regions is resequenced. Selective sequencing is expensive and time consuming. Therefore, the laboratory process of finishing is modeled as an optimization problem aimed at minimizing laboratory cost. We give an algorithm that solves this problem optimally and runs in worst case \(O(n^{1{3\over4}})\) time.
Supported by NSF Grant CCR-0311321.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Czabarka, É., Konjevod, G., Marathe, M.V., Percus, A.G., Torney, D.C.: Algorithms for optimizing production DNA sequencing. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), January 9-11, pp. 399–408. ACM Press, New York (2000)
Gordon, D., Abajian, C., Green, P.: Consed: A graphical tool for sequence finishing. Genome Research 8, 195–202 (1998)
Gordon, D., Desmarais, C., Green, P.: Automated finishing with autofinish. Genome Research 4, 614–625 (2001)
Hart, D.: An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing. In: Proceedings of the 13th Annual ACMSIAM Symposium On Discrete Algorithms (SODA 2002), January 6-8, pp. 885–893. ACM Press, New York (2002)
Human genome project, U.S. department of energy. Human Genome News, 9(3) (July 1998)
Percus, A.G., Torney, D.C.: Greedy algorithms for optimized DNA sequencing. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), N.Y., January 17-19, pp. 955–956. ACM-SIAM (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhargava, A., Kosaraju, S.R. (2004). An Algorithm for Computing DNA Walks. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive