DSpace logo

Please use this identifier to cite or link to this item: https://repository.uksw.edu/handle/123456789/1020
Title: Penerapan Algoritma Vektor pada Finite Automata untuk Perkiraan Kecocokan String DNA Aves
Authors: Nataliani, Yessica
Keywords: approximate string matching problem;bit vector algorithm;DNA matching
Issue Date: Feb-2007
Publisher: Fakultas Teknologi Informasi UKSW
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.
Description: Aiti : Jurnal Teknologi Informasi, Vol. 4, No. 1, Februari 2007, p. 1-15
URI: http://repository.uksw.edu/handle/123456789/1020
ISSN: 1693-8348
Appears in Collections:Aiti 2007 Vol. 4 No. 1 Februari

Files in This Item:
File Description SizeFormat 
ART_Yessica Nataliani_Penerapan algoritma vector_Abstract.pdfAbstract910.67 kBAdobe PDFView/Open
ART_Yessica Nataliani_Penerapan algoritma vector_Full text.pdfFull text637.59 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.