Partial DNA assembly: A rate-distortion perspective

IEEE International Symposium on Information Theory - Proceedings

Volumn 2016-August, Issue , 2016, Pages 1799-1803

  Shomorony, Ilan ^a   Kamath, Govinda M ^b   Xia, Fei ^c   Courtade, Thomas A ^a   Tse, David N ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GENES; INFORMATION THEORY; SIGNAL DISTORTION;

DISTORTION FUNCTIONS; DISTORTION MEASURES; DNA ASSEMBLIES; EULERIAN CYCLES; GENOME SEQUENCES; NATURAL GENERALIZATION; RATE DISTORTIONS; UNAMBIGUOUS RECONSTRUCTION;

ELECTRIC DISTORTION;

EID: 84985996030     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2016.7541609     Document Type: Conference Paper

References (12)

1. G. Bresler, M. Bresler, and D. Tse, "Optimal Assembly for High Throughput Shotgun Sequencing, " BMC Bioinformatics, 2013.
2. E. Ukkonen, "Approximate String Matching with q-grams and maximal matches, " Theoretical Computer Science, vol. 92, no. 1, 1992.
3. P. A. Pevzner, H. Tang, and M. S. Waterman, "An Eulerian path approach to DNA fragment assembly, " Proceedings of the National Academy of Sciences, vol. 98, no. 17, pp. 9748-9753, 2001.
4. E. W. Myers, "Efficient local alignment discovery amongst noisy long reads, " in Algorithms in Bioinformatics. Springer, 2014, pp. 52-67.
5. -, "The fragment assembly string graph, " Bioinformatics, vol. 21, pp. 79-85, 2005.
6. I. Shomorony, S. Kim, T. Courtade, and D. Tse. Optimal Assembly via Sparse Read-Overlap Graphs. [Online]. Available: http://www. eecs. berkeley. edu/~courtade/pdfs/NSG. pdf
7. H. M. Kiah, G. J. Puleo, and O. Milenkovic, "Codes for DNA sequence profiles, " arXiv:1502. 00517, 2015.
8. N. Nagarajan and M. Pop, "Parametric complexity of sequence assembly: theory and applications to next generation sequencing, " Journal of computational biology, vol. 16, no. 7, pp. 897-908, 2009.
9. P. Medvedev, K. Georgiou, G. Myers, and M. Brudno, "Computability of models for sequence assembly, " in Algorithms in Bioinformatics. Springer, 2007, pp. 289-301.
10. J. Tarhio and E. Ukkonen, "A greedy approximation algorithm for constructing shortest common superstrings, " Theoret. Comput. Science, vol. 57, pp. 131-145, 1988.
11. [Online]. Available: http://gage. cbcb. umd. edu/
12. I. Shomorony, G. M. Kamath, F. Xia, T. Courtade, and D. N. C. Tse, "Partial DNA Assembly: A Rate-Distortion Perspective, " arXiv:1605. 01941, 2016.