bio:start
Differenze
Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.
Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedenteProssima revisioneEntrambe le parti successive la revisione | ||
bio:start [10/05/2018 alle 09:16 (6 anni fa)] – Nadia Pisanti | bio:start [07/05/2019 alle 09:54 (5 anni fa)] – Nadia Pisanti | ||
---|---|---|---|
Linea 1: | Linea 1: | ||
+ | ====== BIOINFORMATICS ====== | ||
Lecturer: **Nadia Pisanti** | Lecturer: **Nadia Pisanti** | ||
Linea 4: | Linea 5: | ||
=== NEWS === | === NEWS === | ||
- | [May 10th] The seminar' | + | [April 30th] Please be aware that there will be no class on Monday, May 27th due to University cancelling all lectures on that day to allow students to go home and vote for EU elections. |
- | [May 3rd] The lecture of Monday | + | [April 15th] As communicated in the class, on Monday |
- | [April | + | [April |
- | [March | + | [March |
- | [March | + | [March |
- | [February 27th] On Monday | + | [March 5th] From now on, in absence of news, lectures |
- | [February | + | [February |
- | [February | + | [February |
+ | |||
+ | [February 12th] This page has been created! | ||
=== LEARNING GOALS === | === LEARNING GOALS === | ||
Linea 55: | Linea 58: | ||
Once the student has his/her paper assigned, the task is to prepare and make a presentation of that work that: | 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, | (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, | ||
- | |||
- | The list of papers suggested for this year are here: {{: | ||
Students presentations usually take place all together somewhen at the end of the course. Exceptions are possible upon request for specific needs. Once the course is over, students can undergo the examination anytime during the academic year by agreeing an appointment: | Students presentations usually take place all together somewhen at the end of the course. Exceptions are possible upon request for specific needs. Once the course is over, students can undergo the examination anytime during the academic year by agreeing an appointment: | ||
Linea 62: | Linea 63: | ||
=== SEMINARS SCHEDULE === | === SEMINARS SCHEDULE === | ||
- | - Monday | + | **MONDAY |
- | # MICHAL PUNCOCHAR - Fixed-Parameter Tractable Sampling for RNA Design with Multiple Target Structures\\ | + | Marco Cardia: MALVA: genotyping |
- | # IVAN GRUJIC - Designing RNA Secondary Structures is Hard\\ | + | Luca Corbucci: Haplotype-aware graph indexes.\\ |
- | # FEDERICO LAZZARI - Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers\\ | + | Nicolas Manini: Efficient computation of Sequence Mappability.\\ |
- | # NICOLA FERRONE - Modeling Biological Problems in Computer Science: A Case Study in Genome Assembly\\ | + | Andre' Santos: GenMap: Fast and Exact Computation |
- | + | ||
- | - Tuesday May 22nd, from 9:15 to 11, room L1:\\ | + | |
- | # RUGGIERO DI BENEDETTO - Longest substring palindrome after edit\\ | + | |
- | # GIULIA PUNZI - Nearest constrained circular words\\ | + | |
- | # SILVIA STRANIERI - Order-Preserving Pattern Matching Indeterminate Strings\\ | + | |
- | # FRANCESCO LANDOLFI - Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis\\ | + | |
- | + | ||
- | - Wednesday May 23rd, from 16:00 to 17:45, Sala Seminari Ovest:\\ | + | |
- | # AYTAN YAGUBLU - AllSome Sequence Bloom Trees\\ | + | |
- | # FRANCESCA NARETTO - Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index\\ | + | |
- | # LAPO TOLONI - Analysis of genomic rearrangements | + | |
- | # MADDALENA AMENDOLA - DISCOSNP++: de novo detection of small variant from raw unassembled read set(s)\\ | + | |
- | + | ||
- | - Thursday May 24th, from 16:00 to 17:45, Sala Seminari Ovest:\\ | + | |
- | # LEONARDO CARIAGGI | + | |
- | # DAVIDE RUCCI - Dynamic Programming on DAGs: Co-Linear Chaining Extended\\ | + | |
- | # GIANMARCO RICCIARELLI - Circular Networks from Distorted Metrics\\ | + | |
- | # ANTONIO SISBARRA - Algorithms for Computing the Family-Free Genomic Similarity under DCJ \\ | + | |
- | + | ||
- | - Monday May 28st, from 14 to 15:30, room L1:\\ | + | |
- | # GEMMA MARTINI - Assembly of Long Error-Prone Reads and Repeat Classification\\ | + | |
- | # MICHELE MICCINESI - Optimal Omnitig Listing for Safe and Complete Contig Assembly\\ | + | |
- | # VLAD PANDELEA - Full-length de novo viral quasispecies assembly through variation graph construction\\ | + | |
- | # CARMINE CASERIO - De novo assembly | + | |
- | # FRANCESCO CARIAGGI - A graph-based approach to diploid genome assembly\\ | + | |
- | - Tuesday | + | **TUESDAY |
- | # GASPARE FERRARO - TwoPaCo: an efficient algorithm to build the compacted | + | Shadi Shajari: Simulating the DNA String Graph in Succint Space.\\ |
- | # SIMONE SCHIRINZI | + | Antonio Nuzzo: Indexing |
- | # JOHANNES BUSCH - Efficient Algorithms | + | Riccardo Manetti: An Efficient, Scalable and Exact representation of High-Dimensional Color Information via de Bruijn Graph Search.\\ |
- | # GIULIANO CORNACCHIA - Long Reads Enable Accurate Estimates Of Complexity Of Metagenomes\\ | + | Pouria Faraji: Parallel decompression of gzip-compressed files and random access |
+ | **TUESDAY May 28th** | ||
+ | Tabriz Hajiyev: Faster queries for longest substring palindrome after block edit.\\ | ||
+ | Newsha Ozgoli: Safe and Complete algorithms for dynamin programming problems, with an application to RNA folding.\\ | ||
+ | Federico Finocchio: CONSENT - Scalable Self-Correction of long reads with multiple sequence alignment.\\ | ||
+ | Paolo Contenti: Efficient Construction of a Complete Index for Pan-Genomics Read Alignments. | ||
=== " | === " | ||
- | * [[http:// | + | * [[https:// |
bio/start.txt · Ultima modifica: 07/07/2021 alle 07:30 (3 anni fa) da Nadia Pisanti