On molecules, strings, and coins: Some applications of string combinatorics in computational biology.

Supervisor
Dr. Zsuzsanna Lipták - AG Genominformatik, Universitaet Bielefeld, Germany
Date and time
Tuesday, March 15, 2011 at 4:45 PM - 16:45 rinfresco, ore 17:00 inizio seminario
Place
Ca' Vignal - Piramide, Floor 0, Hall Verde
Programme Director
Vincenzo Manca
External reference
Publication date
March 7, 2011
Department
Computer Science  

Summary

In this talk, I will discuss two problems from computational biology: (1) EST (expressed sequence tag) clustering and (2) identification of biomolecular samples from MS (mass spectrometry) data. The two problems above motivate string algorithmic and combinatoric problems such as the correct choice of string distance measure, the Money Changing Problem from number theory, and jumbled pattern matching, a type of non-standard string matching. In each case, I will briefly explain the biological problem setup, its mathematical counterpart, algorithmic solution or solutions, and, where applicable, implementations. 
 
In recent years, many new string problems have been introduced which are motivated by applications from molecular biology, but which are also of independent interest. In turn, string algorithms have often been applied successfully to molecular biology problems. Starting from the problems outlined above, the talk is designed to demonstrate this fruitful connection.
 
The talk should be accessible, at least in parts, both to computer scientists and to biologists.
 
 
 

 






© 2002 - 2021  Verona University
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234