41 search results - page 1 / 9 » Fixed-Parameter Algorithms for Computing Kemeny Scores - The... |
AAIM
2008
Springer
14 years 1 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
WG
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
CPM
2008
Springer
13 years 9 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
AAAI
2010
13 years 8 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
IJFCS
2006
13 years 7 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...