Parallel hardware for sequence comparison and alignment

Bioinformatics

Volumn 12, Issue 6, 1996, Pages 473-479

  Hughey, Richard ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SYSTEM; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; SEQUENCE ANALYSIS;

ALGORITHMS; COMPUTER SYSTEMS; COMPUTERS; DATABASES, FACTUAL; HUMAN GENOME PROJECT; HUMANS; SEQUENCE ALIGNMENT;

EID: 0030462897     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/12.6.473     Document Type: Article

References (36)

1. Altschul.S.F. et al. (1990) Basic local alignment search tool. JMB, 215, 403-410.
2. Bertin, P., Roncin, D. and Vuillemin, J. (1989) Introduction to programmable active memories. Technical Report 3 Digital Paris Research Laboratory Rueil Malmaison, France.
3. Borah, M., Bajwa, R.S., Hannenhalli, S. and Irwin, M.J. (1994) A SIMD solution to the sequence comparison problem on the MGAP. In: ASAP, (Capello.P. et al., eds) pp. 336-45, Los Alamitos, CA: IEEE CS.
4. Brutlag, D., Deautricour, U.-P. and Griffin, J. (1994) Personal Communication.
5. Chow, E., Hunkapiller, T., Peterson, I. and Waterman, M.S. (1991) Biological information signal processor. In: ASAP, (Valero.M. et al., eds) pp. 144-160, Los Alamitos, CA: IEEE CS.
6. Compugen Ltd. (1994) Biocellerator information package. Obtained from compugen@datasrv.co.il.
7. Edmiston, E.W., Core.N.G., SaltzJ.H. and Smith.R.M. (1988) Parallel processing of biological sequence comparison algorithms. International Journal of Parallel Programming, 17(3), 259-275.
8. Gokhale.M. et al. (1991) Building and using a highly parallel programmable logic array. Computer, 24(1), 81-89.
9. Gokhale.M. et al., (1995) Processing in memory: The Terasys massively parallel PIM array. Computer, 28(4), 23-31.
10. Gotoh.O. (1982) An improved algorithm for matching biological sequences. JMB, 162(3), 705-708.
11. Gribskov.M., LQthy, R. and Eisenberg, D. (1990) Profile analysis. Methods in Enzymology, 183, 146-159.
12. Grice, I.A., Hughey.R. and Speck, D. (1996). Reduced space sequence alignment. Comput. Applic. Biosci. In press.
13. Hirschberg, D.S. (1975) A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6), 341-343.
14. Hirschberg, J.D., Hughey, R., Karplus, K. and Speck, D. (1996) Kestrel: A programmable array for sequence analysis. In: ASAP, Los Alamitos, CA: IEEE CS.
15. Hoang, D.T. (1992) A systolic array for the sequence alignment problem. Technical Report CS-92-22 Dept. CS, Brown Univ. Providence, RI.
16. Hoang, D.T. (1993) Searching genetic databases on Splash 2. In: Proc. IEEE Workshop on FPGAs for Custom Computing Machines, (BueU, D.A. and Pocek.K.L., eds) pp. 185-191, Los Alamitos, CA: IEEE CS.
17. Huang, X. (1989) A space-efficient paralle sequence comparison algorithm for a message-passing multiprocessor. International Journal of Parallel Programming, 18(3), 223-239.
18. Hughey.R. and Krogh, A. (1996) Hidden Markov models for sequence analysis: Extension and analysis of the basic method. CABIOS, 12(2), 95-107.
19. Hughey, R. and Lopresti, D.P. (1991) B-SYS: A 470-processor programmable systolic array. In: ICPP, (Wu, C, ed) volume 1 pp. 580-583, Boca Raton, FL: CRC Press
20. Ibarra.O.H., Jiang, T. and Wang, H. (1992) String editing on a one-way linear array of finate-state machines. IEEE Transactions on Computers, 41(1), 112-118.
21. Krogh.A., Brown.M., Mian.I.S., Sjknder, K. and Haussler.D. (1994) Hidden Markov models in computational biology: Applications to protein modeling. JMB, 235, 1501-1531.
22. Lavenier, D. (1996) SAMBA: Systolic accelerators for molecular biological applications. Technical Report 988 IRISA 35042 Rennes Cedex, France.
23. Lemoine, E., Quinqueton, J. and Sallantin, J. (1994) High speed pattern matching in genetic data base with reconfigurtable hardware. In: ISMB, (Altman.R. et al., eds) pp. 269-275, Menlo Park, CA: AAAI/ MIT Press.
24. Lipton, R. and Lopresti, D. (1987) Comparing long strings on a short systolic array. In: Systolic Arrays, (Moore, W., McCabe.A. and Urquhart, R. eds) pp. 363-376. Adam Hilger Boston, MA.
25. Lopresti.D.P. (1987). P-NAC: A systolic array for comparing nucleic acid sequences. Computer, 20(7), 98-99.
26. Masek, W.J. and Paterson, M.S. (1983). How to compute string-edit distances quickly. In: Time Warps. String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison pp. 337-349. Addison-Wesley Reading, MA.
27. Myers, E.W. and Miller, W. (1988). Optimal alignments in linear space. CABIOS, 4(1), 11-17.
28. NickollsJ.R. (1990) The design of the Maspar MP-1: A cost effective massively parallel computer. In: COMPCON Spring 1990 pp. 25-28, Los Alamitos, CA: IEEE Computer Society Press.
29. Paracel Inc (1996). FDF-3 product information. Pasadena, CA, http://www.paracel.com.
30. Pearson, W.R. (1995a). Personal communication.
31. Pearson.W.R. (1995b). Comparison of methods for searching protein sequence databases. Protein Science, 4(6), 1145-1160.
32. Roberts.L. (1989). New chip may speed genome analysis. Science, 244(4905), 655-6.
33. Sellers, P.H. (1974) On the theory and computation of evolutionary distances. SIAM J. Appl. Math. 26, 787-793.
34. Singh, R. et al. (1993) A scalable systolic multiprocessor system for biosequence similarity analysis. In: Symp. Integrated Systems, (Snyder.L., ed) pp. 169-181, Cambridge, MA: MIT Press.
35. Smith.T.F. and Waterman, M.S. (1981) Identification of common molecular subsequences. JMB, 147, 195-197.
36. Time Logic Inc. (1996) Decypher II product literature. Incline Village, NV, http://www.timelogic.com.