다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Scientific reports, v.5, 2015년, pp.14138 -
Tabatabaei Yazdi, S. M. Hossein (University of Illinois, Department of Electrical and Computer Engineering, Urbana, 61801, US) , Yuan, Yongbo (University of Illinois, Department of Chemical and Biomolecular Engineering, Urbana, 61801, US) , Ma, Jian (University of Illinois, Department of Bioengineering, Urbana, 61801, US) , Zhao, Huimin (University of Illinois, Institute for Genomic Biology, Urbana, 61801, US) , Milenkovic, Olgica (University of Illinois, Department of Chemical and Biomolecular Engineering, Urbana, 61801, US)
AI-Helper
We describe the first DNA-based storage architecture that enables random access to data blocks and rewriting of information stored at arbitrary locations within the blocks. The newly developed architecture overcomes drawbacks of existing read-only methods that require decoding the whole file in orde...
Bancroft C. , Bowler T. , Bloom B. & Clelland C. T. Long-term storage of information in dna . Science (New York, NY) 293 , 1763 – 1765 ( 2001 ). 11556362
Davis J. Microvenus . Art Journal 55 , 70 – 74 ( 1996 ).
Church G. M. , Gao Y. & Kosuri S. Next-generation digital information storage in dna . Science 337 , 1628 – 1628 ( 2012 ). 22903519
Goldman N. et al. Towards practical, high-capacity, low-maintenance information storage in synthesized dna . Nature ( 2013 ).
Grass R. N. , Heckel R. , Puddu M. , Paunescu D. & Stark W. J. Robust chemical preservation of digital information on dna in silica with error-correcting codes . Angewandte Chemie International Edition 54 , 2552 – 2555 ( 2015 ).
Ross M. G. et al. Characterizing and measuring bias in sequence data . Genome Biol 14 , R51 ( 2013 ). 23718773
Cohen G. D. & Litsyn S. Dc-constrained error-correcting codes with small running digital sum . Information Theory, IEEE Transactions on 37 , 949 – 955 ( 1991 ).
Blaum M. , Litsyn S. , Buskens V. & van Tilborg H. C. Error-correcting codes with bounded running digital sum . IEEE transactions on information theory 39 , 216 – 227 ( 1993 ).
Gilbert E. Synchronization of binary messages . Information Theory, IRE Transactions on 6 , 470 – 477 ( 1960 ).
Packer H. CRISPR and Cas9 for flexible genome editing . Technical report . ( 2014 ) Available at: www.idtdna.com/pages/products/genes/gblocks-gene-fragments/decoded-articles/decoded/2013/12/13/crispr-and-cas9-for-flexible-genome-editing . (Accessed: 1th January 2015).
Bryksin A. V. & Matsumura I. Overlap extension PCR cloning: a simple and reliable way to create recombinant plasmids . Biotechniques 48 , 463 ( 2010 ). 20569222
Schuster S. C. Next-generation sequencing transforms today’s biology . Nature methods 5 , 16 – 18 ( 2008 ). 18165802
Immink K. A. S. Codes for mass data storage systems (Shannon Foundation Publisher, 2004 ).
Morita H. , van Wijngaarden A. J. & Han Vinck A. On the construction of maximal prefix-synchronized codes . Information Theory, IEEE Transactions on 42 , 2158 – 2166 ( 1996 ).
Milenkovic O. & Kashyap N. On the design of codes for dna computing . In Coding and Cryptography , 100 – 119 (Springer, 2006 ).
Rouillard J.-M. , Zuker M. & Gulari E. Oligoarray 2.0: design of oligonucleotide probes for dna microarrays using a thermodynamic approach . Nucleic acids research 31 , 3057 – 3062 ( 2003 ). 12799432
Guibas L. J. & Odlyzko A. M. Maximal prefix-synchronized codes . SIAM Journal on Applied Mathematics 35 , 401 – 418 ( 1978 ).
Massey J. L. Optimum frame synchronization . Communications, IEEE Transactions on 20 , 115 – 119 ( 1972 ).
Bajic D. On construction of cross-bifix-free kernel sets . Cryptography and Communications archive 6 , 27 – 37 ( 2014 ).
Chee Y. M. , Kiah H. M. , Purkayastha P. & Wang C. Cross-bifix-free codes within a constant factor of optimality . Information Theory, IEEE Transactions on 59 , 4668 – 4674 ( 2013 ).
Blackburn S. R. Non-overlapping codes. arXiv preprint arXiv:1303.1026 ( 2013 ).
Berman P. & Fürer M. Approximating maximum independent set in bounded degree graphs . In SODA , vol. 94 , 365 – 371 ( 1994 ).
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.