44 search results - page 5 / 9 » Algorithms for Multiple Genome Rearrangement by Signed Rever... |
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...
CSB
2005
IEEE
14 years 1 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...
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 ...
BMCBI
2006
13 years 7 months ago
2006
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
RECOMB
2009
Springer
14 years 2 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...