Pencocokan hampiran untai dengan program dinamik = Approximate string matching by dynamic programming
| Main Authors: | Ruruh Wuryani, author, Add author: Djati Kerami, supervisor, Add author: Gatot Fatwanto Hertono, examiner, Add author: Hendri Mufti, examiner, Add author: Alhadi Bustaman, examiner |
|---|---|
| Format: | Masters Thesis |
| Terbitan: |
Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia
, 2011
|
| Subjects: | |
| Online Access: |
https://lib.ui.ac.id/detail?id=20291531 |
Daftar Isi:
- Dalam tesis dibahas pencocokan hampiran untai (approximate string matching) dari dua untai berbeda. Dalam meninjau tingkat kedekatan hampiran dua untai atau tingkat kemiripan dua untai digunakan ukuran Jarak Levenshtein, Dalam penentuan jarak tersebut digunakan metode program dinamik. Diperoleh beberapa sifat-sifat yang berhubungan dengan susunan kedua untai yang dicocokkan. Pada akhir tesis diberikan juga program komputer sederhana dalam penentuan jarak Levenshtein. <hr><i>In this thesis described approximate string matching problem between two different strings. To show the approximate level of both strings or the similarity level of both strings is used Levenshtein distance. To determine Levenshtein distance is used by dynamic programming method. Found Some characteristics that have relation with composition of both strings that are matched. At the end of the thesis, given the simple computer program to determine Levenshtein distance.</i>