Topic · DNA and Biological Computing
Most cited papers in DNA and Biological Computing
What are the most cited papers in DNA and Biological Computing?
The most cited paper in DNA and Biological Computing is "A method for obtaining digital signatures and public-key cryptosystems" (Ronald L. Rivest, Adi Shamir, Leonard M. Adleman, 1983), with 13,115 citations. Next come "Reducibility among Combinatorial Problems" (11,108) and "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels" (4,564).
Showing 50 of 100 papers. Every paper with more than 623 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | A method for obtaining digital signatures and public-key cryptosystems Ronald L. Rivest, Adi Shamir, Leonard M. Adleman · Communications of the ACM | 1983 | 13,115 |
| 2 | Reducibility among Combinatorial Problems Richard M. Karp | 1972 | 11,108 |
| 3 | Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels Erdal Arıkan · IEEE Transactions on Information Theory | 16 Jun 2009 | 4,564 |
| 4 | Molecular Computation of Solutions to Combinatorial Problems Leonard M. Adleman · Science | 11 Nov 1994 | 4,482 |
| 5 | Untraceable electronic mail, return addresses, and digital pseudonyms David Chaum · Communications of the ACM | Feb 1981 | 4,322 |
| 6 | Capacity theorems for the relay channel Thomas M. Cover, Abbas El Gamal · IEEE Transactions on Information Theory | Sep 1979 | 4,223 |
| 7 | Automatic verification of finite-state concurrent systems using temporal logic specifications E. M. Clarke, E. Allen Emerson, Aravinda Prasad Sistla · ACM Transactions on Programming Languages and Systems | Apr 1986 | 3,602 |
| 8 | Sequence logos: a new way to display consensus sequences Thomas Dana Schneider, Robert M. Stephens · Nucleic Acids Research | 1990 | 3,515 |
| 9 | The rate-distortion function for source coding with side information at the decoder Aaron D. Wyner, J. Ziv · IEEE Transactions on Information Theory | 1976 | 3,098 |
| 10 | Efficient string matching Alfred V. Aho, Margaret J. Corasick · Communications of the ACM | Jun 1975 | 2,969 |
| 11 | Three Factors in Language Design Noam Chomsky · Linguistic Inquiry | 2005 | 2,659 |
| 12 | The symbol grounding problem Stevan Harnad · Physica D Nonlinear Phenomena | Jun 1990 | 2,630 |
| 13 | A guided tour to approximate string matching Gonzalo Navarro · ACM Computing Surveys | Mar 2001 | 2,595 |
| 14 | Using encryption for authentication in large networks of computers Roger M. Needham, Michael D. Schroeder · Communications of the ACM | Dec 1978 | 2,364 |
| 15 | Computing with Membranes Gheorghe Pǎun · Journal of Computer and System Sciences | Aug 2000 | 2,281 |
| 16 | Communicating and Mobile Systems: the Pi-Calculus Robin Milner | 1999 | 2,268 |
| 17 | The Gaussian wire-tap channel S. Leung-Yan-Cheong, Martin E. Hellman · IEEE Transactions on Information Theory | Jul 1978 | 2,074 |
| 18 | Quad trees a data structure for retrieval on composite keys Raphael A. Finkel, Jon Louis Bentley · Acta Informatica | 1974 | 2,042 |
| 19 | Reduced surface: An efficient way to compute molecular surfaces Michel F. Sanner, Arthur J. Olson, Jean-Claude Spehner · Biopolymers | Mar 1996 | 1,996 |
| 20 | A quantitative assay for DNA-RNA hybrids with DNA immobilized on a membrane David H. Gillespie, Sol Spiegelman · Journal of Molecular Biology | Jul 1965 | 1,973 |
| 21 | Suffix Arrays: A New Method for On-Line String Searches Udi Manber, Gene Myers · SIAM Journal on Computing | Oct 1993 | 1,966 |
| 22 | Concurrency and automata on infinite sequences David S. Park · Lecture notes in computer science | 22 Nov 2005 | 1,883 |
| 23 | Computational thinking and thinking about computing Jeannette M. Wing · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences | 31 Jul 2008 | 1,764 |
| 24 | Co-clustering documents and words using bipartite spectral graph partitioning Inderjit S. Dhillon | 26 Aug 2001 | 1,723 |
| 25 | A Certified Digital Signature Ralph C. Merkle · Lecture notes in computer science | 8 Nov 2007 | 1,708 |
| 26 | Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms Jonathan S. Yedidia, William T. Freeman, Yaakov Weiss · IEEE Transactions on Information Theory | 28 Jun 2005 | 1,673 |
| 27 | Silicon physical random functions Blaise Gassend, Dwaine Clarke, Marten van Dijk et al. | 18 Nov 2002 | 1,663 |
| 28 | On certain formal properties of grammars Noam Chomsky · Information and Control | Jun 1959 | 1,598 |
| 29 | Ensembl BioMarts: a hub for data retrieval across taxonomic space R. J. Kinsella, Andreas Kähäri, Syed Haider et al. · Database | 23 Jul 2011 | 1,585 |
| 30 | Regular and irregular progressive edge-growth tanner graphs Xiaoyu Hu, Evangelos S. Eleftheriou, Donald M. Arnold · IEEE Transactions on Information Theory | 2005 | 1,511 |
| 31 | Conjugate coding Stephen J. Wiesner · ACM SIGACT News | 1983 | 1,508 |
| 32 | Next-Generation Digital Information Storage in DNA George M. Church, Yuan Gao, Sriram Kosuri · Science | 17 Aug 2012 | 1,475 |
| 33 | Scaling Up Digital Circuit Computation with DNA Strand Displacement Cascades Lulu Qian, Erik Winfree · Science | 3 Jun 2011 | 1,467 |
| 34 | Computation of channel capacity and rate-distortion functions Richard E. Blahut · IEEE Transactions on Information Theory | Jul 1972 | 1,454 |
| 35 | Formal Languages and Their Relation to Automata John E. Hopcroft, Jeffrey David Ullman · CERN Document Server (European Organization for Nuclear Research) | 1969 | 1,342 |
| 36 | Parallel Prefix Computation Richard E. Ladner, Michael J. Fischer · Journal of the ACM | Oct 1980 | 1,289 |
| 37 | Incidence matrices and interval graphs D. R. Fulkerson, Oliver Gross · Pacific Journal of Mathematics | Sep 1965 | 1,289 |
| 38 | Raptor Codes Amin Shokrollahi | Jul 2007 | 1,263 |
| 39 | Towards practical, high-capacity, low-maintenance information storage in synthesized DNA Nick Goldman, Paul Bertone, Siyuan Chen et al. · Nature | 22 Jan 2013 | 1,260 |
| 40 | Cooperative Mobile Robotics: Antecedents and Directions Y. Uny Cao, Alex S. Fukunaga, Andrew B. Kahng · Autonomous Robots | Mar 1997 | 1,239 |
| 41 | A Design Principle for Hash Functions Ivan Damgård · Lecture notes in computer science | 8 Nov 2007 | 1,198 |
| 42 | Efficient erasure correcting codes Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory | 2001 | 1,195 |
| 43 | Universal codeword sets and representations of the integers Peter Eliaš · IEEE Transactions on Information Theory | Mar 1975 | 1,185 |
| 44 | Skip lists: a probabilistic alternative to balanced trees William White Tison Pugh · Communications of the ACM | Jun 1990 | 1,175 |
| 45 | An introduction to Γ-convergence Gianni Dal Maso · CERN Document Server (European Organization for Nuclear Research) | 1993 | 1,152 |
| 46 | Opportunistic data structures with applications Paolo Ferragina, Giovanni Manzini | 7 Nov 2002 | 1,100 |
| 47 | Neural network computation with DNA strand displacement cascades Lulu Qian, Erik Winfree, Jehoshua Bruck · Nature | Jul 2011 | 1,100 |
| 48 | Fast Algorithms for Finding Nearest Common Ancestors Dov Harel, Robert Endre Tarjan · SIAM Journal on Computing | May 1984 | 1,081 |
| 49 | Cuckoo hashing Rasmus Pagh, Flemming Friche Rodler · Journal of Algorithms | 28 Feb 2004 | 1,063 |
| 50 | DNA Solution of Hard Computational Problems Richard J. Lipton · Science | 28 Apr 1995 | 1,057 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.