Distributing the comparison of DNA and protein sequences across heterogeneous supercomputers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributing the comparison of DNA and protein sequences across heterogeneous supercomputers

Full text

Pdf (724 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1991 ACM/IEEE conference on Supercomputing table of contents

Albuquerque, New Mexico, United States

Pages: 139 - 146

Year of Publication: 1991

ISBN:0-89791-459-7

Authors

Hugh Nicholas	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA
Grace Giras	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA
Vasiliki Hartonas-Garmhausen	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA
Michael Kopko	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA
Christopher Maher	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA
Alexander Ropelewski	Pittsburgh Supercomputing Center, 4400 Fifth Avenue, Pittsburgh, PA

Sponsors

IEEE : Institute of Electrical and Electronics Engineers
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 8, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/125826.125911 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	Gotoh, O., "An Improved Algorithm for Matching Biological Sequences," J. of Molecular Biology, vol. 162, pp. 705-708, 1982.
	2	Jones, R., Taylor, W.,IV., Zhang, X., Mesirov, J.P., and Lander, E., "Protein Sequence Comparison on the Connection Machine CM-2," Computers and DNA, SFI Studies in the science of Complexity, Vol. VII, Eds. G. Bell and T. Marr, Addison-Wesley Longman, 1989.
	3	Sankoff, D., Kruskal, J.B., Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparsion, Addison-Wesley, 1983.
	4	Smith, T.F., Waterman, M.S., "Identification of Common Molecular Subsequences," J. of Molecular Biology, vol. 147, pp. 195-197, 1981.
	5	Waterman, M.S., and Eggert, M., "A new Algorithm for Best Subsequence Alignments with Application to tRNA-rRNA Comparisons," J. of Molecular Biology, vol. 197, pp. 723-728, 1987.

CITED BY 2

	Alexander Ropelewski , Hugh Nicholas , David Deerfield, Implementation of Genetic Sequence Alignment Programs on Supercomputers, The Journal of Supercomputing, v.11 n.3, p.237-253, 1997
	John E. Savage, A model for multi-grained parallelism (extended abstract), Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.330-335, June 27-29, 1994, Cape May, New Jersey, United States