Development Cycles
  Home arrow Development Cycles arrow Page 4 - More Pattern Matching Algorithms: B-M
Dev Articles Forums 
ADO.NET  
Apache  
ASP  
ASP.NET  
C#  
C++  
ColdFusion  
COM/COM+  
Delphi-Kylix  
Design Usability  
Development Cycles  
DHTML  
Embedded Tools  
Flash  
Graphic Design  
HTML  
IIS  
Interviews  
Java  
JavaScript  
MySQL  
Oracle  
Photoshop  
PHP  
Reviews  
Ruby-on-Rails  
SQL  
SQL Server  
Style Sheets  
VB.Net  
Visual Basic  
Web Authoring  
Web Services  
Web Standards  
XML  
Mobile Linux 
App Generation ROI 
IBM® developerWorks 
Weekly Newsletter
 
Developer Updates  
Free Website Content 
 RSS  Articles
 RSS  Forums
 RSS  All Feeds
Write For Us Get Paid 
Request Media Kit
Contact Us 
Site Map 
Privacy Policy 
Support 
 USERNAME
 
 PASSWORD
 
 
  >>> SIGN UP!  
  Lost Password? 
DEVELOPMENT CYCLES

More Pattern Matching Algorithms: B-M
By: Barzan "Tony" Antal
  • Search For More Articles!
  • Disclaimer
  • Author Terms
  • Rating: 5 stars5 stars5 stars5 stars5 stars / 3
    2008-08-05

    Table of Contents:
  • More Pattern Matching Algorithms: B-M
  • The Theory
  • Implementation
  • Final Words

  • Rate this Article: Poor Best 
      ADD THIS ARTICLE TO:
      Del.ici.ous Digg
      Blink Simpy
      Google Spurl
      Y! MyWeb Furl
    Email Me Similar Content When Posted
    Add Developer Shed Article Feed To Your Site
    Email Article To Friend
    Print Version Of Article
    PDF Version Of Article
     
     
    ADVERTISEMENT


    More Pattern Matching Algorithms: B-M - Final Words


    (Page 4 of 4 )

    We’ve come to the end of this article. Throughout this tutorial we have presented the Boyer-Moore pattern matching algorithm. It is one of the best and is currently considered a standard for benchmarking string searching applications. It is one of those underlying concepts that is widely implemented in our everyday lives, starting from find functions in word processors up to PHP applications, such as in Wikipedia.

    As always, we can’t leave the creation of an application without presenting some real-world proof that can serve as an example of its execution. Check out the attached screenshot below. The source string is: assdbwfaswasdfbbsswasdfbwasdfbbs. The pattern is: asdfbbs. There are two matches: on positions 10 and 15. Enjoy!

    Here is your chance to download the entire source code of this algorithm, if you had problems trying to implement and make use of the presented code snippets. Feel free to download and play around with it.

    Now I’d like to invite you to join our ever-growing and friendly community at Dev Hardware Forums. We are specializing in computer hardware, software, and consumer electronics. Also, don’t forget to check out the communities at our sister sites. Whatever problems you may face, we’ll do our best to help.

    As a final note, please glance over to the following list of references. All of the following authors have contributed much to computer science. I’m wholeheartedly advocating their work as a valid source of reference.

    References:

    Þ       BOYER R.S., MOORE J.S., 1977, A fast string searching algorithm.

    Þ       CHRISTIAN CHARRAS, THIERRY LECROQ, Handbook of Exact String-Matching Algorithms

    Þ       R. NIGEL HORSPOOL, 1980, Practical Fast Searching in Strings.

    Þ       Boyer-Moore Algorithm (implementation, description, visualization), Institut d'électronique et d'informatique Gaspard-Monge, C. CHARRAS and T. LECROQ.


    DISCLAIMER: The content provided in this article is not warranted or guaranteed by Developer Shed, Inc. The content provided is intended for entertainment and/or educational purposes in order to introduce to the reader key ideas, concepts, and/or product reviews. As such it is incumbent upon the reader to employ real-world tactics for security and implementation of best practices. We are not liable for any negative consequences that may result from implementing any information covered in our articles or tutorials. If this is a hardware review, it is not recommended to open and/or modify your hardware.

     

    DEVELOPMENT CYCLES ARTICLES

    - Division of Large Numbers
    - Branch and Bound Algorithm Technique
    - Dynamic Programming Algorithm Technique
    - Genetic Algorithm Techniques
    - Greedy Strategy as an Algorithm Technique
    - Divide and Conquer Algorithm Technique
    - The Backtracking Algorithm Technique
    - More Pattern Matching Algorithms: B-M
    - Pattern Matching Algorithms Demystified: KMP
    - Coding Standards
    - A Peek into the Future: Transactional Memory
    - Learning About the Graph Construct using Gam...
    - Learning About the Graph Construct using Gam...
    - Learning About the Graph Construct using Gam...
    - How to Strike a Match







    © 2003-2009 by Developer Shed. All rights reserved. DS Cluster 5 Hosted by Hostway
    Stay green...Green IT