Path: utzoo!utgpu!watmath!uunet!bionet!rutgers!orstcs!bionette!kramerj
From: kramerj@bionette.CS.ORST.EDU (Jack Kramer - CMBL)
Newsgroups: bionet.molbio.bio-matrix
Subject: Re: Info on searching protocols...
Message-ID: <7246@orstcs.CS.ORST.EDU>
Date: 8 Nov 88 17:13:21 GMT
References: <8811081605.AA19384@presto.ig.com>
Sender: usenet@orstcs.CS.ORST.EDU
Reply-To: kramerj@bionette.UUCP (Jack Kramer - CMBL)
Organization: Oregon State University - CMBL
Lines: 23

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