Sciweavers

34 search results - page 4 / 7
» Computing the Breakpoint Distance between Partially Ordered ...
Sort
View
RECOMB
2008
Springer
15 years 10 months ago
A Phylogenetic Approach to Genetic Map Refinement
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
Denis Bertrand, Mathieu Blanchette, Nadia El-Mabro...
ISMB
1994
14 years 11 months ago
Using Interval Logic for Order Assembly
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...
Zhan Cui
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 1 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
14 years 11 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
BMCBI
2006
192views more  BMCBI 2006»
14 years 9 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...