DataHour: Indeterminate String Matching

DataHour Recording

Find the resources used in the DataHour HERE.

About the DataHour:

Indeterminate String Matching, though sounds simple, but has applications in very complex applications. The broad spectrum of applications include the areas of Document Similarity, Information Security, Document Matching, Bioinformatics (DNA sequence matching), Pattern Recognition etc.

In the session, speaker will cover various algorithms of indeterminate string matching with sample code, tips and tricks such as:

• Rabin-Karp String Matching
• Boyer Moore's String Matching
• Knuth-Morris-Pratt (KMP) String Matching
• The Levenshtein Distance Algorithm

Prerequisites: For Hands-on Python and any IDE preferably Visual Studio Code is needed to be installed.

Who is this DataHour for?

• Students & Freshers who want to build a career in the Tech domain.
• Working professionals who want to transition to the Tech domain.

Speaker:

Munmun Das

Principal – Automation and Innovation at Accenture

Munmun is a professional and research scholar with 16 + years of experience in Software Project Management, Product development, Product strategy, and delivery of large-scale, complex automation/transformation solutions, web and mobile applications. She has also mentored industry tech-force as an Industry Speaker, Corporate Mentor, and Guest Lecturer. 

She has implemented handshaking projects on RPA with Dot Net web applications and successfully built on-demand RPA. 

Connect with Munmun on Linkedin, Facebook and Instagram.