49 search results - page 6 / 10 » Genome Rearrangements and Sorting by Reversals |
PSB
2003
13 years 8 months ago
2003
BIOINFORMATICS
2011
13 years 2 months ago
2011
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
SIAMDM
2010
13 years 2 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
JCSS
2002
13 years 7 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...