Referenced Items are not available for this document.
A standard technique for mapping a chromosome is to randomly select pieces, to use restriction enzymes to cut these pieces into fragments, and then to use the fragments for estimating the probability of overlap of these pieces. The authors describe a computational approach which has been used in the mapping of human chromosome 16 at Los Alamos National Laboratory. In particular, they describe 6-way and clustered implementations of an IBM Clustered Fortran program for detection of fragment overlap, with specific attention paid to problem partitioning, task structure, synchronization, and other factors which allow this type of code to perform well on a cluster of shared-memory multiprocessors. Measurements for one, six, and twelve processors for reduced problem sizes are included
Published in:
Supercomputing '90., Proceedings of
Date of Conference: 12-16 Nov 1990
- Page(s):
- 112 - 121
- Meeting Date :
- 12 Nov 1990-16 Nov 1990
- Print ISBN:
- 0-8186-2056-0
- INSPEC Accession Number:
- 4012046
- Conference Location :
- New York, NY
- Digital Object Identifier :
- 10.1109/SUPERC.1990.130009
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
