Sciweavers

6 search results - page 1 / 2
» Genomic Distance with DCJ and Indels
Sort
View
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
13 years 9 months ago
Genomic Distance with DCJ and Indels
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
Marília D. V. Braga, Eyla Willing, Jens Sto...
BIOINFORMATICS
2011
13 years 5 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
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 ...
Haitao Jiang, Binhai Zhu, Daming Zhu
CIBCB
2007
IEEE
14 years 5 months ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret
RECOMB
2010
Springer
13 years 9 months ago
On Sorting Genomes with DCJ and Indels
Marília D. V. Braga
BMCBI
2010
120views more  BMCBI 2010»
13 years 11 months ago
Estimating true evolutionary distances under rearrangements, duplications, and losses
Background: The rapidly increasing availability of whole-genome sequences has enabled the study of whole-genome evolution. Evolutionary mechanisms based on genome rearrangements h...
Yu Lin, Vaibhav Rajan, Krister M. Swenson, Bernard...