192 search results - page 4 / 39 » Genome rearrangements with duplications |
CIBCB
2005
IEEE
15 years 3 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...
COMBINATORICS
2007
14 years 10 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
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 various...
RECOMB
2010
Springer
14 years 8 months ago
2010
Springer
An important question in genome evolution is whether there exist fragile regions (rearrangement hotspots) where chromosomal rearrangements are happening over and over again. Althou...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
Comparing chromosomal gene order in two or more related species is an important approach to studying the forces that guide genome organization and evolution. Linked clusters of si...