BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/221
DTSTAMP:20230914T125915Z
SUMMARY:Lookup Tables\, Suffix Trees and Suffix Arrays (Part-II)
DESCRIPTION:Speaker: \n\nAbstract: \nConsidering the large volume of sequen
 ce data that many computational biology applications must deal with\, prop
 er organization of the data to facilitate fast access is important to achi
 eve desirable run-times. From this perspective\, string data structures se
 rve the same purpose for biological sequence data as binary search trees s
 erve for ordered numeric data\, and quadtrees serve for spatial data.\n\nS
 tring data structures are ideal for uncovering exact matching patterns in 
 sequences. They are also useful when performing approximate matches where 
 only a small number of differences are permitted.\n\nWe will try to provid
 e a detailed introduction to the three most frequently used string data st
 ructures in computational molecular biology — lookup tables\, suffix tre
 es and suffix arrays. The focus will be on algorithms for constructing the
 se data structures. We will also explore the relationships between these d
 ata structures and provide several illustrations of biological application
 s where suffix trees play a central role.\n\nReferences:\n\nhttp://en.wiki
 pedia.org/wiki/Suffix_tree\nhttp://en.wikipedia.org/wiki/Suffix_array\n
URL:https://www.tcs.tifr.res.in/web/events/221
DTSTART;TZID=Asia/Kolkata:20111024T160000
DTEND;TZID=Asia/Kolkata:20111024T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR