Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- bio:start [26/03/2019 alle 13:47 (7 anni fa)] – Nadia Pisanti
+++ bio:start [07/07/2021 alle 07:30 (4 anni fa)] (versione attuale) – [BIOINFORMATICS] Nadia Pisanti
@@ Linea 1: / Linea 1: @@
-====== BIOINFORMATICS ======
+====== BIOINFORMATICS 2020 ======
-Lecturer: **Nadia Pisanti**
+Lecturer: Prof. **Nadia Pisanti**
 === NEWS ===
-[March 26th] Papers have been assigned! The student Antonio Nuzzo is asked to send an email to prof.Pisanti.
+[February 8th] This page has been created!
-[March 12th] The assignment of papers for the seminar will take place on Monday March 25th.
+===== CLASSES IN COVID-19 TIMES =====
-[March 5th] From now on, in absence of news, lectures will be on Monday's from 14:00 to 15:30 and on Tuesday's from 9:15 to 10:45. Always in room L1.
+**Regular live classes are suspended from March 5th, 2020** \\
+Classes will thus take place [[https://meet.google.com/lookup/d2ubhrxcxh | here]]
-[February 27th] Next week we will have classes on Monday both at 14:00 and at 16:00, and both in room L1.
+Prof. Pisanti makes office hours on skype or meet upon appointment arranged by mail.\\
-[February 12th] The classes of April 8th and April 9th will not take place: we will have to find two slots to catch them up.
-[February 12th] This page has been created!
 === LEARNING GOALS ===
@@ Linea 27: / Linea 25: @@
 //Sequences Alignments//: Dynamic Programming methods for local, global, and semi-local alignments. Computing the Longest Common Subsequences. Multiple Alignments.\\
 //Pattern Matching//: Exact Pattern Matching: algorithms (Knuth-)Morris-Pratt, Boyer-Moore, Karp-Rabin with preprocessing of the pattern. Algorithm with preprocessing of the text: use of indexes.
-//Motifs Extraction//: KMR Algorithm for the extracion of exact motifs and its modifications for the inference of approximate motifs.\\
+//Motifs Extraction//: KMR Algorithm for the extraction of exact motifs and its modifications for the inference of approximate motifs.\\
 //Finding Repetitions//: Algorithms for the inference of long approximate repetitions. Filters for preprocessing. \\
 //Fragment Assembly//: Genomes sequencing: some history, scientific opportunities, and practical problems. Some possible approaches for the problem of assembling sequenced fragments. Link with the "Shortest common superstring" problem, the Greedy solution. Data structures for representing and searching sequencing data.\\
@@ Linea 38: / Linea 36: @@
 === STUDY MATERIAL ===
-SUFFIX TREE {{:magistraleinformatica:alg2:tre.pdf|}} \\
+SEQUENCES ALIGNMENTS {{:bio:allineamenti.pdf| Alignments}}\\
-PATTERN MATCHING {{:biotecnologie:informatica:patternmatching1.pdf}} e {{:biotecnologie:informatica:patternmatching2.pdf}} \\
+PATTERN MATCHING {{:biotecnologie:informatica:patternmatching1.pdf | ExactPatternMatching}} e {{:biotecnologie:informatica:patternmatching2.pdf | KnuthMorrisPratt&BoyerMoore}} {{:bio:kr87.pdf| KarpRabin87}} \\
-FRAGMENT ASSEMBLY {{:bio:fragmentassembly.pdf|}}\\
+SUFFIX TREE {{:magistraleinformatica:alg2:tre.pdf| SuffixTrees }} \\
-SEQUENCES ALIGNMENTS {{:bio:allineamenti.pdf|}}\\
+EXACT MOTIFS EXTRACTION  {{:bio:KarpMillerRosenberg.pdf| KarpMillerRosenberg}} \\
-FINDING REPETITIONS: FILTERING {{:bio:amb.pdf|}}\\
+APPROXIMATE MOTIFS EXTRACTION {{:bio:kmrc.pdf| KMRC}} {{:bio:Speller.pdf| Speller}} {{:bio:structured_motifs.pdf| StructuredMotifs}} \\
-NEW GENERATION SEQUENCING {{:bio:illumina-assembly.pdf|}}\\
+FINDING REPETITIONS: FILTERING {{:bio:amb.pdf| TUIUIU}}\\
-OVERVIEW OF SEQUENCING TECNOLOGIES {{:bio:en104-pisanti.pdf}}\\
+FRAGMENT ASSEMBLY {{:bio:fragmentassembly.pdf| FragmentAssembly}}\\
-BUBBLES IN DE BRUIJN GRAPHS (slides) {{bio:Seminar-Bubbles.pdf}}\\
+NEW GENERATION SEQUENCING {{:bio:illumina-assembly.pdf| NewGenerationSequencing}}\\
+OVERVIEW OF SEQUENCING TECNOLOGIES {{:bio:en104-pisanti.pdf | SequencingTechnologies}}\\
+HAPLOTYPE ASSEMBLY {{:bio:jcbwhatshap.pdf | WhatsHap }}\\
+BUBBLES IN DE BRUIJN GRAPHS (slides) {{bio:Seminar-Bubbles.pdf | Bubbles }}\\
 == EXAM ASSIGNMENT ==
-Each student is assigned a paper that is a very recent scientific work on topics related to those of the course (tipically it is a paper accepted for publication in the proceedings of an international conference that is going to be held in a few weeks/months). The paper is part of a pool of possible papers selected by the lecturer. The paper assignment follows a brief description of all papers in the pool made by the lecturer, and a bidding phase of the students over such papers.
+Each student will have to undergo an oral exam over the topics of the classes.
+Moreover, each student is assigned a paper that is a very recent scientific work on topics related to those of the course (tipically it is a paper accepted for publication in the proceedings of an international conference that is going to be held in a few weeks/months). The paper is part of a pool of possible papers selected by the lecturer. The paper assignment follows a brief description of all papers in the pool made by the lecturer, and a bidding phase of the students over such papers.
 Once the student has his/her paper assigned, the task is to prepare and make a presentation of that work that:
 (1) describes the results presented in that paper, (2) is suited for the actual audience (that will be the course class) as for comprehension opportunity, (3) sticks to the allowed time slot.
@@ Linea 57: / Linea 59: @@
 === SEMINARS SCHEDULE ===
-TBD
+TBA
 === "REGISTRO DELLE LEZIONI" ===
-     * [[https://unimap.unipi.it/registri/dettregistriNEW.php?re=3290064::::&ri=80312|REGISTRO DELLE LEZIONI]]
+[[https://unimap.unipi.it/registri/dettregistriNEW.php?re=3314294::::&ri=80312|REGISTRO DELLE LEZIONI]]
+===== WHITEBOARDS AND RECORDING OF LECTURES and MATERIAL =====
+^ Lecture Date ^ Topic ^ Material ^
+| dd/mm/aaaa | bla bla | links and files |