Multiple genome rearrangements

Authors:
David Sankoff;Mathieu Blanchette
Affiliations:
Centre de recherches mathématiques, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, Québec H3C 3J7;Centre de recherches mathématiques, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, Québec H3C 3J7
Venue:
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Year:
1998

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Original Synteny

CPM '96 Proceedings of the 7th 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
Open Combinatorial Problems in computational Molecular Biology

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

Formulations and hardness of multiple sorting by reversals

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
A simulation tool for the study of symmetric inversions in bacterial genomes

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics

Hi-index	0.00