University of Cambridge > Talks.cam > Churchill CompSci Talks > String-matching Algorithms

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

String-matching Algorithms

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

Finding occurrences of a string in a text is a feature present in most of the text editors, web browsers and programming languages. Behind ctrl + F feature in notepad or your favourite IDE , grep command or directory search there is a string-matching algorithm.

In my talk I will show multiple approaches to this problem and take a closer look at some frequently used algorithms and their applications.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lauterpacht Centre for International Law, CB3 9BL Darwin College (Seminar Room, No. 1 Newnham Terrace) Edwards Room, Bragg Building, Cavendish Laboratory, Department of Physics

Other talks

Title to be confirmed Necessary mechanisms for super AI and stopping hallucinations: The consistent reasoning paradox and the indeterminacy function Talk TBC Coming soon TBC Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity