Student presentations on 3rd March

The tentative plan of the presentations to be held in E: 2405 is as follows:

• 1.15 p.m. - 1.29 p.m., "The pairwise aligment for similar strings", Sung Won Park.
• 1.30 p.m. - 1.49 p.m., "The String Edit Distance Matching Problem With Moves", Ehsan Bonhendi and Berkar Zedickows.
• 1.50 p.m. - 2.09 p.m., "Faster algorithm for the set variant of the string barcoding problem", Gudmundur Hreidarsson and Cenny Werner.
• 2.10 p.m. - 2.29 p.m., "A note on shortest superstring with flipping", Haseeb Baluch and Hanna Mikhazlava.
• 2.30 p.m - 2.49 p.m., "Partial Digest", Roubesh Yajnish Jhumun and John Kiriungi.
• 2.50 p.m - 3.09 p.m., "The LCA Problem Revisited", Antoniadis Antonios and Rasmus B. Arnling.
• 3.10 p.m. - 3.39 p.m., "Cluster-C, an algorithm for the large-scale clustering of protein...", Viswanathan Bhojan and Paul Stapleton.
• 3.40 p.m. - 3.59 p.m., "Transforming Men into Mice", Ahren Langschmidt and Isen Beqiri
• 4 p.m. - 4.19 p.m., "Fast Protein Folding in ...", Sebastian Clausel and Zambon Davide.
• 4.20 p.m. - 4.34 p.m., "?", ?.