Tamil E.M.Idris M.Y.I.Thong C.M.Saudi M.M.Jali M.Z.2024-05-292024-05-29200897818400000002-s2.0-84926142989https://www.scopus.com/inward/record.uri?eid=2-s2.0-84926142989&partnerID=40&md5=6c4a0a5bb24e22a34f6b547bc035ec78https://oarep.usim.edu.my/handle/123456789/9921In this paper, the author(s) propose a new technique in spam detection from another discipline and propose an implementation of the underlying algorithm based on FPGA. The choice of algorithm are Needleman-Wunsch that are previously used in bioinformatics. By using Needleman-Wunsch as the main engine, real network traffic will be used as query and compared with spam signature to detect the real spam. Needleman-Wunsch algorithm is one of the earliest algorithm from the family of dynamic programming in approximate string matching. Applying Needleman-Wunsch algorithm in FPGA will greatly speeds the performance of this algorithm in spam scanning as it operate in hardware level instead of software level. � 2008 University of Plymouth All rights reserved.en-USFPGANeedleman-WunschSpamAlgorithmsBioinformaticsDynamic programmingField programmable gate arrays (FPGA)Approximate string matchingInline filtersMain enginesNeedleman-WunschNeedleman-Wunsch algorithmReal networksSpamSpam detectionInternetConference Paper141147