Sciweavers

34 search results - page 3 / 7
» Computing the Breakpoint Distance between Partially Ordered ...
Sort
View
RECOMB
2009
Springer
15 years 4 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
CSB
2003
IEEE
106views Bioinformatics» more  CSB 2003»
15 years 2 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
ISMB
1993
14 years 11 months ago
Integrating Order and Distance Relationships from Heterogeneous Maps
There is no automatic mechanism to integrate information between heterogeneous genome maps. Currently, integration is a di cult, manual process. We have developed a process for kn...
Mark Graves
RECOMB
2007
Springer
15 years 10 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev
BMCBI
2010
95views more  BMCBI 2010»
14 years 9 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...