49 search results - page 8 / 10 » Genome Rearrangements and Sorting by Reversals |
RECOMB
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
JCSS
2008
14 years 10 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
DAM
2007
14 years 10 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...