Name
Abstract | ||
|---|---|---|
In recent works for high performance computing, computation with DNA strands, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose three procedures for computing the maximum of n binary numbers of m bits, which are represented with O(mn) DNA strands. The first procedure computes the maximum of the binary numbers in O(m) steps using O(n) kinds of DNA strands. The second and third procedures also compute the maximum in O(log n) and O(1) steps using O(mn) and C(mn(2)) kinds of DNA strands, respectively. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1142/S0129054107004796 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
DNA computing, the maximum | Discrete mathematics,Binary logarithm,Combinatorics,Supercomputer,DNA,Mathematics,Computation,Binary number,DNA computing | Journal |
Volume | Issue | ISSN |
18 | 3 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Fujiwara | 1 | 122 | 27.25 |
| Satoshi Kamio | 2 | 0 | 1.01 |
| Akiko Takehara | 3 | 0 | 0.34 |