Important Dates<\/h3>\n\n\n\n- Paper submission deadline: May 18, 2022<\/strong> using EasyChair<\/a> (closed)<\/li>
- Notification: June 14, 2022<\/strong> (notifications went out on June 13)<\/li>
- Accepted papers final versions: June 24, 2022<\/strong> (received, closed)<\/li>
- LIPIcs receives edited files: June 28, 2022<\/li>
- Proceedings published: September 5, 2022<\/strong><\/li>
- Conference: September 5-9, 2022, in Potsdam, Germany<\/strong>
- Mon 5, Tue 6, Wed 7 (till noon): WABI main conference (with LIPIcs proceedings)<\/li>
- Wed 7 (from noon), Thu 8, Fri 9 (till noon): Computational Pangenomics workshop (without proceedings)<\/li><\/ul><\/li><\/ul>\n\n\n\n
Invited ALGO Keynote Speaker for WABI (Wednesday 11:30, before lunch)<\/h3>\n\n\n\n![\"Photo](\"https:\/\/algo2022.eu\/wp-content\/uploads\/2022\/05\/salmela.jpg\")
Leena Salmela<\/strong>
University of Helsinki
Academy of Finland Research Fellow<\/figcaption><\/figure>\n<\/div>\n\n\nDr. Leena Salmela<\/strong> is a university lecturer in the Department of Computer Science at the University of Helsinki. Dr. Salmela received her D.Sc.(Tech) degree in computer science at Helsinki University of Technology, Finland, in 2009, where her researched focus was in string algorithms. Dr. Salmela’s current research interests include genome assembly algorithms, de Bruijn graphs, and other algorithms for sequencing data. Software developed by her, such as the sequencing error correction program LoRDEC, has been used in numerous biological studies.<\/p>\n\n\n\n“Efficient solutions to biological problems using de Bruijn graphs<\/strong>“<\/p>\n\n\n\nA de Bruijn graph represents a set of sequencing reads by the k-mers, i.e. substrings of length k, occurring in the reads. In the node centric de Bruijn graph, the set of k-mers are the nodes of the de Bruijn graph and an edge is added between two nodes if they share an overlap of k-1 characters. This representation condenses the information in a large read set into compact space thus allowing efficient solutions to many problems in computational biology. Such problems include for example correction of sequencing errors and genome assembly. Because each position of a genome is sequenced several times, it is possible to correct sequencing errors in reads if we can identify data originating from the same genomic region. A de Bruijn graph can be used to represent compactly the reliable information and the individual reads can be corrected by aligning them to the graph. Genome assembly is a classic problem, which can be solved for example with de Bruijn graphs. The task is to reconstruct the underlying genome based on sequencing reads. In genome assembly the choice of k is a crucial matter. A small k can result in a tangled graph, whereas a too large k will fragment the graph. Furthermore, a different value of k may be optimal for different parts of the genome. Variable order de Bruijn graphs, which represent de Bruijn graphs of all orders k in a single data structure, have been proposed as a solution. We give the first definition of assembled sequences, i.e. contigs, on such graphs and an algorithm for enumerating them.<\/p>\n\n\n\n
Schedule<\/h3>\n\n\n\n
NOTES:<\/strong> <\/strong><\/mark>
– FFP2 or medical masks are required inside buildings on campus<\/strong> unless you are giving a talk.<\/mark>
– Last-minute schedule changes will be marked in purple.<\/mark>
– Please make sure to upload your PDF\/PPTX to the presentation laptop BEFORE the session starts.
– Please use the cursor instead of the laser pointer, so online participants can see what you are pointing at.
– Please stand away from the speakers so we do not get an audio feedback loop.<\/p>\n\n\n\nMONDAY Sept 05<\/strong> (WABI in HS3)<\/h4>\n\n\n\nbefore 09:50: registration, badge pick-up, chat.
09:50 – 10:05: coffee break
SESSION 1: k-mer sets<\/strong> (Chair: Nadia Pisanti)
10:05 – 10:10: Short welcome message by PC Chairs<\/strong>
10:10 – 10:30: Yoshihiko Suzuki and Gene Myers. Accurate K-mer Classification Using Read Profiles (ZOOM)
10:30 – 10:50: Jens Zentgraf and Sven Rahmann. Fast gapped k-mer counting with subdivided multi-way bucketed Cuckoo hash tables (We apologize for the streaming problems. A separate video recording will be made available to online participants soon!)<\/mark>
10:50 – 11:10: Sebastian Schmidt and Jarno Alanko. Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time (ZOOM)
11:10 – 11:30: coffee break
11:30 – 12:30: ESA KEYNOTE<\/strong> (Saket Saurabh, plenary in HS1)
12:30 – 14:00 lunch
SESSION 2 Succinct Data Structures<\/strong> (Chair: Travis Gagie)
14:00 – 14:20: Zsuzsanna Liptak, Francesco Masillo and Simon J. Puglisi. Suffix sorting via matching statistics
14:20 – 14:40: Giulio Ermanno Pibiri. On Weighted K-Mer Dictionaries
14:40 – 15:00: Adri\u00e1n Goga and Andrej Bal\u00e1\u017e. Prefix-free parsing for building large tunnelled Wheeler graphs<\/mark> (moved here from Tuesday BWT session)<\/mark>
15:00 – 15:20: coffee break
SESSION 3 Genome distance and rearrangement<\/strong> (Chair: Daniel Doerr)
15:20 – 15:40: Pijus Simonaitis and Benjamin J. Raphael. A maximum parsimony principle for multichromosomal complex genome rearrangements
15:40 – 16:00: Marilia Braga, Leonie Brockmann, Katharina Klerx and Jens Stoye. A linear time algorithm for an extended version of the breakpoint double distance
16:00 – 16:20: Diego P. Rubert and Marilia Braga. Gene orthology inference via large-scale rearrangements for partially assembled genomes
16:20 – 16:40: coffee break
16:40 – 17:40: WABI Business meeting:<\/strong> Information about WABI 2022; changes in the Steering Committee; future plans for WABI
17:40 – later: ALGO RECEPTION<\/p>\n\n\n\n
\n\n\n\nTUESDAY Sept 06 (WABI in HS 3)<\/h4>\n\n\n\n
SESSION 4: BWT-like data structures<\/strong> (Chair: Jarno Alanko)
08:50 – 09:10: Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone and Lorenzo Tattini. phyBWT: Alignment-free phylogeny via eBWT positional clustering
09:10 – 09:30: Taher Mun, Naga Sai Kavya Vaddadi and Ben Langmead. Pangenomic genotyping with the marker array<\/mark> (moved here from Monday’s Succinct Data Structures session)<\/mark>
09:30 – 09:50: Ahsan Sanaullah, Degui Zhi and Shaojie Zhang. Haplotype Threading Using the Positional Burrows-Wheeler Transform
09:50 – 10:10: coffee break
SESSION 5<\/strong> (Chair: Thomas Vinar)
10:10 – 10:30: Alitzel L\u00f3pez S\u00e1nchez and Manuel Lafond. Predicting Horizontal Gene Transfers with Perfect Transfer Networks
10:30 – 10:50: Konstantinn Bonnet, Tobias Marschall and Daniel Doerr. Constructing founder sets under allelic and non-allelic homologous recombination
10:50 – 11:10: Wei Wei and David Koslicki. WGSUniFrac: Applying UniFrac metric to Whole Genome Shotgun data (ZOOM)
11:10 – 11:30: coffee break
11:30 – 12:30: ESA KEYNOTE<\/strong> (Simon Puglisi, plenary in HS1)
12:30 – 14:00: lunch (and lunch meeting for Steering Committee only)
SESSION 6: Phylogenetics++<\/strong> (Chair: Christina Boucher)
14:00 – 14:20: Mathieu Gascon and Nadia El-Mabrouk. Non-binary Tree Reconciliation with Endosymbiotic Gene Transfer
14:20 – 14:40: Baqiao Liu and Tandy Warnow. Fast and Accurate Species Trees from Weighted Internode Distances (ZOOM)
14:40 – 15:00: Giulia Bernardini, Leo van Iersel, Esther Julien and Leen Stougie. Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning
15:00 – 15:20: coffee break
SESSION 7<\/strong> (Chair: Erin Molloy)
15:20 – 15:40: Eden Ozery, Meirav Zehavi and Michal Ziv-Ukelson. Algorithms for Structure Informed Genome Rearrangement
15:40 – 16:00: Daniel Gibney, Sharma V. Thankachan and Srinivas Aluru. Feasibility of Flow Decomposition with Subpath Constraints in Linear Time (ZOOM)
16:00-16:40: coffee break
16:40 – 17:25: ALGO Memorial lecture<\/strong> about Rolf Niedermeier, Gerhard Woeginger, Camil Demetrescu
17:25 – late: ALGO conference dinner<\/strong> (with short walk; ticket required)<\/p>\n\n\n\n
\n\n\n\nWEDNESDAY Sept 07 (WABI in L-E.03 — note the different building\/room!)<\/mark><\/h4>\n\n\n\nSESSION 8<\/strong> (Chair: Christina Boucher)
08:50 – 09:10: Cl\u00e9ment Agret, Bastien Cazaux and Antoine Limasset. Toward optimal fingerprint indexing for large scale genomics
09:10 – 09:30: Yoshihiro Shibuya, Djamal Belazzougui and Gregory Kucherov. Efficient reconciliation of genomic datasets of high similarity
09:30 – 09:50: Ke Chen and Mingfu Shao. Locality-sensitive bucketing functions
09:50 – 10:10: coffee break (note that the Wednesday morning session is on a different part of the campus. Access to the catering\/coffee will take a longer walk. It may not be possible to spend much time at the coffee if you want to walk and be back on time. The OC will see if we can get some coffee at L-E.03 as well.)
SESSION 9 and AWARD<\/strong> (Chair: Sven Rahmann)
10:10 – 10:30: Bertrand Marchand, Sebastian Will, Sarah Berkemer, Laurent Bulteau and Yann Ponty. Fully-automated design of dynamic programming schemes for RNA folding with pseudoknots
10:30 – 11:10: WABI Best paper award
11:10 – 11:30: coffee break
11:30 – 12:30: WABI KEYNOTE<\/strong> by Leena Salmela: Efficient solutions to biological problems using de Bruijn graphs (plenary in HS1; chairs: Christina Boucher and Sven Rahmann)
12:30 – 14:00 lunch<\/p>\n\n\n\n14:00 – Friday noon:
WABI Pangenomics workshops by EU Projects PANGAIA and ALPACA<\/strong> (in H-2.57 — again different!)<\/mark><\/strong><\/p>\n\n\n\nZoom link for the public lectures: https:\/\/uni-bielefeld.zoom.us\/j\/61746700409?pwd=RnI3ZGdad2FqR2pLNWx5RS9kSjBxdz09<\/a><\/strong><\/mark><\/p>\n\n\n\n14:00 – 15:00: Knut Reinert: Hierarchical Interleaved Bloom Filter: Enabling ultrafast, approximate sequence queries, and ALPACA business meeting (Alexander Sch\u00f6nhuth)
15:00 – 15:20: coffee break
15:20 – 16:20: PANGAIA network meeting, part I (Paola Bonizzoni)
16:20 – 16:30: coffee break
16:30 – 21:30: Social event: Boat tour including dinner and drinks (register by email with Jens Stoye)<\/p>\n\n\n\n
\n\n\n\nTHURSDAY Sept 08 (Pangenomics workshop in H-2.57<\/mark>)<\/h4>\n\n\n\n08:50 – 09:50: PANGAIA network meeting, part II (Paola Bonizzoni)
09:50 – 10:10: coffee break
10:10 – 11:10: Camille Marchet: Round table discussion: how to improve communication with your advisors,
and a few other items about wellness at work, and Mathias Weller: Peer Community in bioinformatics: a new approach to reviewing and publishing
11:10 – 11:30: coffee break
11:30 – 12:30: Christina Boucher: Computational Problems in Metagenomic Amplification
12:30 – 14:00: lunch
14:00 – 15:00: Erin K. Molloy: Recent advances and open challenges in estimating evolutionary
histories from low-homoplasy markers, and Rayan Chikhi: Metagenome assembly and analysis
15:00 – 15:20: coffee break
15:20 – 16:20: Paul Medvedev: The theoretical analysis of sequencing bioinformatic algorithms
16:20 – 16:40: coffee break
16:40 – 18:00: Open problems session (Travis Gagie)<\/p>\n\n\n\n
\n\n\n\nFRIDAY Sept 09 (Pangenomics workshop in H-2.57<\/mark>)<\/h4>\n\n\n\n08:50 – 09:50: Hackathon, part I (Rayan Chikhi)
09:50 – 10:10: coffee break
10:10 – 11:10: Hackathon, part II (Rayan Chikhi)
11:10 – 11:30: coffee break
11:30 – 12:30: Gene Myers: High Fidelity Genome Sequencing: What have we been missing?
12:30 – 14:00: Closing remarks and lunch
14:00: end<\/p>\n\n\n\n
\n\n\n\nCall for Papers (closed)<\/h3>\n\n\n\n
Papers presenting original research in all areas of algorithms<\/strong> applied to biology, ecology, medicine, and life sciences are sought. Please have a look at past issues of the conference for good examples.<\/p>\n\n\n\nPaper submission and proceedings (closed)<\/h3>\n\n\n\n
Papers should be submitted electronically via the EasyChair<\/a> submission system. The WABI 2022 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series<\/a>. Substantially extended versions of selected papers will be invited to a WABI 2022 special issue of Algorithms for Molecular Biology<\/a> (see an example: 2020 issue<\/a>).<\/p>\n\n\n\nSubmission Guidelines:<\/strong> Manuscripts should be prepared according to the LIPIcs instructions<\/a> using their most recent template (v2021.1.2). They should be 10-15 pages in length, excluding bibliography and title matter (header, abstract). Each paper must contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, all accessible to non-specialist readers. Additional material (beyond 15 pages) may be provided in a clearly marked appendix, which may or may not be read at the discretion of individual reviewers. In any case, the work must self-contained without the appendix. Only the typeset PDF file should be submitted to EasyChair<\/a> for review. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2022, attend the conference in person or virtually, depending on circumstances, and present the paper.<\/p>\n\n\n\n
\n\n\n\nWABI Program Committee<\/h3>\n\n\n\nPC Chairs<\/h4>\n\n\n\n- Christina Boucher, University of Florida, USA<\/li>
- Sven Rahmann, Saarland University, Germany<\/li><\/ul>\n\n\n\n
PC members<\/h4>\n\n\n\n- Tatsuya Akutsu, Kyoto University<\/li>
- Marco Antoniotti, DISCo, Universit\u00e0 degli Studi di Milano-Bicocca<\/li>
- Jasmijn Baaijens, TU Delft<\/li>
- Anne Bergeron, Universite du Quebec \u00e0 Montr\u00e9al<\/li>
- Paola Bonizzoni, Universit\u00e0 di Milano-Bicocca<\/li>
- Lenore Cowen, Tufts University<\/li>
- Gianluca Della Vedova, Univ. degli Studi Milano-Bicocca<\/li>
- Daniel Doerr, Heinrich Heine University D\u00fcsseldorf<\/li>
- Mohammed El-Kebir, University of Illinois at Urbana-Champaign<\/li>
- Nadia El-Mabrouk, University of Montreal<\/li>
- Travis Gagie, Diego Portales University<\/li>
- Anna Gambin, Institute of Informatics, Warsaw University<\/li>
- Shilpa Garg, University of Copenhagen<\/li>
- Bjarni Halldorsson, deCODE genetics and Reykjavik University<\/li>
- Katharina Huber, University of East Anglila<\/li>
- Carl Kingsford, Carnegie Mellon University<\/li>
- Gregory Kucherov, CNRS\/LIGM<\/li>
- Manuel Lafond, Universit\u00e9 de Sherbrooke<\/li>
- Elodie Laine, Sorbonne Universit\u00e9<\/li>
- Yu Lin, The Australian National University<\/li>
- Stefano Lonardi, UC Riverside<\/li>
- Guillaume Mar\u00e7ais, Carnegie Mellon University<\/li>
- Camille Marchet, CNRS<\/li>
- Erin Molloy, University of Maryland, College Park<\/li>
- Francesca Nadalin, EMBL<\/li>
- William Stafford Noble, University of Washington<\/li>
- Aida Ouangraoua, Universit\u00e9 de Sherbrooke<\/li>
- Ion Petre, Department of Mathematics and Statistics, University of Turku, Finland<\/li>
- Nadia Pisanti, University of Pisa<\/li>
- Solon Pissis, CWI Amsterdam<\/li>
- Alberto Policriti, University of Udine<\/li>
- Mihai Pop, University of Maryland<\/li>
- Teresa Przytycka, National Center of Biotechnology Information, NLM, NIH<\/li>
- Knut Reinert, FU Berlin<\/li>
- Eric Rivals, LIRMM\/CNRS<\/li>
- Sebastien Roch, UW Madison<\/li>
- Giovanna Rosone, Dipartimento di Informatica – Universit\u00e0 di Pisa<\/li>
- Alexander Schoenhuth, Bielefeld University<\/li>
- Mingfu Shao, Computational Biology Department, Carnegie Mellon University<\/li>
- Krister Swenson, CNRS, Universit\u00e9 de Montpellier<\/li>
- Ewa Szczurek, University of Warsaw<\/li>
- Sharma V. Thankachan, University of Central Florida<\/li>
- H\u00e9l\u00e8ne Touzet, CNRS, CRIStAL, Lille<\/li>
- Tomas Vinar, Comenius University in Bratislava<\/li>
- Prudence Wong, University of Liverpool<\/li>
- Simone Zaccaria, UCL Cancer Institute<\/li>
- Louxin Zhang, National University of Singapore<\/li>
- Michal Ziv-Ukelson, Ben Gurion University of the Negev<\/li><\/ul>\n\n\n\n
Steering Committee<\/h4>\n\n\n\n- Bernard Moret, EPFL, Switzerland (till 09\/2022)<\/li>
- Vincent Moulton, University of East Anglia, UK<\/li>
- Nadia Pisanti, University of Pisa (since 09\/2022)<\/li>
- Mona Singh, Princeton University (since 09\/2022)<\/li>
- Jens Stoye, Bielefeld University, Germany<\/li>
- Tandy Warnow, University of Illinois at Urbana-Champaign (till 09\/2022)<\/li><\/ul>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
Scope WABI is an international Conference covering research in algorithmic work in bioinformatics, computational biology and systems biology. The emphasis is mainly on discrete algorithms and machine learning methods that address important problems in molecular biology, that are founded on sound models, that are computationally efficient, and that provide evidence of their potential usefulness in … <\/p>\n
- Mon 5, Tue 6, Wed 7 (till noon): WABI main conference (with LIPIcs proceedings)<\/li>
- Wed 7 (from noon), Thu 8, Fri 9 (till noon): Computational Pangenomics workshop (without proceedings)<\/li><\/ul><\/li><\/ul>\n\n\n\n
Invited ALGO Keynote Speaker for WABI (Wednesday 11:30, before lunch)<\/h3>\n\n\n
\nLeena Salmela<\/strong>
University of Helsinki
Academy of Finland Research Fellow<\/figcaption><\/figure>\n<\/div>\n\n\nDr. Leena Salmela<\/strong> is a university lecturer in the Department of Computer Science at the University of Helsinki. Dr. Salmela received her D.Sc.(Tech) degree in computer science at Helsinki University of Technology, Finland, in 2009, where her researched focus was in string algorithms. Dr. Salmela’s current research interests include genome assembly algorithms, de Bruijn graphs, and other algorithms for sequencing data. Software developed by her, such as the sequencing error correction program LoRDEC, has been used in numerous biological studies.<\/p>\n\n\n\n
“Efficient solutions to biological problems using de Bruijn graphs<\/strong>“<\/p>\n\n\n\n
A de Bruijn graph represents a set of sequencing reads by the k-mers, i.e. substrings of length k, occurring in the reads. In the node centric de Bruijn graph, the set of k-mers are the nodes of the de Bruijn graph and an edge is added between two nodes if they share an overlap of k-1 characters. This representation condenses the information in a large read set into compact space thus allowing efficient solutions to many problems in computational biology. Such problems include for example correction of sequencing errors and genome assembly. Because each position of a genome is sequenced several times, it is possible to correct sequencing errors in reads if we can identify data originating from the same genomic region. A de Bruijn graph can be used to represent compactly the reliable information and the individual reads can be corrected by aligning them to the graph. Genome assembly is a classic problem, which can be solved for example with de Bruijn graphs. The task is to reconstruct the underlying genome based on sequencing reads. In genome assembly the choice of k is a crucial matter. A small k can result in a tangled graph, whereas a too large k will fragment the graph. Furthermore, a different value of k may be optimal for different parts of the genome. Variable order de Bruijn graphs, which represent de Bruijn graphs of all orders k in a single data structure, have been proposed as a solution. We give the first definition of assembled sequences, i.e. contigs, on such graphs and an algorithm for enumerating them.<\/p>\n\n\n\n
Schedule<\/h3>\n\n\n\n
NOTES:<\/strong> <\/strong><\/mark>
– FFP2 or medical masks are required inside buildings on campus<\/strong> unless you are giving a talk.<\/mark>
– Last-minute schedule changes will be marked in purple.<\/mark>
– Please make sure to upload your PDF\/PPTX to the presentation laptop BEFORE the session starts.
– Please use the cursor instead of the laser pointer, so online participants can see what you are pointing at.
– Please stand away from the speakers so we do not get an audio feedback loop.<\/p>\n\n\n\nMONDAY Sept 05<\/strong> (WABI in HS3)<\/h4>\n\n\n\n
before 09:50: registration, badge pick-up, chat.
09:50 – 10:05: coffee break
SESSION 1: k-mer sets<\/strong> (Chair: Nadia Pisanti)
10:05 – 10:10: Short welcome message by PC Chairs<\/strong>
10:10 – 10:30: Yoshihiko Suzuki and Gene Myers. Accurate K-mer Classification Using Read Profiles (ZOOM)
10:30 – 10:50: Jens Zentgraf and Sven Rahmann. Fast gapped k-mer counting with subdivided multi-way bucketed Cuckoo hash tables (We apologize for the streaming problems. A separate video recording will be made available to online participants soon!)<\/mark>
10:50 – 11:10: Sebastian Schmidt and Jarno Alanko. Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time (ZOOM)
11:10 – 11:30: coffee break
11:30 – 12:30: ESA KEYNOTE<\/strong> (Saket Saurabh, plenary in HS1)
12:30 – 14:00 lunch
SESSION 2 Succinct Data Structures<\/strong> (Chair: Travis Gagie)
14:00 – 14:20: Zsuzsanna Liptak, Francesco Masillo and Simon J. Puglisi. Suffix sorting via matching statistics
14:20 – 14:40: Giulio Ermanno Pibiri. On Weighted K-Mer Dictionaries
14:40 – 15:00: Adri\u00e1n Goga and Andrej Bal\u00e1\u017e. Prefix-free parsing for building large tunnelled Wheeler graphs<\/mark> (moved here from Tuesday BWT session)<\/mark>
15:00 – 15:20: coffee break
SESSION 3 Genome distance and rearrangement<\/strong> (Chair: Daniel Doerr)
15:20 – 15:40: Pijus Simonaitis and Benjamin J. Raphael. A maximum parsimony principle for multichromosomal complex genome rearrangements
15:40 – 16:00: Marilia Braga, Leonie Brockmann, Katharina Klerx and Jens Stoye. A linear time algorithm for an extended version of the breakpoint double distance
16:00 – 16:20: Diego P. Rubert and Marilia Braga. Gene orthology inference via large-scale rearrangements for partially assembled genomes
16:20 – 16:40: coffee break
16:40 – 17:40: WABI Business meeting:<\/strong> Information about WABI 2022; changes in the Steering Committee; future plans for WABI
17:40 – later: ALGO RECEPTION<\/p>\n\n\n\n
\n\n\n\nTUESDAY Sept 06 (WABI in HS 3)<\/h4>\n\n\n\n
SESSION 4: BWT-like data structures<\/strong> (Chair: Jarno Alanko)
08:50 – 09:10: Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone and Lorenzo Tattini. phyBWT: Alignment-free phylogeny via eBWT positional clustering
09:10 – 09:30: Taher Mun, Naga Sai Kavya Vaddadi and Ben Langmead. Pangenomic genotyping with the marker array<\/mark> (moved here from Monday’s Succinct Data Structures session)<\/mark>
09:30 – 09:50: Ahsan Sanaullah, Degui Zhi and Shaojie Zhang. Haplotype Threading Using the Positional Burrows-Wheeler Transform
09:50 – 10:10: coffee break
SESSION 5<\/strong> (Chair: Thomas Vinar)
10:10 – 10:30: Alitzel L\u00f3pez S\u00e1nchez and Manuel Lafond. Predicting Horizontal Gene Transfers with Perfect Transfer Networks
10:30 – 10:50: Konstantinn Bonnet, Tobias Marschall and Daniel Doerr. Constructing founder sets under allelic and non-allelic homologous recombination
10:50 – 11:10: Wei Wei and David Koslicki. WGSUniFrac: Applying UniFrac metric to Whole Genome Shotgun data (ZOOM)
11:10 – 11:30: coffee break
11:30 – 12:30: ESA KEYNOTE<\/strong> (Simon Puglisi, plenary in HS1)
12:30 – 14:00: lunch (and lunch meeting for Steering Committee only)
SESSION 6: Phylogenetics++<\/strong> (Chair: Christina Boucher)
14:00 – 14:20: Mathieu Gascon and Nadia El-Mabrouk. Non-binary Tree Reconciliation with Endosymbiotic Gene Transfer
14:20 – 14:40: Baqiao Liu and Tandy Warnow. Fast and Accurate Species Trees from Weighted Internode Distances (ZOOM)
14:40 – 15:00: Giulia Bernardini, Leo van Iersel, Esther Julien and Leen Stougie. Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning
15:00 – 15:20: coffee break
SESSION 7<\/strong> (Chair: Erin Molloy)
15:20 – 15:40: Eden Ozery, Meirav Zehavi and Michal Ziv-Ukelson. Algorithms for Structure Informed Genome Rearrangement
15:40 – 16:00: Daniel Gibney, Sharma V. Thankachan and Srinivas Aluru. Feasibility of Flow Decomposition with Subpath Constraints in Linear Time (ZOOM)
16:00-16:40: coffee break
16:40 – 17:25: ALGO Memorial lecture<\/strong> about Rolf Niedermeier, Gerhard Woeginger, Camil Demetrescu
17:25 – late: ALGO conference dinner<\/strong> (with short walk; ticket required)<\/p>\n\n\n\n
\n\n\n\nWEDNESDAY Sept 07 (WABI in L-E.03 — note the different building\/room!)<\/mark><\/h4>\n\n\n\n
SESSION 8<\/strong> (Chair: Christina Boucher)
08:50 – 09:10: Cl\u00e9ment Agret, Bastien Cazaux and Antoine Limasset. Toward optimal fingerprint indexing for large scale genomics
09:10 – 09:30: Yoshihiro Shibuya, Djamal Belazzougui and Gregory Kucherov. Efficient reconciliation of genomic datasets of high similarity
09:30 – 09:50: Ke Chen and Mingfu Shao. Locality-sensitive bucketing functions
09:50 – 10:10: coffee break (note that the Wednesday morning session is on a different part of the campus. Access to the catering\/coffee will take a longer walk. It may not be possible to spend much time at the coffee if you want to walk and be back on time. The OC will see if we can get some coffee at L-E.03 as well.)
SESSION 9 and AWARD<\/strong> (Chair: Sven Rahmann)
10:10 – 10:30: Bertrand Marchand, Sebastian Will, Sarah Berkemer, Laurent Bulteau and Yann Ponty. Fully-automated design of dynamic programming schemes for RNA folding with pseudoknots
10:30 – 11:10: WABI Best paper award
11:10 – 11:30: coffee break
11:30 – 12:30: WABI KEYNOTE<\/strong> by Leena Salmela: Efficient solutions to biological problems using de Bruijn graphs (plenary in HS1; chairs: Christina Boucher and Sven Rahmann)
12:30 – 14:00 lunch<\/p>\n\n\n\n14:00 – Friday noon:
WABI Pangenomics workshops by EU Projects PANGAIA and ALPACA<\/strong> (in H-2.57 — again different!)<\/mark><\/strong><\/p>\n\n\n\nZoom link for the public lectures: https:\/\/uni-bielefeld.zoom.us\/j\/61746700409?pwd=RnI3ZGdad2FqR2pLNWx5RS9kSjBxdz09<\/a><\/strong><\/mark><\/p>\n\n\n\n
14:00 – 15:00: Knut Reinert: Hierarchical Interleaved Bloom Filter: Enabling ultrafast, approximate sequence queries, and ALPACA business meeting (Alexander Sch\u00f6nhuth)
15:00 – 15:20: coffee break
15:20 – 16:20: PANGAIA network meeting, part I (Paola Bonizzoni)
16:20 – 16:30: coffee break
16:30 – 21:30: Social event: Boat tour including dinner and drinks (register by email with Jens Stoye)<\/p>\n\n\n\n
\n\n\n\nTHURSDAY Sept 08 (Pangenomics workshop in H-2.57<\/mark>)<\/h4>\n\n\n\n
08:50 – 09:50: PANGAIA network meeting, part II (Paola Bonizzoni)
09:50 – 10:10: coffee break
10:10 – 11:10: Camille Marchet: Round table discussion: how to improve communication with your advisors,
and a few other items about wellness at work, and Mathias Weller: Peer Community in bioinformatics: a new approach to reviewing and publishing
11:10 – 11:30: coffee break
11:30 – 12:30: Christina Boucher: Computational Problems in Metagenomic Amplification
12:30 – 14:00: lunch
14:00 – 15:00: Erin K. Molloy: Recent advances and open challenges in estimating evolutionary
histories from low-homoplasy markers, and Rayan Chikhi: Metagenome assembly and analysis
15:00 – 15:20: coffee break
15:20 – 16:20: Paul Medvedev: The theoretical analysis of sequencing bioinformatic algorithms
16:20 – 16:40: coffee break
16:40 – 18:00: Open problems session (Travis Gagie)<\/p>\n\n\n\n
\n\n\n\nFRIDAY Sept 09 (Pangenomics workshop in H-2.57<\/mark>)<\/h4>\n\n\n\n
08:50 – 09:50: Hackathon, part I (Rayan Chikhi)
09:50 – 10:10: coffee break
10:10 – 11:10: Hackathon, part II (Rayan Chikhi)
11:10 – 11:30: coffee break
11:30 – 12:30: Gene Myers: High Fidelity Genome Sequencing: What have we been missing?
12:30 – 14:00: Closing remarks and lunch
14:00: end<\/p>\n\n\n\n
\n\n\n\nCall for Papers (closed)<\/h3>\n\n\n\n
Papers presenting original research in all areas of algorithms<\/strong> applied to biology, ecology, medicine, and life sciences are sought. Please have a look at past issues of the conference for good examples.<\/p>\n\n\n\n
Paper submission and proceedings (closed)<\/h3>\n\n\n\n
Papers should be submitted electronically via the EasyChair<\/a> submission system. The WABI 2022 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series<\/a>. Substantially extended versions of selected papers will be invited to a WABI 2022 special issue of Algorithms for Molecular Biology<\/a> (see an example: 2020 issue<\/a>).<\/p>\n\n\n\n
Submission Guidelines:<\/strong> Manuscripts should be prepared according to the LIPIcs instructions<\/a> using their most recent template (v2021.1.2). They should be 10-15 pages in length, excluding bibliography and title matter (header, abstract). Each paper must contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, all accessible to non-specialist readers. Additional material (beyond 15 pages) may be provided in a clearly marked appendix, which may or may not be read at the discretion of individual reviewers. In any case, the work must self-contained without the appendix. Only the typeset PDF file should be submitted to EasyChair<\/a> for review. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2022, attend the conference in person or virtually, depending on circumstances, and present the paper.<\/p>\n\n\n\n
\n\n\n\nWABI Program Committee<\/h3>\n\n\n\n
PC Chairs<\/h4>\n\n\n\n
- Christina Boucher, University of Florida, USA<\/li>
- Sven Rahmann, Saarland University, Germany<\/li><\/ul>\n\n\n\n
PC members<\/h4>\n\n\n\n
- Tatsuya Akutsu, Kyoto University<\/li>
- Marco Antoniotti, DISCo, Universit\u00e0 degli Studi di Milano-Bicocca<\/li>
- Jasmijn Baaijens, TU Delft<\/li>
- Anne Bergeron, Universite du Quebec \u00e0 Montr\u00e9al<\/li>
- Paola Bonizzoni, Universit\u00e0 di Milano-Bicocca<\/li>
- Lenore Cowen, Tufts University<\/li>
- Gianluca Della Vedova, Univ. degli Studi Milano-Bicocca<\/li>
- Daniel Doerr, Heinrich Heine University D\u00fcsseldorf<\/li>
- Mohammed El-Kebir, University of Illinois at Urbana-Champaign<\/li>
- Nadia El-Mabrouk, University of Montreal<\/li>
- Travis Gagie, Diego Portales University<\/li>
- Anna Gambin, Institute of Informatics, Warsaw University<\/li>
- Shilpa Garg, University of Copenhagen<\/li>
- Bjarni Halldorsson, deCODE genetics and Reykjavik University<\/li>
- Katharina Huber, University of East Anglila<\/li>
- Carl Kingsford, Carnegie Mellon University<\/li>
- Gregory Kucherov, CNRS\/LIGM<\/li>
- Manuel Lafond, Universit\u00e9 de Sherbrooke<\/li>
- Elodie Laine, Sorbonne Universit\u00e9<\/li>
- Yu Lin, The Australian National University<\/li>
- Stefano Lonardi, UC Riverside<\/li>
- Guillaume Mar\u00e7ais, Carnegie Mellon University<\/li>
- Camille Marchet, CNRS<\/li>
- Erin Molloy, University of Maryland, College Park<\/li>
- Francesca Nadalin, EMBL<\/li>
- William Stafford Noble, University of Washington<\/li>
- Aida Ouangraoua, Universit\u00e9 de Sherbrooke<\/li>
- Ion Petre, Department of Mathematics and Statistics, University of Turku, Finland<\/li>
- Nadia Pisanti, University of Pisa<\/li>
- Solon Pissis, CWI Amsterdam<\/li>
- Alberto Policriti, University of Udine<\/li>
- Mihai Pop, University of Maryland<\/li>
- Teresa Przytycka, National Center of Biotechnology Information, NLM, NIH<\/li>
- Knut Reinert, FU Berlin<\/li>
- Eric Rivals, LIRMM\/CNRS<\/li>
- Sebastien Roch, UW Madison<\/li>
- Giovanna Rosone, Dipartimento di Informatica – Universit\u00e0 di Pisa<\/li>
- Alexander Schoenhuth, Bielefeld University<\/li>
- Mingfu Shao, Computational Biology Department, Carnegie Mellon University<\/li>
- Krister Swenson, CNRS, Universit\u00e9 de Montpellier<\/li>
- Ewa Szczurek, University of Warsaw<\/li>
- Sharma V. Thankachan, University of Central Florida<\/li>
- H\u00e9l\u00e8ne Touzet, CNRS, CRIStAL, Lille<\/li>
- Tomas Vinar, Comenius University in Bratislava<\/li>
- Prudence Wong, University of Liverpool<\/li>
- Simone Zaccaria, UCL Cancer Institute<\/li>
- Louxin Zhang, National University of Singapore<\/li>
- Michal Ziv-Ukelson, Ben Gurion University of the Negev<\/li><\/ul>\n\n\n\n
Steering Committee<\/h4>\n\n\n\n
- Bernard Moret, EPFL, Switzerland (till 09\/2022)<\/li>
- Vincent Moulton, University of East Anglia, UK<\/li>
- Nadia Pisanti, University of Pisa (since 09\/2022)<\/li>
- Mona Singh, Princeton University (since 09\/2022)<\/li>
- Jens Stoye, Bielefeld University, Germany<\/li>
- Tandy Warnow, University of Illinois at Urbana-Champaign (till 09\/2022)<\/li><\/ul>\n\n\n\n
<\/p>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
Scope WABI is an international Conference covering research in algorithmic work in bioinformatics, computational biology and systems biology. The emphasis is mainly on discrete algorithms and machine learning methods that address important problems in molecular biology, that are founded on sound models, that are computationally efficient, and that provide evidence of their potential usefulness in … <\/p>\n