Winnowing sequences from a database search

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Winnowing sequences from a database search

Full text

Pdf (1.22 MB)

Source

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

Lyon, France

Pages: 50 - 58

Year of Publication: 1999

ISBN:1-58113-069-4

Authors

Piotr Berman	Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA
Zheng Zhang	Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA
Yuri I. Wolf	National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, MD and Institute of Cytology and Genetics, Russian Academy of Sciences, Novosibirsk 630090, Russia
Eugene V. Koonin	National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, MD
Webb Miller	Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA

Sponsors

INRIA : Institut Natl de Recherche en Info et en Automatique
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

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/299432.299451 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	Altschul, S., W. Gish, E. Myers, W. Miller and D. Lipman (1990) Basic local alignment search tool. J. Moi. Biol. 215, 403-410.
	2	Altschul, S., T. Madden, A. Sch'~iffer, J. Zhang, Z. Zhang, W. Miller and D. Lipman (1997) Gapped DJ.~Z~LO I ~IIU %- DI-DI.J~"LD I c~ n~W ~lic;l~blUii rein database search programs. Nucleic Acids Res. 25, 3389-3402.
	3	Michael T. Goodrich , Roberto Tamassia, Dynamic trees and dynamic point location, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.523-533, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103472]
	4	Gupta, Janarthanan,. M. Smith and DasGupta (1997) The rectangle enclosure and point-dominance problems revisited. International Journal of Computational Geometry ~ Applications 7, 437-455.
	5	McCreight, E. M. (1982) Priority search tree. SIAM J. Comput. 11, 149-165.
	6	Mia.n T .q (lqq7~ Comp~ativo .qonnonc. o. a naly.qiq of ribonucleases HII, IIi, II PH and D. Nucleic Acids Res. 25, 3187-3195
	7	Mushegian, A. R., D. E. Bassett Jr, M. D. Boguski, P. Bork and E. V. Koonin (1997) Positionally cloned human disease genes: patterns of evolutionary conservation and functional motifs. Proc. Natl. Acad. $ci. USA QA KQCtl _CQct{~
	8	Daniel D. Sleator , Robert Endre Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences, v.26 n.3, p.362-391, June 1983 [doi>10.1016/0022-0000(83)90006-5]
	9	Sohnhammer, E.L.L., and R. Durbin (1994) A workbench for large-scale sequence homology analysis. CABIO$10, 301-307.
	10	William Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, v.33 n.6, p.668-676, June 1990 [doi>10.1145/78973.78977]