Eight-segment panorama of Chicago, Illinois, as viewed from North Avenue Beach

Workshop on Algorithms in Bioinformatics (WABI) 2021, August 2-4

The Workshop on Algorithms in Bioinformatics (WABI), established in 2001, is one of the major annual conferences on algorithms in bioinformatics. Due to COVID-19, WABI 2021 will be held online on August 2-4.


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 practice, preferably by testing on appropriately chosen simulated or real datasets. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research. This year it is colocated with ACM-BCB 2021.

Important dates

  • Paper submission deadline: April 16, 2021 extended to April 20, 2021
  • Paper notification: May 21, 2021
  • Camera ready: May 31, 2021
  • Poster abstract submission deadline: June 27, 2021
  • Poster notification: July 1, 2021
  • Poster upload: July 12, 2021
  • Conference: August 2-4, 2021 (virtual)

Call for posters/papers

Poster submission

WABI 2021 invites the submission of abstracts of your work for presentation in a poster session. The poster can describe existing published or "in press" research, or can describe new work. Submissions must contain an abstract (about 200 words, plain justified text in 10pt character size, formatted to fit A4: 21 x 29.7 cm, including title, author(s), affiliation, e-mail, a link to the published journal version (if any), and the identity of the presenter (in case of a multi-authored poster), followed by the abstract text. The submission deadline is June 27, 2021 (time zone of your choice). All submissions must be made online, through the EasyChair submission system, at:

Paper submission

Submissions must be formatted in LaTeX using the LIPIcs style and must not exceed 15 pages excluding references. For details please see the information for authors. 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. All submissions must be made online, through the EasyChair submission system, at:

For scientific information, please contact one of the WABI program committee co-chairs, Alessandra Carbone (Alessandra.Carbone[at]lip6[dot]fr) or Mohammed El-Kebir (melkebir[at]illinois[dot]edu). For organizational information, please refer to the ACM-BCB 2021 website.

You will need to register on the EasyChair web site before submitting. A standard .pdf file must be received by April 20, 2021 (time zone of your choice) in order for your submission to be considered. Re-submission of already submitted papers will be possible until April 22, 2021 (time zone of your choice). Simultaneous submission to another conference with published proceedings is not permitted, but simultaneous submission to a journal is allowed, provided that the authors notify the program chairs; if published in a journal, such a contribution will be published as a short abstract in the WABI proceedings. Depositing in or is allowed.

By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ACM-BCB 2021, attend the conference, and present the paper.

Accepted papers will be published in WABI proceedings in the LIPIcs Leibniz International Proceedings in Informatics.

Selected papers will be invited for an extended publication in a thematic series in Algorithms for Molecular Biology (AMB).

Program committee

The PC is co-chaired by Alessandra Carbone and Mohammed El-Kebir.
  • Tatsuya Akutsu, Kyoto University, Japan
  • Marco Antoniotti, Universita di Milano-Bicocca, Italy
  • Anne Bergeron, Universite du Quebec a Montreal, Canada
  • Paola Bonizzoni, Universita di Milano-Bicocca, Italy
  • Christina Boucher, University of Florida, USA
  • Alessandra Carbone, Sorbonne Universite, France (co-chair)
  • Rayan Chikhi, Institut Pasteur, France
  • Leonid Chindelevitch, Imperial College London, UK
  • Lenore Cowen, Tufts University, USA
  • Daniel Doerr, University of Duesseldorf, Germany
  • Mohammed El-Kebir, University of Illinois at Urbana-Champaign, USA (co-chair)
  • Nadia El-Mabrouk, University of Montreal, Canada
  • Anna Gambin, Warsaw University, Poland
  • Bjarni Halldorsson, deCODE genetics and Reykjavik University, Iceland
  • Katharina Huber, University of East Anglia, UK
  • Carl Kingsford, Carnegie Mellon University, USA
  • Gunnar Klau, Heinrich Heine University Dusseldorf, Germany
  • Gregory Kucherov, University of Paris Est, France
  • Manuel Lafond, Universite de Sherbrooke, Canada
  • Elodie Laine, Sorbonne Universite, France
  • Yu Lin, Austrialia National University, Australia
  • Stefano Lonardi, University of California Riverside, USA
  • Veli Makinen, University of Helsinki, Finland
  • Guillaume Marcais, Carnegie Mellon University, USA
  • Tobias Marschall, Heinrich Heine University, Germany
  • Erin Molloy, University of Maryland College Park / UCLA, US
  • Bernard Moret, Ecole Polytechnique Federale de Lausanne, Switzerland
  • Vincent Moulton, University of East Anglia, UK
  • Francesca Nadalin, EMBL-EBI / ITT, Italy, England
  • Mihai Pop, University of Maryland, USA
  • Teresa Przytycka, NCBI, NIH, USA
  • William Stafford Noble, University of Washington, USA
  • Aida Ouangraoua, Universite de Sherbrooke, Canada
  • Ion Petre, Turku University, Finland
  • Nadia Pisanti, University of Pisa, Italy
  • Solon Pissis, CWI Amsterdam, the Netherlands
  • Alberto Policriti, University of Udine, Italy
  • Sven Rahmann, Saarland University, Germany
  • Knut Reinert, FU Berlin, Germany
  • Eric Rivals, LIRMM - Universite de Montpellier, France
  • Sebastien Roch, University of Wisconsin Madison, US
  • Giovanna Rosone, University of Pisa, Italy
  • Marie-France Sagot, INRIA Rhone-Alpes, France
  • Alexander Schoenhuth, Bielefeld University, Germany
  • Mingfu Shao, Penn State, US
  • Jens Stoye, Bielefeld University, Germany
  • Krister Swenson, CNRS and Universite de Montpellier, France
  • Ewa Szczurek, Warsaw University, Poland
  • Sharma Thankachan, University of Central Florida, USA
  • Alexandru Tomescu, University of Helsinki, Finland
  • Helene Touzet, CNRS, France
  • Esko Ukkonen, University of Helsinki, Finland
  • Gianluca Della Vedova, University of Milano-Bicocca, Italy
  • Tomas Vinar, Comenius University, Slovakia
  • Prudence W.H.Wong, University of Liverpool, UK
  • Tandy Warnow, University of Illinois at Urbana-Champaign, USA
  • Simone Zaccaria, UCL Cancer Institute, UK
  • Louxin Zhang, National University of Singapore, Singapore
  • Xiuwei Zhang, Georgia Tech, US
  • Michal Ziv-Ukelson, Ben Gurion University of the Negev, Israel

Steering committee

Keynote speaker

Jason Moore, Penn Institute for Biomedical Informatics

Jason Moore is the Edward Rose Professor of Informatics and Director of the Penn Institute for Biomedical Informatics. He also serves as Senior Associate Dean for Informatics and Chief of the Division of Informatics in the Department of Biostatistics, Epidemiology, and Informatics. He leads an active NIH-funded research program focused on the development of artificial intelligence and machine learning algorithms for the analysis of complex biomedical data. Recent work has focused on automated machine learning. He is an elected fellow of the American Association for the Advancement of Science (AAAS), an elected fellow of the American College of Medical Informatics (ACMI), and an elected fellow of the American Statistical Association (ASA). He serves as Editor-in-Chief of the journal BioData Mining.

Mona Singh, Princeton University

Mona Singh obtained her AB and SM degrees at Harvard University, and her PhD at MIT, all three in Computer Science. She did postdoctoral work at the Whitehead Institute for Biomedical Research. She has been on the faculty at Princeton since 1999, and currently she is Professor of Computer Science in the computer science department and the Lewis-Sigler Institute for Integrative Genomics. She received the Presidential Early Career Award for Scientists and Engineers (PECASE) in 2001, and is a Fellow of the International Society for Computational Biology and a Fellow for the Association for Computing Machinery. She is Editor-In-Chief of the Journal of Computational Biology. She has been program committee chair for several major computational biology conferences, including ISMB (2010), WABI (2010), ACM-BCB (2012), and RECOMB (2016), and has been Chair of the NIH Modeling and Analysis of Biological Systems Study Section (2012-2014).

Aidong Zhang, University of Virginia

Dr. Aidong Zhang is a William Wulf Faculty Fellow and Professor at University of Virginia. Prior to UVA, she is a SUNY Distinguished Professor and department chair (2009-2015) at the State University of New York (SUNY) at Buffalo. Her research interests include machine learning, data mining/data science, bioinformatics, and health informatics. She has authored over 350 research publications in these areas. She is a fellow of ACM, AIMBE, and IEEE.

Accepted papers

  • The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard. Matthew LeMay, Yi-Chieh Wu and Ran Libeskind-Hadas
  • Efficient Privacy-Preserving Variable-Length Substring Match for Genome Sequence. Yoshiki Nakagawa, Satsuya Ohata and Kana Shimizu
  • Making sense of a cophylogeny output: Efficient listing of representative reconciliations. Yishu Wang, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri
  • Perplexity: evaluating transcript abundance estimation in the absence of ground truth. Jason Fan, Skylar Chan and Rob Patro
  • The Maximum Duo-Preservation String Mapping1Problem with Bounded Alphabet. Nicolas Boria, Laurent Gourvès, Vangelis Paschos and Jerome Monnot
  • Treewidth-based Algorithms for the Small Parsimony Problem on Networks. Celine Scornavacca and Mathias Weller
  • Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. Bertrand Marchand, Yann Ponty and Laurent Bulteau
  • Space-efficient representation of genomic k-mer count tables. Yoshihiro Shibuya, Djamal Belazzougui and Gregory Kucherov
  • Parsimonious Clone Tree Reconciliation in Cancer. Palash Sashittal, Simone Zaccaria and Mohammed El-Kebir
  • An efficient linear mixed model framework for meta-analytic association studies across multiple contexts. Brandon Jew, Jiajin Li, Sriram Sankararaman and Jae Hoon Sul
  • LRBinner: Binning Long Reads in Metagenomics Datasets. Anuradha Wickramarachchi and Yu Lin
  • Compression of Multiple k-mer Sets by Iterative SPSS Decomposition. Kazushi Kitaya and Tetsuo Shibuya
  • Compressing and Indexing Aligned Readsets. Travis Gagie, Garance Gourdel and Giovanni Manzini
  • BPPart: RNA-RNA Interaction Partition Function in the Absence of Entropy. Ali Ebrahimpour Boroojeny, Sanjay Rajopadhye and Hamidreza Chitsaz
  • BISER: Fast Characterization of Segmental Duplication Structure in Multiple Genome Assemblies. Hamza Iseric, Can Alkan, Faraz Hach and Ibrahim Numanagic
  • Flow Decomposition with Subpath Constraints. Lucia Williams, Alexandru I. Tomescu and Brendan Mumey
  • Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks. Marcin Wawerka, Dawid Dąbkowski, Natalia Rutecka, Agnieszka Mykowiecka and Pawel Gorecki
  • Genome halving and aliquoting under the copy number distance. Ron Zeira, Geoffrey Mon and Benjamin J Raphael
  • Efficient Haplotype Block Matching in Bi-Directional PBWT. Ardalan Naseri, William Yue, Shaojie Zhang and Degui Zhi
  • Fast approximate shortest hyperpaths for inferring pathways in cell signaling hypergraphs. Spencer Krieger and John Kececioglu