Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin
Dynamic programming is introduced to serve as underlying principle for solving problems in different areas such as operations research, computer science, speech processing and string processing. Longest Common Subsequence algorithm (LCS) has been developed to solve string matching problems. This met...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/98058/1/98058.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my-uitm-ir.98058 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-uitm-ir.980582024-08-21T23:27:23Z Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin 2001 Shamsudin, Muhamad Analysis Dynamic programming is introduced to serve as underlying principle for solving problems in different areas such as operations research, computer science, speech processing and string processing. Longest Common Subsequence algorithm (LCS) has been developed to solve string matching problems. This method is employed to retrieve documents from the translated Al-Quran. This approach will be introduced in the Web page as a search engine. Search engine will collate and return a list of clickable URLs containing presentations that match with word related. The list is ordered, with the best match appearing at the top of the Web page. 2001 Thesis https://ir.uitm.edu.my/id/eprint/98058/ https://ir.uitm.edu.my/id/eprint/98058/1/98058.pdf text en public degree Universiti Teknologi MARA (UiTM) Faculty of Information Technology and Quantitative Sciences Abu Bakar, Zainab |
| institution |
Universiti Teknologi MARA |
| collection |
UiTM Institutional Repository |
| language |
English |
| advisor |
Abu Bakar, Zainab |
| topic |
Analysis |
| spellingShingle |
Analysis Shamsudin, Muhamad Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| description |
Dynamic programming is introduced to serve as underlying principle for solving problems in different areas such as operations research, computer science, speech processing and string processing. Longest Common Subsequence algorithm (LCS) has been developed to solve string matching problems. This method is employed to retrieve documents from the translated Al-Quran. This approach will be introduced in the Web page as a search engine. Search engine will collate and return a list of clickable URLs containing presentations that match with word related. The list is ordered, with the best match appearing at the top of the Web page. |
| format |
Thesis |
| qualification_level |
Bachelor degree |
| author |
Shamsudin, Muhamad |
| author_facet |
Shamsudin, Muhamad |
| author_sort |
Shamsudin, Muhamad |
| title |
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| title_short |
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| title_full |
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| title_fullStr |
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| title_full_unstemmed |
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin |
| title_sort |
employing longest common subsequence method to retrieve translated al-quran documents / muhamad shamsudin |
| granting_institution |
Universiti Teknologi MARA (UiTM) |
| granting_department |
Faculty of Information Technology and Quantitative Sciences |
| publishDate |
2001 |
| url |
https://ir.uitm.edu.my/id/eprint/98058/1/98058.pdf |
| _version_ |
1811768884560134144 |