Work place: College of Computer Science and Information’s- Princes Nourah University-Riyadh – KSA Networking and Communication Systems
Research Interests: Data Structures and Algorithms, Network Security, Information Security, Computer Networks, Computer systems and computational processes
Dr. M.A.Hadi was born in Cairo, Egypt, in 1960. He received BSc degree in Electronic and Telecommunication in 1983 from Faculty of Engineering, Helwan University, Egypt. He was a consultant engineer at Computer and Networks field in KSA. In 2003, he received his MSc in Computer Engineering from AlAzhar University, Egypt. In 2012, he received his Ph. D. in Computer Engineering and Networks, from the Engineering College at Al-Azhar University. Currently, , he was a Lecture at Faculty of Science, Department of computer science at Darna university Libya, from 2003 to 2004, he was an lecturer. From 2004 to 2010 at Taif Department of computer science at Darna university Libya, from 2003 to 2004, he was an lecturer. From 2004 to 2010 at Taif University, He is working From 2012 to 2013 as an assistant professor at the Electricity Department at College of Engineering, Taif University. KSA. He was working from Aug. 2013 to Jan. 2014 as an assistant professor in Engineering and Computer Science, at Cairo High Institute for Engineering and Computer Science, New Cairo, Egypt. At the same time he was working as an assistant professor in Engineering College at Canadian International College, New Cairo, Egypt. Currently he is working as an assistant professor of Computer Networks and Communication Systems at –College of Computer and Information Sciences - Princes Nora University, Riyadh, KSA. His research interests include Computer Networks, Wireless Networks, Data Security, Mobile Applications and Satellite Communications.
DOI: https://doi.org/10.5815/ijigsp.2015.09.04, Pub. Date: 8 Aug. 2015
This paper introduces an algorithm to address the problem of finding the longest common substring between two documents. This problem is known as the longest common substring (LCS) problem. The proposed algorithm is based on the convolution between the two sequences (named major sequence (X) which is represented as array and the minor one (Y) which is represented as circular linked list. An array of linked lists is established and a new node is created for each match between two substrings. If two or more matches in different locations in string Y share the same location in string X, the corresponding nodes will construct a unique linked-list. Accordingly, by the end of processing, we obtain a group of linked-lists containing nodes arranged in certain manner representing all possible matches between sequences X and Y. The algorithm has been implemented and tested in C# language under Windows platform. The obtained results presented a very good speedups and indicated that impressive improvements had been achieved.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals