DNA Computation of Integer Addition Table with Applications to Boolean Convolution

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

    Sammanfattning

    Four specific complexity measures for DNA-based computations are considered: the number of test tubes, the maximal number of molecules in a tube, the maximal length of a molecule, the number of elementary lab operations. These measures are estimated for three DNA procedures for computing the integer addition table. Then, using the addition table, two algorithms for the Boolean convolution are considered and evaluated from the point of view of their complexity.
    Originalspråkengelska
    Sidor (från-till)319
    Antal sidor329
    TidskriftRomanian Journal of Information Science and Technology
    Volym1
    Nummer4
    StatusPublished - 1998

    Ämnesklassifikation (UKÄ)

    • Data- och informationsvetenskap

    Fria nyckelord

    • DNA
    • computation

    Fingeravtryck

    Utforska forskningsämnen för ”DNA Computation of Integer Addition Table with Applications to Boolean Convolution”. Tillsammans bildar de ett unikt fingeravtryck.

    Citera det här