7 ottobre 2010, ore 11.00
Sala seminari del DISCo - viale Sarca 336, Milano
Algorithms for Sequence Finding and Selection Problems
Seminar by Prof. D.T. Lee (Institute of Information Science & Research Center for IT Innovation, Academia Sinica, Taiwan; Fellow of IEEE, Fellow of ACM, Member of Academia Sinica, Member of the Academy of Sciences for the Developing World TWAS).
We consider sequence manipulation problems motivated by problems concerning GC content and GC ratio of DNA sequences in bioinformatics.
In this talk we will present algorithms for solving a few problems related to sequence manipulation, including searching subsequences of maximum density and selecting subsequences of a certain density, of a given rank, with or without length restrictions.
Problem transformation and utilization of efficient data structures or problem-solving methods will be presented. The problem-solving methods are fundamental to computational problems, which arise, for example, in bioinformatics and in geometric computing.
Joint work with Dr. Tien-Ching Lin, Institute of Information Science, Academia Sinica, Taiwan.
Il seminario, aperto a tutti gli interessati, è organizzato dalla Scuola di Dottorato in Informatica e dal laboratorio BIMIB.
Per qualunque informazione è possibile contattare il prof. Marco Antoniotti.