Horizontal gene transfer for recombining graphs
We introduce a form of neutral horizontal gene transfer (HGT) to evolving graphs by graph programming (EGGP). We introduce the μ × λ evolutionary algorithm (EA), where μ parents each produce λ children who compete only with their parents. HGT events then copy the entire active component of one survi...
Saved in:
| Published in: | Genetic programming and evolvable machines Vol. 21; no. 3; pp. 321 - 347 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.09.2020
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1389-2576, 1573-7632 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!