Sciweavers

90 search results - page 5 / 18
» Perfect Sorting by Reversals
Sort
View
ITNG
2007
IEEE
14 years 2 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
DAM
2007
120views more  DAM 2007»
13 years 7 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
MFCS
2005
Springer
14 years 1 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
RECOMB
2006
Springer
14 years 8 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
ISBRA
2007
Springer
14 years 2 months ago
The Solution Space of Sorting by Reversals
Marília D. V. Braga, Marie-France Sagot, Ce...