Hierarchical DNA Memory Based on Nested PCR
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 [14]
Cites
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
Computing with DNA by operating on plasmids
Head, T., Rozenberg, G., Bladergroen, R. S., Breek, C. K. D., Lommerse, P. H. M., & Spaink, H. P. (2000) · Biosystems · doi:10.1016/s0303-2647(00)00091-5 · Cited by 153 · see citing works
Developing Support System for Sequence Design in DNA Computing
Tanaka, F., Nakatsugawa, M., Yamamoto, M., Shiba, T., & Ohuchi, A. (2007) · Springer eBooks · doi:10.1007/3-540-48017-x_12 · Cited by 71 · see citing works
Self-citationExperimental 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
Improving sequence design for DNA computing
Arita, M., Nishikawa, A., Hagiya, M., Komiya, K., Gouzu, H., & Sakamoto, K. (2000) · Cited by 65 · see citing works
Aqueous computing: writing on molecules
Head, T., Yamamura, M., & Gal, S. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.782533 · Cited by 53 · see citing works
(1995) · doi:10.1093/oso/9780199634255.001.0001 · Cited by 29 · see citing works
Reif, J. H., & LaBean, T. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44992-2_11 · Cited by 25 · see citing works
Flagged first, then by citations
1 of the 10 references couldn’t be matched to a known paper.
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
Driving the Scalability of DNA-Based Information Storage Systems
Tomek, K. J., Volkel, K., Simpson, A., Hass, A. G., Indermaur, E. W., Tuck, J. M., & Keung, A. J. (2019) · ACS Synthetic Biology · doi:10.1021/acssynbio.9b00100 · Cited by 100 · see citing works
Large-scale DNA memory based on the nested PCR
Yamamoto, M., Kashiwamura, S., Ohuchi, A., & Furukawa, M. (2008) · Natural Computing · doi:10.1007/s11047-008-9076-x · Cited by 33 · see citing works
Self-citationCombinatorial PCR Method for Efficient, Selective Oligo Retrieval from Complex Oligo Pools
Winston, C., Organick, L., Ward, D., Ceze, L., Strauss, K., & Chen, Y.-J. (2022) · ACS Synthetic Biology · doi:10.1021/acssynbio.1c00482 · Cited by 29 · see citing works
Multidimensional data organization and random access in large-scale DNA storage systems
Song, X., Shah, S., & Reif, J. H. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.09.021 · Cited by 17 · see citing works
Hairpin-based state machine and conformational addressing: Design and experiment
Kameda, A., Yamamoto, M., Uejima, H., Hagiya, M., Sakamoto, K., & Ohuchi, A. (2005) · Natural Computing · doi:10.1007/s11047-004-4007-y · Cited by 17 · 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-citationAqueous Computing with DNA Hairpin-Based RAM
Takahashi, N., Kameda, A., Yamamoto, M., & Ohuchi, A. (2005) · Lecture notes in computer science · doi:10.1007/11493785_31 · Cited by 11 · see citing works
Self-citationOn Designing DNA Databases for the Storage and Retrieval of Digital Signals
Tsaftaris, S. A., & Katsaggelos, A. K. (2005) · Lecture notes in computer science · doi:10.1007/11539117_160 · Cited by 6 · see citing works
Development of DNA Relational Database and Data Manipulation Experiments
Yamamoto, M., Kita, Y., Kashiwamura, S., Kameda, A., & Ohuchi, A. (2006) · Lecture notes in computer science · doi:10.1007/11925903_33 · Cited by 5 · see citing works
Self-citationCombining 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-citationDNA Memory with 16.8M Addresses
Yamamoto, M., Kashiwamura, S., & Ohuchi, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77962-9_10 · Cited by 4 · see citing works
Self-citationRetrieval Efficiency of DNA-Based Databases of Digital Signals
Tsaftaris, S. A., & Katsaggelos, A. K. (2009) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2009.2026371 · Cited by 3 · see citing works
Reif, J. H., Hauser, M. A., Pirrung, M. C., & LaBean, T. H. (2007) · Springer eBooks · doi:10.1007/978-0-387-33532-2_31 · Cited by 2 · see citing works
Enzyme optimization for next level molecular computing
Wąsiewicz, P., Malinowski, M., & Płucienniczak, A. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.714673 · Cited by 1 · see citing works
Rebimbas, R., Glória, I., Chegão, J., Al-Rawi, M., Mousakhani Ganjeh, A., & Saraiva, J. A. (2026) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2026.03.003
Another expert system rule inference based on DNA molecule logic gates
Wąsiewicz, P. (2013) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2032392
Berleant, J., Banal, J. L., Rao, D. K., & Bathe, M. (2024) · medRxiv · doi:10.1101/2024.04.12.24305660
A virtual multi-level directory file addressing method (VMDFAM) for DNA storage
Zan, X., Yao, X., Chu, L., Xu, P., & Liu, W. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.108051
- Authors
- Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., & Ohuchi, A.
- Affiliations
- Hokkaido University (JP)
- Japan Science and Technology Agency (JP)
- ORCID
- Yamamoto, Masahito
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 112-123
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1487920211
- Cited by
- 21
- References
- 10
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 2 · 2019: 1 · 2013: 1
- FWCI
- 5.62
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
- Keywords
- hierarchical memory, nested PCR, DNA computing, data storage, DNA strands, memory access
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
