Over the last 10 or more years, there has been a tremendous increase in the use of
computational techniques (many of which come directly from biology) for estimating …

We give a survey up to 1989 on the Steiner tree problems which include the four important
cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We …

We study the computational complexity of two popular problems in multiple sequence
alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the …

Phylogenetic bootstrap** (BS) is a standard technique for inferring confidence values on
phylogenetic trees that is based on reconstructing many trees from minor variations of the …

We consider a continuous space which models the set of all phylogenetic trees having a
fixed set of leaves. This space has a natural metric of nonpositive curvature, giving a way of …

Trees are a canonical structure for representing evolutionary histories. Many popular criteria
used to infer optimal trees are computationally hard, and the number of possible tree shapes …

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

We present Searn, an algorithm for integrating sear ch and l earn ing to solve complex
structured prediction problems such as those that occur in natural language, speech …

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

Ever since the structure of DNA was unraveled in 1953, molecular biology has witnessed
tremendous advances. With the increase in our ability to manipulate biomolecular …