36 search results - page 4 / 8 » Gene Maps Linearization Using Genomic Rearrangement Distance... |
78
Voted
COMBINATORICS
2007
14 years 9 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
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...
JDA
2008
14 years 9 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
CIBCB
2007
IEEE
15 years 4 months ago
2007
IEEE
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...