One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results such as BLAST  and FASTA  are not a total replacement for the more rigorous but slower algorithms like Smith- Waterman . The different techniques complement one another. A… (More)
Local sequence alignment is widely used to discover structural and hence, functional similarities between biological sequences. While the faster heuristic methods like BLAST and FASTA are useful to compare a single sequence to hundreds or even thousands of sequences in genetic databases such as GenBank, EMBL, and DDBJ, this work yields pairwise alignments… (More)
More sensitive than heuristic methods for searching biological databases, the Smith-Waterman algorithm is widely used, but it has a high quadratic running time. This work presents a faster approach and implementation for Smith-Waterman that extends the traditional results to return multiple, BLAST-like sub-alignments. The extended Smith-Waterman using… (More)
1 Figure 1: Conceptual view of the ASC model of parallel computation.
As a new graduate or teaching assistant it may be difficult adjusting to the dual role of student and instructor, since most of a graduate students' academic career is as a student. Moreover, the majority of undergraduates in the sciences do not study teaching methods as their main focus is on their major. The dual role of student / instructor brings with… (More)
Introduction The goal of sequence alignment is to find similarity between the different strings of genetic information. similar characters AE similar structure AE similar function In addition to functional similarity (finding what a gene does by comparing it to genes with known function), alignment can create models for ancestral relationships, or aid in… (More)