Information theory of DNA shotgun sequencing

IEEE Transactions on Information Theory

Volumn 59, Issue 10, 2013, Pages 6273-6289

  Motahari, Abolfazl S ^a   Bresler, Guy ^b   Tse, David N C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b USA   (United States)

Author keywords

de novo assembly; DNA sequencing; information theory

Indexed keywords

ASSEMBLY ALGORITHM; ASYMPTOTIC LIMITS; BIOLOGY AND MEDICINE; CRITICAL PHENOMENON; DE NOVO ASSEMBLIES; DNA SEQUENCING; IMPACT OF NOISE; STATISTICAL MODELING;

GENE ENCODING; INFORMATION THEORY;

DNA SEQUENCES;

EID: 84884382382     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2270273     Document Type: Conference Paper

References (32)

1. R. Arratia, L. Goldstein, and L. Gordon, "Poisson approximation and the Chen-Stein method," Statist. Sci., vol. 5, no. 4, pp. 403-434, 1990.
2. R. Arratia, D. Martin, G. Reinert, and M. S. Waterman, "Poisson process approximation for sequence repeats, and sequencing by hybridization," J. Comput. Biol., vol. 3, pp. 425-463, 1996. (Pubitemid 26337809)
3. G. Bresler, M. Bresler, and D. N. C. Tse, Optimal assembly for high throughput shotgun sequencing 2013, arXiv preprint arXiv:1301.0068.
4. T. M. Covar and J. A. Thomas, Elements of Information Theory. Oxford, U.K.: Oxford Univ. Press, 2006.
5. C. Dohm, C. Lottaz, T. Borodina, and H. Himmelbauer, "SHARCGS: A fast and highly accurate short-read assembly algorithm for de novo genomic sequencing," Genome Res., vol. 17, pp. 1697-1706, 2007. (Pubitemid 350074864)
6. M. Dyer, A. Frieze, and S. Suen, "The probability of unique solutions of sequencing by hybridization," J. Comput. Biol., vol. 1, no. 2, pp. 105-110, 1994.
7. A. Frieze and W. Szpankowski, "Greedy algorithms for the shortest common superstring that are asymptotically optimal," Algorithmica, vol. 21, no. 1, pp. 21-36, 1998. (Pubitemid 128664051)
8. J. K. Gallant, "String compression algorithms," Ph.D. dissertation, Princeton Univ., Princeton, NJ, USA, 1982.
9. X. Huang and A. Madan, "CAP3: A DNA sequence assembly program," Genome Res., vol. 9, no. 9, pp. 868-877, 1999. (Pubitemid 29488446)
10. M. S.Waterman and R. M. Idury, "A new algorithm for DNA sequence assembly," J. Comput. Biol., vol. 2, pp. 291-306, 1995.
11. W. R. Jeck, J. A. Reinhardt, D. A. Baltrus, M. T. Hickenbotham, V. Magrini, E. R. Mardis, J. L. Dangl, and C. D. Jones, "Extending assembly of short DNA sequences to handle error," Bioinformatics, vol. 23, pp. 2942-2944, 2007. (Pubitemid 350162901)
12. H. Kaplan and N. Shafrir, "The greedy algorithm for shortest superstrings," Inf. Process. Lett., vol. 93, no. 1, pp. 13-17, 2005.
13. E. S. Lander and M. S. Waterman, "Genomic mapping by fingerprinting random clones: A mathematical analysis," Genomics, vol. 2, no. 3, pp. 231-239, 1988.
14. M. Li, "Towards a DNA sequencing theory (learning a string)," Found. Comput. Sci., vol. 1, pp. 125-134, Oct. 1990. (Pubitemid 21663289)
15. B. Ma, "Why greed works for shortest common superstring problem," Theor. Comput. Sci., vol. 410, no. 51, pp. 5374-5381, 2009.
16. P. Medvedev and M. Brudno, "Maximum likelihood genome assembly," J. Comput. Biol., vol. 16, no. 8, pp. 1101-1116, 2009.
17. J.Miller, S. Koren, and G. Sutton, "Assembly algorithms for next-generation sequencing data," Genomics, vol. 95, pp. 315-327, 2010.
18. Human Genome Sequence Quality Standards NIH National Human Genome Research Institute, Dec. 2012 [Online]. Available: http://www.genome.gov/ 10000923
19. K. Paszkiewicz and D. J. Studholme, "De novo assembly of short sequence reads," Brief. Bioinformat., vol. 11, no. 5, pp. 457-472, 2010.
20. P. A. Pevzner, H. Tang, and M. S. Waterman, "An Eulerian path approach to DNA fragment assembly," Proc. Nat. Acad. Sci. USA, vol. 98, pp. 9748-9753, 2001. (Pubitemid 32769375)
21. M. Pop, "Genome assembly reborn: Recent computational challenges," Brief. Bioinformat., vol. 10, no. 4, pp. 354-366, 2009.
22. Z. Rached, F. Alajaji, and L. L. Campbell, "Renyi's divergence and entropy rates for finite alphabet Markov sources," IEEE Trans. Inf. Theory, vol. 47, no. 4, pp. 1553-1561, May 2001. (Pubitemid 32508494)
23. S. Batzoglou et al., "Arachne: A whole-genome shotgun assembler," Genome Res., vol. 12, pp. 177-189, 2002. (Pubitemid 34070592)
24. F. Sanger, S. Nicklen, and A. R. Coulson, "DNA sequencing with chain-terminating inhibitors," Proc. Nat. Acad. Sci. USA, vol. 74, no. 12, pp. 5463-5467, 1977.
25. G. G. Sutton, O. White, M. D. Adams, and A. Kerlavage, "TIGR Assembler: A new tool for assembling large shotgun sequencing projects," Genome Sci. Technol., vol. 1, pp. 9-19, 1995.
26. J. S. Turner, "Approximation algorithms for the shortest common superstring problem," Inf. Comput., vol. 83, no. 1, pp. 1-20, 1989.
27. E. Ukkonen, "Approximate stringmatching with q-grams and maximal matches," Theor. Comput. Sci., vol. 92, no. 1, pp. 191-211, 1992.
28. E. Ukkonen, "A linear-time algorithm for finding approximate shortest common superstrings," Algorithmica, vol. 5, pp. 313-323, 1990. (Pubitemid 20717703)
29. R. L.Warren, G. G. Sutton, S. J. Jones, and R. A. Holt, "Assembling millions of short DNA sequences using SSAKE," Bioinformatics, vol. 23, pp. 500-501, 2007. (Pubitemid 46323134)
30. DNA Sequencing Theory-Wikipedia, The Free Encyclopedia, Wikipedia, 2012.
31. Sequence Assembly-Wikipedia, The Free Encyclopedia, Wikipedia, 2012.
32. A. S.Motahari, K. Ramchandran, D. N. C. Tse, and N.Ma, "Optimal DNA shotgun sequencing: Noisy reads are as good as noiseless reads," arXiv preprint arXiv:1304.2798 (2013).