Scribd
Upload
22 views3 pages

Algo Research

Uploaded by

meeshanche
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views3 pages

Algo Research

Uploaded by

meeshanche
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

String Matching Algorithms For Reteriving Information From Desktop –

Comparative Analysis
Name: Muhammad Zeeshan Roll No: 005
University offundamental
Sialkot in this process, particularly for
desktop search systems, which focus on
retrieving content stored locally on
computers. These algorithms are critical in
Abstract
various applications, including text mining,
bioinformatics, and plagiarism detection.
The reviewed research paper focuses on the
analysis of various string matching This review paper examines to performance
algorithms, particularly in the context of of several string matching algorithms,
desktop search systems. Desktop search, a focusing on their application in desktop
specialized variant of enterprise search, search environments. The algorithms under
involves the retrieval of information stored review include the Two-Way, Colussi,
on personal computers, including documents, Optimal Mismatch, and Maximal Shift
emails, and web content. The research algorithms.
compares four specific algorithms—Two-
Way, Colussi, Optimal Mismatch, and 2. Review of String Matching Algorithms
Maximal Shift—in terms of their 2.1 Two-Way Algorithm
performance, including search time, number
of iterations, and accuracy. The study The Two-Way algorithm is designed for
concludes that the Colussi algorithm efficient string matching by factorizing the
outperforms the others in terms of accuracy, search pattern into two parts. The algorithm
making it a preferable choice for desktop processes the pattern in two stages, ensuring
search applications. that mismatches are quickly handled with
minimal unnecessary comparisons. The
1. Introduction complexity of this algorithm is O(n), making
it suitable for various text-matching
The field of Information Retrieval (IR) is applications.
essential in managing and retrieving relevant
documents from large datasets based on user 2.2 Colussi Algorithm
queries. String matching algorithms are
The Colussi algorithm is an enhancement of
the Knuth-Morris-Pratt (KMP) algorithm,
focusing on optimizing the comparison
process by dividing the pattern positions into
two subsets. This algorithm performs
comparisons in two phases: the no-holes
phase (left-to-right) and the holes phase analyzed to determine the most efficient
(right-to-left). Its primary advantage is the algorithm for desktop search purposes.
reduced need for re-comparison of certain
text characters, leading to improved
performance in many cases.

2.3 Optimal Mismatch Algorithm

The Optimal Mismatch algorithm, a variant


of the Quick Search algorithm, compares
characters based on their frequency, starting
with the least frequent characters. This
approach is advantageous when mismatches
occur frequently, as it allows the algorithm to
skip large portions of the text quickly.
However, its time complexity can be
quadratic in the worst case.

2.4 Maximal Shift Algorithm

The Maximal Shift algorithm modifies the


Quick Search approach by focusing on shifts 4. Results and Discussion
that maximize the distance between
comparisons. This method attempts to reduce The results of the comparative analysis
the number of unnecessary comparisons, showed that the Colussi algorithm
though it can still suffer from quadratic time consistently outperformed the others in terms
complexity in the worst-case scenario. of accuracy and relevancy, particularly in
scenarios involving complex search queries.
3. Methodology The Two-Way algorithm was noted for its
efficiency in simpler cases, while the Optimal
The research methodology involved Mismatch and Maximal Shift algorithms
implementing the four string matching showed limitations due to their higher time
algorithms in a controlled environment to complexity in certain situations.
compare their performance on various inputs,
including single words, multiple words, and The analysis indicated that while all the
entire files. The performance metrics algorithms have their strengths and
considered were search time, number of weaknesses, the Colussi algorithm's ability to
iterations, and relevancy (accuracy). The minimize unnecessary comparisons and its
algorithms were tested using Java robust handling of complex patterns make it
implementations, and the results were the most suitable for desktop search
applications.
5. Conclusion Algorithm, Journal of Computer Science,
2(1): 82-85, 2006.
The research paper effectively demonstrates
the importance of selecting the appropriate
string matching algorithm based on the
specific needs of the desktop search system.
The Colussi algorithm, with its superior
accuracy and efficiency, stands out as the best
option among those studied. This finding has
significant implications for the development
of more effective desktop search tools and
other related applications.

References:

[1]. Mahmoud Moh’dMhashi , Mohammed


Alwakeel, New Enhanced Exact String,
Searching Algorithm, IJCSNS International
Journal of Computer Science and Network
Security, VOL.10 No.4, April 2010.

[2]. Christian Charras, Thierry Lecroq and


Joseph Daniel, A Very fast string searching
algorithm for small alphabets and long
patterns, Combinational Pattern Matching,
9th Annual Symposium, CPM 98 Piscataway,
New Jersey, USA, 2005.

[3]. R.S. Boyer, J.S. Moore, "A fast string


searching algorithm," Communication of the
ACM, Vol. 20, No. 10, 1977, pp.762– 772..

[4]. Abdulwahab Ali Al-Mazroi and Nur’aini


Abdul Rashid, A Fast Hybrid Algorithm for
the Exact String Matching Problem,
American Journal of Engineering and
Applied Sciences 4 (1): 102-107, 2011.

[5]. Ababneh Mohammad, OqeiliSaleh and


Rawan A Abdeen, Occurrences Algorithm
for String Searching Based on Brute-Force

You might also like