90 search results - page 8 / 18 » Perfect Sorting by Reversals |
92
Voted
CIBCB
2005
IEEE
15 years 5 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
107
click to vote
TCBB
2010
14 years 6 months ago
2010
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
102
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
96
Voted
STOC
1997
ACM
15 years 3 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
80
Voted
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...