The genome edit distances problem is to find a minimal-cost sequence of operations that transforms one genome (signed permutation of genes) into another. The purpose of this is to use this cost as a measure of the distance between the two genomes, which is used to construct hypotheses about the evolutionary relationship between the organisms.
There is a description paper with additional details on this domain.
Patrik Haslum
| file | original name |
|---|---|
| domain.pddl | domain.pddl |
| instance-1.pddl | d-1-2.pddl |
| instance-2.pddl | d-1-3.pddl |
| instance-3.pddl | d-1-4.pddl |
| instance-4.pddl | d-1-8.pddl |
| instance-5.pddl | d-2-1.pddl |
| instance-6.pddl | d-2-3.pddl |
| instance-7.pddl | d-2-4.pddl |
| instance-8.pddl | d-2-8.pddl |
| instance-9.pddl | d-3-1.pddl |
| instance-10.pddl | d-3-2.pddl |
| instance-11.pddl | d-3-4.pddl |
| instance-12.pddl | d-4-2.pddl |
| instance-13.pddl | d-4-3.pddl |
| instance-14.pddl | d-4-8.pddl |
| instance-15.pddl | d-7-5.pddl |
| instance-16.pddl | d-7-6.pddl |
| instance-17.pddl | d-8-1.pddl |
| instance-18.pddl | d-8-2.pddl |
| instance-19.pddl | d-8-4.pddl |
| instance-20.pddl | d-8-9.pddl |