elliston@BIOVAX.RUTGERS.EDU (11/08/88)
I need some info, or pointers to info, on several searching algorithms for nucleic acid sequences. these are: 1) Wilbur - lipman 2) Needleman-Wensch/Smith-Waterman 3) fastA can anyone explain these to me in a language that a molecular biologist can understand (albeit a computer literate mol. biologist)? Thanks Keith ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Keith O. Elliston | Waksman Institute Bitnet: ELLISTON@BIOVAX | P.O. Box 759 Arpanet: ELLISTON@biovax.rutgers.edu | Rutgers, The State U. of NJ AT&T: (201)932-3801 | Piscataway, NJ 08855-0759 USA ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ "...for with friends men are more able both to think and to act." -Aristotle ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------
kramerj@bionette.CS.ORST.EDU (Jack Kramer - CMBL) (11/09/88)
In article <8811081605.AA19384@presto.ig.com> <elliston@biovax.rutgers.edu> writes: > >I need some info, or pointers to info, on several searching algorithms for >nucleic acid sequences. these are: > > 1) Wilbur - lipman > 2) Needleman-Wensch/Smith-Waterman > 3) fastA > >can anyone explain these to me in a language that a molecular biologist can >understand (albeit a computer literate mol. biologist)? > A good place to start is "Sequence Analysis in Molecular Biology" by Gunnar von Heijne (AP - 1987). For more details but still targeted at the user try scanning "Computer Applications in the Biosciences" (IRL Press). Lots of refs to take you into any specifics in both of these. Jack Kramer Computational Molecular Biology Laboratory Oregon State University