Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/13344
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKwok, Jee Ann.en_US
dc.date.accessioned2008-10-20T07:25:46Z-
dc.date.available2008-10-20T07:25:46Z-
dc.date.copyright1999en_US
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/10356/13344-
dc.description.abstractThe main focus of this dissertation is in its testing and evaluation of five string matching algorithms. All the selected algorithms were coded in C programs, and then a few test cases were also developed to test the efficiencies of the above algorithms under different simulations. From the results, the dissertation concludes that there is a variation of performance in terms of execution time as well as number of comparisons made for different algorithms when subjected under different testing conditions. In terms of execution time, the Horspool algorithm has achieved the best performance. The Boyer- Moore algorithm is more efficient in terms of direct character comparisons.en_US
dc.format.extent111 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systemsen_US
dc.titleAlgorithms for information retrievalen_US
dc.typeThesisen_US
dc.contributor.supervisorCheng, Tee Hiangen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeMaster of Science (Communication and Network Systems)en_US
item.grantfulltextrestricted-
item.fulltextWith Fulltext-
Appears in Collections:EEE Theses
Files in This Item:
File Description SizeFormat 
KwokJeeAnn1999.pdf
  Restricted Access
Main report11.45 MBAdobe PDFView/Open

Page view(s) 50

269
Updated on May 15, 2021

Download(s)

6
Updated on May 15, 2021

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.