Codes for DNA sequence profiles

IEEE International Symposium on Information Theory - Proceedings

Volumn 2015-June, Issue , 2015, Pages 814-818

  Kiah, Han Mao ^a   Puleo, Gregory J ^b   Milenkovic, Olgica ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL STABILITY; DNA; GENE ENCODING; INFORMATION THEORY;

CODING PARADIGMS; DE BRUIJN GRAPHS; GC CONTENTS; POLYTOPES; SUB-STRINGS; SYNTHETIC DNA;

DNA SEQUENCES;

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

References (22)

1. S. Kannan and A. McGregor, "More on reconstructing strings from random traces: insertions and deletions, " in Proc. IEEE Intl. Inform. Theory. IEEE, 2005, pp. 297-301.
2. J. Acharya, H. Das, O. Milenkovic, A. Orlitsky, and S. Pan, "On reconstructing a string from its substring compositions, " in Proc. IEEE Intl. Symp. Inform. Theory. IEEE, 2010, pp. 1238-1242.
3. -, "Quadratic-backtracking algorithm for string reconstruction from substring compositions, " in Proc. IEEE Intl. Symp. Inform. Theory. IEEE, 2014, pp. 1296-1300.
4. G. M. Church, Y. Gao, and S. Kosuri, "Next-generation digital information storage in DNA, " Science, vol. 337, no. 6102, pp. 1628-1628, 2012.
5. N. Goldman, P. Bertone, S. Chen, C. Dessimoz, E. M. LeProust, B. Sipos, and E. Birney, "Towards practical, high-capacity, low-maintenance information storage in synthesized DNA, " Nature, 2013.
6. J. Ma, O. Milenkovic, and H. Zhao, "Strategic Research Initiative (SRI) grant, Rewritable DNA storage, " Patent, pending.
7. P. Medvedev, K. Georgiou, G. Myers, and M. Brudno, "Computability of models for sequence assembly, " in Algorithms in Bioinformatics. Springer, 2007, pp. 289-301.
8. P. E. Compeau, P. A. Pevzner, and G. Tesler, "How to apply de Bruijn graphs to genome assembly, " Nature biotechnology, vol. 29, no. 11, pp. 987-991, 2011.
9. gBlocks Gene Fragments. [Online]. Available: http://www. idtdna. com/ pages/products/genes/gblocks-gene-fragments
10. H. M. Kiah, G. J. Puleo, and O. Milenkovic, "Coding for DNA storage channels, " in IEEE Inform. Theory Workshop, 2015, to appear.
11. P. Jacquet, C. Knessl, and W. Szpankowski, "Counting Markov types, balanced matrices, and Eulerian graphs, " IEEE Trans. Inform. Theory, vol. 58, no. 7, pp. 4261-4272, 2012.
12. H. M. Kiah, G. J. Puleo, and O. Milenkovic, "Codes for DNA sequence profiles, " arXiv preprint arXiv:1502. 00517, 2015.
13. K. Nakamura, T. Oshima, T. Morimoto, S. Ikeda, H. Yoshikawa, Y. Shiwa, S. Ishikawa, M. C. Linak, A. Hirai, H. Takahashi, M. Altaf-Ul-Amin, N. Ogasawara, and S. Kanaya, "Sequence-specific error profile of Illumina sequencers, " Nucleic acids research, p. gkr344, 2011.
14. E. Ukkonen, "Approximate string-matching with q-grams and maximal matches, " Theoretical computer science, vol. 92, no. 1, pp. 191-211, 1992.
15. B. Bollobás, Modern graph theory. Springer, 1998, vol. 184.
16. N. G. de Bruijn, "A combinatorial problem, " Koninklijke Nederlandse Akademie v. Wetenschappen, vol. 49, no. 49, pp. 758-764, 1946.
17. F. Ruskey, J. Sawada, and A. Williams, "De Bruijn sequences for fixedweight binary strings, " SIAM Journal on Discrete Mathematics, vol. 26, no. 2, pp. 605-617, 2012.
18. E. Ehrhart, "Sur les polyédres rationnels homothétiques á n dimensions, " CR Acad. Sci. Paris, vol. 254, pp. 616-618, 1962.
19. M. Beck and S. Robins, Computing the continuous discretely: Integer-point enumeration in polyhedra. Springer, 2007.
20. I. G. Macdonald, "Polynomials associated with finite cell-complexes, " J. London Math. Society, vol. 2, no. 1, pp. 181-192, 1971.
21. V. Baldoni, N. Berline, J. A. De Loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto, M. Vergne, and J. Wu, "A user's guide for latte integrale v1. 7. 1, " Optimization, vol. 22, p. 2, 2014.
22. A. I. Barvinok, "A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, " Mathematics of Operations Research, vol. 19, no. 4, pp. 769-779, 1994.