Multiple genome rearrangements

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multiple genome rearrangements

Full text

Pdf (603 KB)

Source

Annual Conference on Research in Computational Molecular Biology archive
Proceedings of the second annual international conference on Computational molecular biology table of contents

New York, New York, United States

Pages: 243 - 247

Year of Publication: 1998

ISBN:0-89791-976-9

Authors

David Sankoff	Centre de recherches mathématiques, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, Québec H3C 3J7
Mathieu Blanchette	Centre de recherches mathématiques, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, Québec H3C 3J7

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 24, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279069.279122 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Blanchette, G. Bourque and D. Saukoff. Breakpoint phylogenies. Genome Informatics 1997 (S.Miyano and T. Tat~gi, ed~) Tokyo: Universal Academy Press, 25- 34, 1997.
	2	M. Blanchette, T. Kunisawa and D. Sankoi~ Parametric genome rearrangement. Gene-Comb~s (online) and Ge~e 172, GCll-17, 1996.
	3	David Sankoff , Mathieu Blanchette, The Median Problem for Breakpoints in Comparative Genomics, Proceedings of the Third Annual International Conference on Computing and Combinatorics, p.251-264, August 20-22, 1997
	4	A. Caprara. Formulations and complexity of multiple sorting by reversals, ms., University of Bologna, December 1997.
	5	Vincent Ferretti , Joseph H. Nadeau , David Sankoff, Original Synteny, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, p.159-167, June 10-12, 1996
	6	Dan Gusfield, Algorithms on strings, trees, and sequences: computer science and computational biology, Cambridge University Press, New York, NY, 1997
	7	S. Harmenh~, C. Chappey, E.V. Koonin and P.A. Pevzner. Genome sequence comparison and scenaxos for gene rearrangements: a test case. Genom/c.s 30: 299-311, 1995.
	8	L Pe'er and tLShasnk (pemonal communication, Jan- :{99s).
	9	Open Combinatorial Problems in computational Molecular Biology, Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95), p.158, January 04-06, 1995
	10	D. Sankoff. The early introduction of dynamic programming into computational biology. Advances in the Mathematical Sciences- CRM's 25 years (L. Vinet, ed.) C'q~{ Proceedings and Lecture Notes., voL 11, Providence, Rh American Mathematical Society., 403-413, 1997.
	11	D. Sankoff, R.J. Cede~n, and G. Lapalme~ Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA. J. Mol. EvoL, 7:133-149, 1976.
	12	D. Sarrkoff, G. Leduc, N. Antoine, B. Paquin, B.F. Lang, and tL Ceder~m Gene order comparisons for phylogenetic inference~ Evolution of the mitochondrial genome. P~ings of the National Academy of Sciences USA 89: 6575-6579, 1992.
	13	D. Sankoff, C. Morel and tLJ. Cedergren. Evolution of 5S RNA and the non-randomess of base replacement. Nature New Biology 245:232-234, 1973.
	14	D. Sankoff, G. Sundaram and J. Kececioglu. Steiner points in the space of genome rearrangements. International Journal of the Foundations of Computer Science, 7:1-9,1996.
	15	J. Setubal and J. Meidazgs. Introduction to Computational Molecular Biology. Boston: PWS Publishing. 1997.