DNA Memory with 16.8M Addresses
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Nested addressing barcodes have been used to uniquely identify a greater number of files, and biochemical affinity tags have been used to selectively pull down oligos for targeted amplification.
“Nested addressing barcodes14–16 have also been used to uniquely identify a greater number of files, as well as biochemical affinity tags to selectively pull down oligos for targeted amplification17.”
From Random access DNA memory using Boolean search in an archival file storage system (2021) · cites this paper as [16]
Cites
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474 · see citing works
Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information
Zuker, M., & Stiegler, P. (1981) · Nucleic Acids Research · doi:10.1093/nar/9.1.133 · Cited by 3,604 · see citing works
Knowledge-Based Intelligent Information and Engineering Systems
高下, 大., タカシタ, タ., Takashita, T., Jain, L. C., イトカワ, ツ., Itokawa, T., 北須賀, 輝., キタスカ, テ., Kitasuka, T., 有次, 正., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85565-1 · Cited by 1,699 · see citing works
DNA Solution of Hard Computational Problems
Lipton, R. J. (1995) · Science · doi:10.1126/science.7725098 · Cited by 1,058 · see citing works
Improved Nearest-Neighbor Parameters for Predicting DNA Duplex Stability
SantaLucia, J., Allawi, H. T., & Seneviratne, P. A. (1996) · Biochemistry · doi:10.1021/bi951907q · Cited by 847 · see citing works
Programmable and autonomous computing machine made of biomolecules
Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., & Shapiro, E. Y. (2001) · Nature · doi:10.1038/35106533 · Cited by 645 · see citing works
Hiding messages in DNA microdots
Clelland, C. T., Risca, V. I., & Bancroft, C. (1999) · Nature · doi:10.1038/21092 · Cited by 638 · see citing works
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Braich, R. S., Chelyapov, N. V., Johnson, C., Rothemund, P. W. K., & Adleman, L. M. (2002) · Science · doi:10.1126/science.1069528 · Cited by 567 · see citing works
IEICE transactions on fundamentals of electronics, communications and computer sciences
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 560 · see citing works
Improved Thermodynamic Parameters and Helix Initiation Factor to Predict Stability of DNA Duplexes
Sugimoto, N., Nakano, S., Yoneyama, M., & Honda, K.-I. (1996) · Nucleic Acids Research · doi:10.1093/nar/24.22.4501 · Cited by 468 · see citing works
McPherson, M. J., Quirke, P., & Taylor, G. R. (1991) · Oxford University Press eBooks · Cited by 341 · see citing works
Building an Associative Memory Vastly Larger Than the Brain
Baum, E. B. (1995) · Science · doi:10.1126/science.7725109 · Cited by 169 · see citing works
Organic data memory using the DNA approach
Wong, P. C., Wong, K., & Foote, H. P. (2003) · Communications of the ACM · doi:10.1145/602421.602426 · Cited by 165 · see citing works
Good encodings for DNA-based solutions to combinatorial problems
Deaton, R. J., Murphy, R., Garzón, M., et al. (1998) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/044/20 · Cited by 156 · see citing works
Fast evaluation of internal loops in RNA secondary structure prediction.
Lyngs√∏, R. B., Zuker, M., & Pedersen, C. N. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.6.440 · Cited by 147 · see citing works
Stochastic Local Search Algorithms for DNA Word Design
Tulpan, D., Hoos, H. H., & Condon, A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36440-4_20 · Cited by 90 · see citing works
Design of nucleic acid sequences for DNA computing based on a thermodynamic approach
Tanaka, F. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki235 · Cited by 70 · see citing works
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
Reif, J. H., LaBean, T. H., Pirrung, M. C., Rana, V. S., Guo, B., Kingsford, C., & Wickham, G. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48017-x_22 · Cited by 66 · see citing works
Development of Biometric DNA Ink for Authentication Security
Hashiyada, M. (2004) · The Tohoku Journal of Experimental Medicine · doi:10.1620/tjem.204.109 · Cited by 57 · see citing works
Polymorphism of 17 STRs by multiplex analysis in Japanese population
Hashiyada, M., Itakura, Y., Nagashima, T., et al. (2003) · Forensic Science International · doi:10.1016/s0379-0738(03)00075-6 · Cited by 51 · see citing works
Landweber, L., & Baum, E. (1998) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/044 · Cited by 45 · see citing works
A DNA-based memory with in vitro learning and associative recall
Chen, J., Deaton, R. J., & Wang, Y. (2005) · Natural Computing · doi:10.1007/s11047-004-4002-3 · Cited by 37 · see citing works
(1995) · doi:10.1093/oso/9780199634255.001.0001 · Cited by 29 · see citing works
Hierarchical DNA Memory Based on Nested PCR
Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., & Ohuchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36440-4_10 · Cited by 21 · see citing works
Self-citationKashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., & Ohuchi, A. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.10.007 · Cited by 12 · see citing works
Self-citationTwo-Step Search for DNA Sequence Design
Kashiwamura, S., Kameda, A., Yamamoto, M., et al. (2003) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 8 · see citing works
Self-citationImproving the Quality of Semantic Retrieval in DNA-Based Memories with Learning
Neel, A. J., Garzón, M., & Penumatsa, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30132-5_7 · Cited by 6 · see citing works
Combining Randomness and a High-Capacity DNA Memory
Kameda, A., Kashiwamura, S., Yamamoto, M., Ohuchi, A., & Hagiya, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-77962-9_11 · Cited by 5 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Random access DNA memory using Boolean search in an archival file storage system
Banal, J. L., Shepherd, T. R., Berleant, J., Huang, H., Reyes, M., Ackerman, C. M., Blainey, P. C., & Bathe, M. (2021) · Nature Materials · doi:10.1038/s41563-021-01021-3 · Cited by 143 · see citing works
- Authors
- Yamamoto, M., Kashiwamura, S., & Ohuchi, A.
- Affiliations
- Hokkaido University (JP)
- Hitachi (Japan) (JP)
- ORCID
- Yamamoto, Masahito
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 99-108
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1586994570
- Cited by
- 4
- References
- 28
- Citations by year
- 2021: 1 · 2015: 1
- FWCI
- 2.09
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Keywords
- DNA data storage, nested PCR, combinatorial optimization, theoretical bounds, steganography, DNA cryptography
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review