Name
Title | ||
|---|---|---|
Arithmetic Computation Using Self-Assembly Of Dna Tiles: Modular-Square Over Finite Field Gf(2(N)) |
Abstract | ||
|---|---|---|
Tile assembly model is a highly distributed parallel model of DNA computing. This paper proposes how the tile assembly process could be used for computing the modularsquare, an operation combining square and reduction, over finite field GF(2(n)). In this molecular computing system, reduction is executed after the completion of square. The time complexity of this molecular computing system is Theta(n) and the space complexity is Theta(n(2)). This system requires 75 types of computation tiles and 9 types of boundary tiles. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/HPCC.and.EUC.2013.76 | 2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC) |
Keywords | Field | DocType |
Modular-square, Tile assembly model, Finite field GF(2(n)), DNA computing | Finite field,Computer science,Parallel computing,Self-assembly,Modular design,Time complexity,Tile,Computing systems,Computation,DNA computing | Conference |
Citations | PageRank | References |
5 | 0.53 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongnan Li | 1 | 26 | 8.35 |
| Limin Xiao | 2 | 107 | 28.51 |
| Li Ruan | 3 | 123 | 25.10 |
| Aihua Liang | 4 | 12 | 3.03 |