Sciweavers

192 search results - page 11 / 39
» Genome rearrangements with duplications
Sort
View
RECOMB
2005
Springer
15 years 10 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert
ITNG
2007
IEEE
15 years 4 months ago
Sorting by Block-Interchanges and Signed Reversals
A block-interchange is a rearrangement event that exchanges two, not necessarily consecutive, contiguous regions in a genome, maintaining the original orientation. Signed reversal...
Cleber V. G. Mira, Joao Meidanis
SIAMDM
2010
105views more  SIAMDM 2010»
14 years 4 months ago
A Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
Linyuan Lu, Yiting Yang
RECOMB
2004
Springer
15 years 10 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 4 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...