New and efficient algorithms for single pattern matching

مقدم أطروحة جامعية

Mansi, Rami Hasan Umar

مشرف أطروحة جامعية

al-Nihoud, Jihad Quball Awdah

أعضاء اللجنة

al-Smadi, Adnan M.
Bani Muhammad, Sad
Qaddurah, Ruzayn Ahmad

الجامعة

جامعة آل البيت

الكلية

كلية الأمير الحسين بن عبد الله لتكنولوجيا المعلومات

القسم الأكاديمي

قسم علوم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2009

الملخص الإنجليزي

The string matching problem is defined as finding the occurrences of a pattern P of length m in a text T of length n.

String matching algorithms are considered as one of the most important components used in implementations of practical software under most operating systems.

In many information retrieval and text-editing applications, it is necessary to be able to locate quickly some or all occurrences of a user-specified pattern in a text.

This study reviewed the most important and mostly used exact single pattern matching algorithms in order to enhance the existing algorithms and propose new single pattern matching algorithms.

In this study, we propose four exact single pattern matching algorithms, First Character-Rami and Jehad (FC-RJ), First and Last Characters-Rami and Jehad (FLC-RJ), First, Middle and Last Characters-Rami and Jehad (FMLC-RJ) and ASCII-Based-Rami and Jehad (ASCII-Based-RJ) algorithms.

Furthermore, a string matching tool, called String Matching Tool-Rami and Jehad (SMT-RJ), has been developed, and the proposed algorithms, in addition to the Brute Force and Boyer-Moore algorithms, have been implemented, tested and compared using the developed tool.

The experimental results have shown that the FC-RJ, FLC-RJ and FMLC-RJ algorithms outperformed the Brute Force algorithm, while the ASCII-Based-RJ algorithm outperformed both Brute Force and Boyer-Moore algorithms.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

عدد الصفحات

82

قائمة المحتويات

Table of contents.

Abstract.

Chapter One : introduction.

Chapter Two : related works.

Chapter Three : methodology.

Chapter Four : the proposed algorithms.

Chapter Five : the SMT-RJ simulator.

Chapter Six : results and discussion.

Chapter Seven : conclusions and future works.

References.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Mansi, Rami Hasan Umar. (2009). New and efficient algorithms for single pattern matching. (Master's theses Theses and Dissertations Master). Al albayt University, Jordan
https://search.emarefa.net/detail/BIM-307328

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Mansi, Rami Hasan Umar. New and efficient algorithms for single pattern matching. (Master's theses Theses and Dissertations Master). Al albayt University. (2009).
https://search.emarefa.net/detail/BIM-307328

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Mansi, Rami Hasan Umar. (2009). New and efficient algorithms for single pattern matching. (Master's theses Theses and Dissertations Master). Al albayt University, Jordan
https://search.emarefa.net/detail/BIM-307328

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-307328