The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...