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

String-matching Algorithms

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity