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!
|