5 search results - page 1 / 1 » Slightly Beyond Turing's Computability for Studying Genetic ... |
MCU
2007
13 years 6 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
PPSN
1994
Springer
13 years 9 months ago
1994
Springer
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
BMCBI
2007
13 years 5 months ago
2007
Background: Metagenomic analyses of microbial communities that are comprehensive enough to provide multiple samples of most loci in the genomes of the dominant organism types will...
AC
1998
Springer
13 years 4 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
RECOMB
2002
Springer
14 years 5 months ago
2002
Springer
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...