Regresar

Solving knapsack problems in a sticker based model

Abstract:

Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.

Año de publicación:

2002

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Algoritmo
    • Algoritmo

    Áreas temáticas:

    • Programación informática, programas, datos, seguridad
    • Economía
    • Matemáticas

    Contribuidores:

    Fernando Sancho-CaparriniFernando Sancho-Caparrini
    Pérez-Jiménez M.J.Pérez-Jiménez M.J.