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
The Median Problem for Breakpoints in Comparative Genomics
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We infer post-hybridization rearrangements in a hybrid genome, given the gene orders on its chromosomes and some knowledge of the two parent genomes. We study this in two biologically and computationally different contexts, genome fusion and interspecific fertilization. Exact algorithms are furnished for some cases, and a heuristic based on the Hannenhalli-Pevzner theory for another.