IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-015-9634-3_37.html
   My bibliography  Save this book chapter

Is Evolutionary Computation Using DNA Strands Feasible?

In: Where Mathematics, Computer Science, Linguistics and Biology Meet

Author

Listed:
  • José Rodrigo

    (Technical University of Madrid, Department of Artificial Intelligence, Faculty of Informatics)

  • Juan Castellanos

    (Technical University of Madrid, Department of Artificial Intelligence, Faculty of Informatics)

  • Fernando Arroyo

    (Technical University of Madrid, Department of Computer Languages, Projects and Systems Technical College of Informatics)

  • Luis Fernando Mingo

    (Technical University of Madrid, Department of Computer Languages, Projects and Systems Technical College of Informatics)

Abstract

Until now, there have not been many attempts at using DNA strands as the technological base for evolutionary computing. This paper tries to prove that such a computing paradigm can be achieved using DNA strands and also that it seems to be the most appropriate computing paradigm when computing with DNA strands. Classical genetic algorithm operations are translated into DNA strands and DNA operations in order to implement them. This new approach will solve the inconvenience of having great amounts of DNA strands if a NP problem must be solved.

Suggested Citation

  • José Rodrigo & Juan Castellanos & Fernando Arroyo & Luis Fernando Mingo, 2001. "Is Evolutionary Computation Using DNA Strands Feasible?," Springer Books, in: Carlos Martín-Vide & Victor Mitrana (ed.), Where Mathematics, Computer Science, Linguistics and Biology Meet, chapter 0, pages 423-434, Springer.
    • Handle: RePEc:spr:sprchp:978-94-015-9634-3_37
    DOI: 10.1007/978-94-015-9634-3_37
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-015-9634-3_37. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.