Building 38A, 8th floor conference room at 11 am Friday January 14th, 2000.

Speaker: 
	Sanguthevar Rajasekaran, University of Florida, Gainesville.
	Department of Computer, Information Science and Engineering.

Title: 
	Local Alignment Search in Biological Sequences

Abstract:
	We present efficient algorithms for local alignment seaches in biological
sequences. These algorithms identify maximal segment pairs (MSPs). Our
algorithms are efficiently parallelizable. We employ fast Fourier
transforms (FFTs). Though several attempts have been made in the past to
employ FFTs in sequence analysis, they fail to capture local similarities.
Our algorithms employ FFTs in a novel way to identify local similarities.
FFT-based techniques have the attractive feature of benefiting from
ultrafast special purpose hardware available for digital signal processing.
We also present a sorting based algorithm and a suffix tree based algorithm
for the same problem.