Sciweavers

36 search results - page 2 / 8
» Gene Maps Linearization Using Genomic Rearrangement Distance...
Sort
View
RECOMB
2010
Springer
13 years 3 months ago
A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses That Applies across Eukaryotes and Prokaryotes
Background: Genomic rearrangements have been studied since the beginnings of modern genetics and models for such rearrangements have been the subject of many papers over the last ...
Yu Lin, Bernard M. E. Moret
BMCBI
2010
120views more  BMCBI 2010»
13 years 5 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...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 8 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
BIOINFORMATICS
2011
13 years 7 days 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
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
13 years 11 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
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...
Noppadon Khiripet