Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences - Computational biology 2002
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
On the Nadeau-Taylor Theory of Conserved Chromosome Segments
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
The Median Problem for Breakpoints in Comparative Genomics
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Designing multiple simultaneous seeds for DNA similarity search
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
A small trip in the untranquil world of genomes
Theoretical Computer Science
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Rearrangement Models and Single-Cut Operations
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
| Hi-index | 0.00 |
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the existing varieties of genomic architectures. The genomic sequences of human and mouse provide evidence for a larger number of rearrangements than previously thought and shed some light on previously unknown features of mammalian evolution. In particular, they reveal extensive re-use of breakpoints from the same relatively short regions. Our analysis implies the existence of a large number of very short "hidden" synteny blocks that were invisible in comparative mapping data and were not taken into account in previous studies of chromosome evolution. These blocks are defined by closely located breakpoints and are often hard to detect. Our result is in conflict with the widely accepted random breakage model of chromosomal evolution. We suggest a new "fragile breakage" model of chromosome evolution that postulates that breakpoints are chosen from relatively short fragile regions that have much higher propensity for rearrangements than the rest of the genome.