Although a number of normalized edit distances presented so far may offer good
performance in some applications, none of them can be regarded as a genuine metric …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This paper lists in alphabetical order by the name of the first author, 745 papers dealing with
fractional programming and its applications. This covers mainly the period 2005-2012 but it …

As a promising and innovative research field, bioinformatics has attracted increasing
attention recently. Beneath the enormous number of open problems in this field, one …

Given a fixed alignment scoring scheme, the bounded length (respectively, bounded total
length) Smith-Waterman alignment problem on a pair of strings of lengths m, n, asks for the …

In this paper, we introduce some improved methods based on the swarming algorithms in
solving some key problems in bioinformatics. We achieve the improved algorithm and use to …

In the current chapter, we consider two problems from computational biology, namely, primer
selection and planted motif search (PMS). The closest string problems (CSPs) and the …

Mammalian sex chromosomes evolved from a homologous pair of autosomes via the
acquisition of a major sex determining gene. This event led to the suppression of …

We study a problem of finding optimal paths of all lengths on a directed edge-weighted grid
graph. Variations of this problem appear in different contexts using similar frame-works. We …

In this paper we use an improved Particle Swarm Optimization algorithm to solve Multiple
Sequence Alignment (MSA). MSA is a key problem in bioinformatics. The thesis starts with …