====== Genome Informatics Research Seminar ======
\\ 


| 392188 |Feijão / Stoye | Winter 2013/14 | Thursday 16-18 in U10-146 | [[https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=37774775|ekvv]] |

===== Course Description =====
In this seminar, current topics of the Genome Informatics research group are presented. 

(In dieser Veranstaltung wird in Vorträgen über aktuelle Themen aus der Forschung der Arbeitsgruppe Genominformatik berichtet.) 



===== Schedule =====

|  **Date** | **Topic**  | **Name** |
| 10.10.2013 | Organization of the seminar | Pedro Feijao / Jens Stoye |
| 10.10.2013 | On the Inversion-indel Distance | Eyla Willing |
| 17.10.2013 | (Recomb-cg 2013) | ---  |
| 24.10.2013 | Recent Results in Computational Metabolomics  | Nils Hoffmann |
| 31.10.2013 | --- | --- |
| 07.11.2013 | --- | --- |
| 14.11.2013 | Restricted DCJ-Indel Model Revisited | Jens Stoye  |
| 21.11.2013 | Next Generation Immunomics Spectratyping | Pina Krell |
| 28.11.2013 | (DiDy Retreat)   | --- |
| 05.12.2013 | (Bielefeld blowing away) | --- |
| 12.12.2013 | (Jens away)  | --- |
| 19.12.2013 | BBH-LS enhanced, An algorithm for computing positional homologs | Omar Castillo |
| **07.01.2014\\16 c.t.** | Genomic profiling of cancer: From high-throughput sequencing to functional annotation of rearrangements | Tanja Drüke |
| 09.01.2014 | (Henner sick) | --- |
| 16.01.2014 | Power strings and their synonyms  | Katharina Jahn  and Daniel Dörr |
| 23.01.2014 | DCJ Family-Free | J Stoye, M Braga, P Feijao, F Martinez |
| 30.01.2014 | Biological data integration by using a flexible data warehouse -- Andrea. \\ The Vesicle Builder: a plug-in for the generation of vesicle models -- Beatrice | Andrea Biolo / Beatrice Giuliari |
| 06.02.2014 | News about THE challenge | Guillaume Holley |
| later | Num[i,j] Revisited - Efficient data representation by interlinked trees | Henner Sudek |
| later | t.b.a. | Annelyse Thévenin |

===== Abstracts: =====
**Num[i,j] Revisited - Efficient data representation by interlinked trees**\\ //Henner Sudek// 

In recent years a data structure called Num[i,j] which contains the number of  different characters that occur in the substring S[i,j] of a string S has been  used in several applications. However the naive way to implement this data  structure uses quadratic space. We will first show how to reduce the space by  using a succinct data structure for answering a partial sum query on a bit- vector. Then we will show how to get to near linear space using interlinked  trees. 

Back to [[:teaching|Teaching]]