This is an annual satellite workshop of SPIRE mostly focusing on compression, data structures and string processing topics. We invite an abstract for presentation (15-25 minutes) of preferably unpublished work, published results, work in progress, surveys of interest, open problems, etc. Since WCTA has no proceedings, it will not preclude a possibility of submitting presenting results to other conferences or publishing them in journals. WCTA will be free for all attendees.
Freie Universität Berlin
Knut Reinert holds the chair of the Algorithms in Bioinformatics group at the Institute of Bioinformatics at Freie Universität Berlin. In addition, he is a Max Planck fellow at the Max Planck Institute for Molecular Genetics. He and his team focus on the development of novel algorithms and data structures for practical problems arising in the analysis of biomedical mass data and the efficient implementation of the algorithms in software libraries like SeqAn or OpenMS. Previously, Knut did his Phd at the Max-Planck-Institute for Computer Science in the group of Kurt Mehlhorn. After receiving his PhD he joint Gene Myers in the Informatics Research team at Celera Genomics, where he worked on bioinformatics algorithms and software for genome assembly and mass spectrometry. In 2002 he became full professor at the Freie Universtät Berlin and since then graduated numerous PhD and MSc students and coauthored around 100 research papers. He served on numerous PC committees as committe member and (co)chair.
Università degli Studi di Milano
|Friday, 29 September 2017|
|8:45-9:00||Opening and Welcome|
|9:00-09:30||Short tutorialAlistair MoffatANS Compression|
|09:30-09:50||Nieves R. Brisaboa, Travis Gagie, Adrian Gomez-Brandon, and Gonzalo Navarro Two Dimensional Block Trees|
|09:50-10:30||Hayam Alamro, Lorraine A.K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, and Solon P. Pissis Longest Common Prefixes with k-Mismatches & Applications|
|10:50-11:40||Invited TalkSebastiano Vigna (Quasi) Succinct Data Structures and Information Retrieval|
|11:40-12:00||Nicola PrezzaString Attractors|
|12:00-12:20||Sahar Hooshmand and Sharma V. Thankachan Non-overlapping Indexing in External Memory|
|14:00-14:50||Invited TalkKnut Reinert Engineering meets Biomedicine|
|14:50-15:10||Jose Fuentes-Sepulveda and Gonzalo Navarro Space-efficient parallel construction of the Burrows-Wheeler transform|
|15:10-15:30||Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, and Marcin Piatkowski Indexing the Bijective BWT|
|15:50-16:10||Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Leonard, Laurent Mouchard, Elise Prieur-Gaston, and Bruce Watson Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform|
|16:10-16:30||Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda Almost linear time computation of maximal repetitions in run length encoded strings|
Please submit abstracts by emailing copies (preferable PDF) to both WCTA co-chiars (email@example.com, firstname.lastname@example.org).