73 search results - page 1 / 15 » Estimating Genome Reversal Distance by Genetic Algorithm |
CORR
2004
Springer
13 years 11 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
DAM
2008
13 years 11 months ago
2008
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
CIBCB
2005
IEEE
14 years 4 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
STOC
1995
ACM
14 years 2 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
JDA
2007
13 years 11 months ago
2007
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...