Program

Sunday 4.1: Arrival to the Dead Sea


20:00 Welcome cocktails

Monday 5.1: Dead Sea


09:00 – 10:30 Session 1
 09:00 – 09:30 Olga Troyanskaya, Algorithms for functional genomic data.
 09:30 – 10:00 Gene Myers, The Resurrection of de novo DNA Sequencing.
 10:00 – 10:30 Jeanette Schmidt, The Cancer Genome: Copy number variation and somatic mutations.
10:30 – 11:00 Coffee Break
11:00 – 12:30 Session 2
 11:00 – 11:30 Gary Benson, Bit Parallel Sequence Alignment Algorithms.
 11:30 – 12:00 Rolf Backofen, What is the distance between motifs in RNA?
 12:00 – 12:30 Dan Gusfield, Simpler RNA Folding in Sub-Cubic Time.
12:30 – 14:00 Lunch Break
14:00 – 15:30 Session 3
 14:00 – 14:30 Ron Shamir, Shortest double-stranded DNA sequences covering all k-mers.
 14:30 – 15:00 Steven Skiena, Optimizing the Design of Coding Sequences.
 15:00 – 15:30 Laxmi Parida, Combinatorics to Score Gene Clusters.
15:30 – 16:00 Coffee Break
16:00 – 17:30 Session 4
 16:00 – 16:30 Gregory Kucherov, Cascading Bloom filters for bioinformatics applications.
 16:30 – 17:00 Mikhail Roytberg, (Almost) Reliable regions in (relatively) unreliable protein multiple alignments.
 17:00 – 17:30 Ilan Ben Bassat, String Graph Construction Using Incremental Hashing.

Tuesday 6.1: Dead Sea


09:00 – 10:30 Session 1
 09:00 – 09:30 Maxime Crochemore, Fewer runs than word length.
 09:30 – 10:00 Rajeev Raman, How to Encode a Data Structure Succinctly.
 10:00 – 10:30 Kunsoo Park, Finding Feasible Polytope in Interval Disaggregation.
10:30 – 11:00 Coffee Break
11:00 – 12 :30 Session 2
 11:00 – 11:30 Baruch M. Schieber, The Euclidean k-Supplier Problem.
 11:30 – 12:00 Moshe Lewenstein, Histogram Indexing via Additive Combinatorics.
 12:00 – 12:30 Raphael Clifford, Element Distinctness, Moments, and Sliding Windows.
12:30 – 14:00 Lunch Break
14:00 – 15:30 Session 3
 14:00 – 14:30 Barak Navon, The Parameterized Critical Node Cut Problem.
 14:30 – 15:00 Pawel Gawrychowski, Tight tradeoffs for approximating palindromes in streams.
 15:00 – 15:30 Christian Komusiewicz, Research Challenges in Multivariate Algorithmics for NP-hard String Problems.
15:30 – 16:00 Coffee Break
16:00 – 17:00 Session 4
 16:00 – 16:30 Alberto Apostolico, Sequence comparison based on composition of substrings with mismatches.
 16:30 – 17:00 Philip Bille, Longest Common Extensions in Trees.

Wednesday 7.1: Day trip and travel to Haifa


11:00 Day trip
19:30 Dinner (Pine Club Haifa)

Thursday 8.1: Haifa


09:00 – 10:00 Amir Amihood, Gadi - Till 120
10:00 – 10:30 Coffee Break
10:30 – 12:00 Session 1
 10:30 – 11:00 Liat Rozenberg, Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
 11:00 – 11:30 Mika Amit, Period Recovery over the Hamming and Edit Distance.
 11:30 – 12:00 Shir Landau Feibish, Sampling and Large Flow Detection in SDN.
12:00 – 13:30 Lunch Break
13:30 – 15:00 Session 2
 13:30 – 14:30 Zvi Galil, Georgia Tech's New Online MOOC Based Master Program.
 14:30 – 15:00 Shiri Dori-Hacohen, Automated Controversy Detection on the Web.
15:00 – 16:00 Toast