ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Computational complexity of planning with temporal goals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Beyond classical planning: procedural control knowledge and preferences in state-of-the-art planners
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
Relative-Order Abstractions for the Pancake Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The actor's view of automated planning and acting: A position paper
Artificial Intelligence
| Hi-index | 0.00 |
The genome rearrangement problem is to find the most economical explanation for observed differences between the gene orders of two genomes. Such an explanation is provided in terms of events that change the order of genes in a genome. We present a new approach to the genome rearrangement problem, according to which this problem is viewed as the problem of planning rearrangement events that transform one genome to the other. This method differs from the existing ones in that we can put restrictions on the number of events, specify the cost of events with functions, possibly based on the length of the gene fragment involved, and add constraints controlling search. With this approach. We have described genome rearrangements in the action description language ADL. and studied the evolution of Metazoan mitochondrial genomes and the evolution of Campanulaceae chloroplast genomes using the planner TLPLAN. We have observed that the phylogenies reconstructed using this approach conform with the most widely accepted ones.