UI - Tesis Open :: Back

UI - Tesis Open :: Back

Pencocokan hampiran untai dengan program dinamik = Approximate string matching by dynamic programming

Ruruh Wuryani; Djati Kerami, supervisor; Gatot Fatwanto Hertono, examiner; Hendri Mufti, examiner; Alhadi Bustaman, examiner (Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2011)

 Abstract

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.

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.

 Digital Files: 1

 Metadata

Collection Type : UI - Tesis Open
Call Number : T29619
Main entry-Personal name :
Additional entry-Personal name :
Study Program :
Subject :
Publishing : Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2011
Cataloguing Source LibUI ind rda
Content Type text
Media Type unmediated ; computer
Carrier Type volume ; online resource
Physical Description xiv, 67 pages : illustration ; 28 cm + apendix
Holding Institution Universitas Indonesia
Location Perpustakaan UI, Lantai 3
  • Availability
  • Review
  • Cover
Call Number Barcode Number Availability
T29619 15-18-156716717 TERSEDIA
Review:
No review available for this collection: 20291531
Cover