Sciweavers

192 search results - page 7 / 39
» Genome rearrangements with duplications
Sort
View
AIPS
2010
14 years 9 months ago
Genome Rearrangement and Planning: Revisited
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
Tansel Uras, Esra Erdem
JDA
2007
156views more  JDA 2007»
14 years 9 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
ISMB
2007
15 years 7 days ago
Polyploids, genome halving and phylogeny
Autopolyploidization and allopolyploidization events multiply the number of chromosomes and genomic content. Genome rearrangement phylogenetics requires that all genomes analyzed ...
David Sankoff, Chunfang Zheng, Qian Zhu
JCB
2008
111views more  JCB 2008»
14 years 9 months ago
Sorting Genomes with Centromeres by Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
Michal Ozery-Flato, Ron Shamir
BMCBI
2006
100views more  BMCBI 2006»
14 years 10 months ago
DNPTrapper: an assembly editing tool for finishing and analysis of complex repeat regions
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
Erik Arner, Martti T. Tammi, Anh-Nhi Tran, Ellen K...