String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
Information Technology has enabled information that can be in many forms such as text, image or sound, to be accessed widely using search terms via a computer. Due to this type of popularity and advancement in technology, there is an increased interest in searching Malay text to enable scholars and...
Saved in:
Main Author: | Mohd Ghazi, Mohd Razif |
---|---|
Format: | Thesis |
Language: | English |
Published: |
1999
|
Subjects: | |
Online Access: | https://ir.uitm.edu.my/id/eprint/98146/1/98146.pdf https://ir.uitm.edu.my/id/eprint/98146/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad
by: Muhamad, Kamarul Arifin
Published: (2002) -
Wavefront Longest Common Subsequence Algorithm On Multicore And Gpgpu Platform.
by: Shehabat, Bilal Mahmoud
Published: (2010) -
Analysis of string matching compression algorithms
by: Nadarajan, Krishnaveny, et al.
Published: (2008) -
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin
by: Shamsudin, Muhamad
Published: (2001) -
Strings
by: Soomro, Waseem Javaid, et al.
Published: (2011)