Sciweavers

192 search results - page 3 / 39
» Genome rearrangements with duplications
Sort
View
JCB
2007
146views more  JCB 2007»
14 years 9 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 8 months ago
The zero exemplar distance problem
Given two genomes with duplicate genes, Zero Exemplar Distance is the problem of deciding whether the two genomes can be reduced to the same genome without duplicate genes by delet...
Minghui Jiang
CSB
2003
IEEE
106views Bioinformatics» more  CSB 2003»
15 years 3 months ago
Reconstruction of Ancestral Gene Order after Segmental Duplication and Gene Loss
As gene order evolves through a variety of chromosomal rearrangements, conserved segments provide important insight into evolutionary relationships and functional roles of genes. ...
Jun Huan, Jan Prins, Wei Wang 0010, Todd J. Vision
RECOMB
2005
Springer
15 years 10 months ago
A Framework for Orthology Assignment from Gene Rearrangement Data
Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same g...
Krister M. Swenson, Nicholas D. Pattengale, Bernar...
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
14 years 8 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...