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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

SCAMPS 09 - One day Symposium Special Departmental Seminars UCL based talks series

Other talks

Mediatek: 5G – Life beyond the Smartphone Urban tunneling - the challenges of creating underground space in historic cities A V Hill Lecture - Kings and Queens of the Mountain: Studies of Extreme Physiology in Himalayan Sherpas Lovász' Theorem and Comonads in Finite Model Theory The African killifish: a vertebrate model to understand aging and ‘suspended animation' A Modern View of Quasars in the LSST Era
 

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