Winnowing sequences from a database search

Journal of Computational Biology

Volumn 7, Issue 1-2, 2000, Pages 293-302

  Berman, Piotr ^a   Zhang, Zheng ^a   Wolf, Yuri I ^b   Koonin, Eugene V ^b   Miller, Webb ^a  

^a The Pennsylvania State University   (United States)

^b NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

Blast program; Sequence alignment; Sequence database

Indexed keywords

ALGORITHM; DATA BASE; GENE LOCATION; GENE SEQUENCE; GENETIC PROCEDURES; MATHEMATICAL MODEL; PRIORITY JOURNAL; REVIEW; SEQUENCE HOMOLOGY;

ALGORITHMS; BIOMETRY; DATABASES, FACTUAL; DNA; GLUTAMATE SYNTHASE; METHANOCOCCUS; PROTEINS; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 0034096335     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270050081531     Document Type: Review

References (14)

1. Altschul, S., Gish, W., Myers, E., Miller, W., and Lipman, D. 1990. Basic local alignment search tool. J. Mol. Biol. 215, 403-410.
2. Altschul, S., Madden, T., Schäffer, A., Zhang, J., Zhang, Z., Miller, W., and Lipman, D. 1997. Gapped BLAST and PSI-BLAST - a new generation of protein database search programs. Nucleic Acids Res. 25, 3389-3402.
3. Goodrich, M.T., and Tamassia, R. 1991. Dynamic trees and dynamic point location. Proc. 23rd STOC, 523-533.
4. Gupta, P., Janardan, R., Smid, M., and DasGupta, B. 1997. The rectangle enclosure and point-dominance problems revisited. Int. J. of Computational Geometry and Applications 7, 437-455.
5. Karlsson, R.G., and Overmars, M.H. 1988. Scanline algorithms on a grid. BIT 28, 227-241.
6. Kung, H.T., Luccio, F., and Preparata, F.P. 1975. On finding the maxima of a set of vectors. J. of ACM 20, 469-476.
7. McCreight, E.M. 1982. Priority search tree. SIAM J. Comput. 11, 149-165.
8. Mian, I.S. 1997. Comparative sequence analysis of ribonucleases HII, III, II PH and D. Nucleic Acids Res. 25, 3187-3195
9. Mushegian, A.R., Bassett, D.E. Jr., Boguski, M.D., Bork, P., and Koonin, E.V. 1997. Positionally cloned human disease genes: patterns of evolutionary conservation and functional motifs. Proc. Natl. Acad. Sci. USA 94, 5831-5836
10. Pugh, W. 1990. Skip lists: a probabilistic alternative to balanced trees. Communications of ACM 33, 668-676.
11. Sleator, D.D., and Tarjan, R.E. 1983. A data structure for dynamic trees. JCSS 26, 362-391.
12. Sohnhammer, E.L.L., and Durbin, R. 1994. A workbench for large-scale sequence homology analysis. CABIOS 10, 301-307.
13. van Emde Boas, P. 1977. Preserving order in a forest in less than logarithmic time. IPL 6, 80-82.
14. Zhang, Z., Berman, P., and Miller, W. 1998. Alignments without low-scoring regions. J. Comp. Biol. 5, 197-210.