49 search results - page 2 / 10 » Genome Rearrangements and Sorting by Reversals |
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
JDA
2008
13 years 7 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
WABI
2005
Springer
14 years 28 days ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
TCBB
2010
13 years 2 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...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...