[uw.cs.grad] Parallel Computation in Dynamic Programming for Optimal String-to-Network Alignments.

ylkingsbury@watdragon.waterloo.edu (Yvonne Kingsbury) (06/22/89)

                 The University of Waterloo
                   200 University Avenue
                     Waterloo, Ontario


         The Institute of Computer Research (ICR)

                   Presents a seminar on

        Parallel Computation in Dynamic Programming

          for Optimal String-to-Network Alignments


by    Dr. M.G. Thomason
of    Department of Computer Science, University of Tennessee




ABSTRACT

A version  of  parallel  computation  in  dynamic  programming  for
optimal  string-to-network  alignments  is discussed.  The specific
application is pattern analysis in which Markov networks  are  used
as  models of classes of strings.  The dynamic programming computes
maximum  probability  string-to-network  alignments  with  a   cost
function  based  on relative frequencies.  The concurrent-processor
computer is a Sequent Balance, a machine with  processors,  memory
modules, and I/O controllers connected to a single, high-speed bus.
The implementation and experimental results are described.



DATE:     Thursday, June 29, 1989
TIME:     10:00 a.m.
PLACE:    Davis Centre, Room 1302

Everyone is welcome.  Refreshments served.