Αναγνώριση μοριακών ακολουθιών
Παυλίδης, Αθανάσιος Ε.
In order to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared for matching patterns. This is called sequence alignment. DNA sequence comparison is one of the most important and basic problems in computational biology. The most popular algorithm for this operation is BLAST which gives high speed but low sensitivity, i.e. significant matches may be missed by the searches. Another algorithm, the Smith-Waterman algorithm, is a more computationally expensive algorithm but achieves higher sensitivity. In this paper viral genetic material is compared by means of two algorithms, BLAST and Smith and Waterman algorithm.