Accepted:
23 May 1997
| |
/vol04/mulali/ | © Copyright 1997 | |||
| Volume 04 | Received: Accepted: |
31 Oct 1996 23 May 1997 |
|||
|
Multiple Alignment
Georg Fuellen |
|
| Abstract | |
| General Rationale. You will understand why Multiple Alignment is considered a challenging problem, you will study approaches that try to reduce the number of steps needed to calculate the optimal solution, and you will study fast heuristics. In a case study involving immunoglobulin sequences, you will study multiple alignments obtained from WWW servers, recapitulating results from an original paper. Further instructions for obtaining the Solution Sheet are available by sending email to majordomo@lists.uni-bielefeld.de, with no subject line, and the following message body: subscribe vsns-bcd-solutions Prerequisites. An understanding of the dynamic programming (edit distance) approach to pairwise sequence alignment is useful for parts 1.3, 1.4, and 2. Also, familiarity with the use of Internet resources would be helpful for part 3. For the former, see Chapters 1.1 - 1.3, and for the latter, see Chapter 2 of the Hypertext Book of the GNA-VSNS Biocomputing Course at http://www.techfak.uni-bielefeld.de/bcd/Curric/welcome.html. | |
| Full Text |
|
|
Multimedia Links (none) Reference Links (none) Citation Reference |
Get viewers for PS & PDF   |
