Faced with the deluge of data available in biological databases, it becomes increasingly
difficult for scientists to obtain reasonable sets of answers to their biological queries. A …

Due to its numerous applications, rank aggregation has become a problem of major interest
across many fields of the computer science literature. In the vast majority of situations …

Given a set A⊆ S n of m permutations of {1, 2,…, n} and a distance function d, the median
problem consists of finding a permutation π∗ that is the “closest” of the m given …

In this paper we analyse a flexible real world-based model for designing school bus transit
systems and note a number of parallels between this and other well-known combinatorial …

Kemeny's rule is one of the most studied and well-known voting schemes with various
important applications in computational social choice and biology. Recently, Kemeny's rule …

Given a set A⊆ S n of m permutations of {1, 2,…, n} and a distance function d, the median
problem consists of finding a permutation π⁎ that is the “closest” of the m given …

The important Kemeny problem, which consists of computing median consensus rankings of
an election with respect to the Kemeny voting rule, admits important applications in biology …

Given a set A ⊆\mathcal S _n of m permutations of n and a distance function d, the median
problem consists of finding a permutation π^* that is the “closest” of the m given …

Predicting the three-dimensional (3D) structures of macromolecular protein-protein
complexes from the structures of individual partners (docking), is a major challenge for …

Given a set A ⊆ S _n of m permutations of {1, 2, ..., n\} and a distance function d, the median
problem consists of finding a permutation π^* that is the “closest” of the m given …