41 search results - page 2 / 9 » Fixed-Parameter Algorithms for Computing Kemeny Scores - The... |
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
WEBDB
2005
Springer
14 years 26 days ago
2005
Springer
This document presents the JXP algorithm for dynamically and collaboratively computing PageRank-style authority scores of Web pages distributed in a P2P network. In the architectu...
SP
2008
IEEE
14 years 1 months ago
2008
IEEE
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
ALENEX
2009
13 years 5 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...