Penerapan Algoritma Vektor pada Finite Automata untuk Perkiraan Kecocokan String DNA Aves

Abstract

Finite automata is a very useful device to calculate string. An approximate string matching problem is to find the location where a pattern is approximately matched with sub string taken from some texts with appointed maximum difference. We use bit vector algorithm to solve approximate string matching problem. Bit vector algorithm is used properly by using parallelism between the text and the pattern, because vector parallelism can take a short time at execution process by reducing iteration. Approximate string matching problem can be implemented in biology when we test the DNA matching, in example for Aves DNA.