dc.contributor.authorNg, Kee Wan.en_US
dc.date.accessioned2008-10-20T07:21:17Z
dc.date.available2008-10-20T07:21:17Z
dc.date.copyright1999en_US
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/10356/13245
dc.description.abstractThere are many different types of strategies for the search of a pattern in a string or text and there exist many papers on the different types of patternmatching algorithms. The main contribution of this dissertation is the presentation and the evaluation of five well-known pattern-matching algorithms. The algorithms evaluated in this dissertation are: Brute Force, Knuth Morris Pratt, Karp Rabin, Boyer Moore and Sunday's Quick Search algorithms.en_US
dc.format.extent89 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systemsen_US
dc.titleA study on pattern matching algorithmsen_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
dc.contributor.supervisor2Gunawan, Erryen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record