String matching algorithms
Download as PPTX, PDF5 likes2,033 views
The document discusses string matching algorithms, defining strings, string matching, and algorithms in general. It outlines various string matching algorithms like brute force, Karp-Rabin, and Boyer-Moore, as well as their applications in fields such as plagiarism detection and bioinformatics. Additionally, it emphasizes the importance of these algorithms in computer science and other research areas, providing examples of their usage.
String matching algorithms
- 1. STRING MATCHING ALGORITHMS Google images
- 2. OUTLINE ïą What is String? ïą What is String Matching? ïą Definition of Algorithm ïą String Matching Algorithms ïą String Matching Algorithms Applications
- 3. WHAT IS STRING? ïą In computer programming, a string is traditionally a sequence of characters, either as constant or as some kind of variable ïą E.g. ABCABDC or 1Ac35D Google images
- 4. WHAT IS STRING? ïą String may be applied in Bioinformatics to describe DNA strand composed of nitrogenous bases Google images
- 5. WHAT IS STRING MATCHING? ïą String matching is finding occurrence(s) of a pattern string within another string or body of text ïą E.g. We have a string âBCATDOGâ and the pattern to be searched is âCATâ. Now finding âCATâ in the string âBCATDOGâ is string matching
- 6. WHAT IS STRING MATCHING? ïą Uses for the string matching include: ï Finding a text in a document file or in a report ï Used by different search engines like: Google Google images
- 8. DEFINITION OF ALGORITHM ïą Algorithm is formula or set of rules followed for solving a problem. ïą Example: Searching algorithms, sorting algorithms, etc. Google images
- 9. ïą Example: Algorithm for checking a lamp Google images
- 10. STRING MATCHING ALGORITHMS ïą Brute Force Algorithm ïą Karp-Rabin Algorithm ïą Boyer-Moore Algorithm
- 11. BRUTE FORCE ALGORITHM ïą Simplest string matching algorithm ïą Steps: ï Match the first character of the pattern with the first character of the string ï If succeed, try to match the second character, and then third and so on
- 12. BRUTE FORCE ALGORITHM ïą If hit a failure point, slide the pattern over one character and try again ïą When a match is found, return its starting location ïą Example: ïą Given string âBCCATDOGâ ïą Pattern to match is âCATâ
- 13. EXAMPLE
- 14. ALGORITHM FOR EXAMPLE Step1: Match the first character of the pattern with the first character of the string Step3: If hit a failure point, slide the pattern over one character and try again Step2: If succeed, try to match the next character, and so on Step4: When a match is found, return its starting location Starting location for the pattern in the string is â3â
- 15. STRING MATCHING ALGORITHMS APPLICATIONS Besides Computer Science, String matching algorithms have some other applications: ïą Detecting Plagiarism: it is the process of locating instances of plagiarism within a work or document ïą Bioinformatics String algorithms are centrally important in bioinformatics for dealing with sequence information
- 16. CONT. ïą Molecular biology Approximate matching of a search pattern to a target text is a fundamental tool in molecular biology ïą Computer Science Exact string matching is more useful in computer science
- 17. CONT. ïą Text Mining Research: includes information extraction, topic tracking, content summarization, information visualization, question answering, concept linkage, text classification, and text clustering
- 18. Google images
- 19. Google images
- 20. CONTACT ME ïą If you want the resources and further understanding on this topic contact me via my email: ïą [email protected] ïą Copy, cut do anything you want!!