LIPIcs, Volume 201, WABI 2021

• Alessandra Carbone and Mohammed El-Kebir LIPIcs, Volume 201, WABI 2021, Complete Volume 10.4230/LIPIcs.WABI.2021
• Alessandra Carbone and Mohammed El-Kebir Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.WABI.2021.0
• Matthew LeMay, Yi-Chieh Wu, and Ran Libeskind-Hadas The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard 10.4230/LIPIcs.WABI.2021.1
• Yoshiki Nakagawa, Satsuya Ohata, and Kana Shimizu Efficient Privacy-Preserving Variable-Length Substring Match for Genome Sequence 10.4230/LIPIcs.WABI.2021.2
• Yishu Wang, Arnaud Mary, Marie-France Sagot, and Blerina Sinaimeri Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations 10.4230/LIPIcs.WABI.2021.3
• Jason Fan, Skylar Chan, and Rob Patro Perplexity: Evaluating Transcript Abundance Estimation in the Absence of Ground Truth 10.4230/LIPIcs.WABI.2021.4
• Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, and Jérôme Monnot The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet 10.4230/LIPIcs.WABI.2021.5
• Celine Scornavacca and Mathias Weller Treewidth-Based Algorithms for the Small Parsimony Problem on Networks 10.4230/LIPIcs.WABI.2021.6
• Bertrand Marchand, Yann Ponty, and Laurent Bulteau Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics 10.4230/LIPIcs.WABI.2021.7
• Yoshihiro Shibuya, Djamal Belazzougui, and Gregory Kucherov Space-Efficient Representation of Genomic k-Mer Count Tables 10.4230/LIPIcs.WABI.2021.8
• Palash Sashittal, Simone Zaccaria, and Mohammed El-Kebir Parsimonious Clone Tree Reconciliation in Cancer 10.4230/LIPIcs.WABI.2021.9
• Brandon Jew, Jiajin Li, Sriram Sankararaman, and Jae Hoon Sul An Efficient Linear Mixed Model Framework for Meta-Analytic Association Studies Across Multiple Contexts 10.4230/LIPIcs.WABI.2021.10
• Anuradha Wickramarachchi and Yu Lin LRBinner: Binning Long Reads in Metagenomics Datasets 10.4230/LIPIcs.WABI.2021.11
• Kazushi Kitaya and Tetsuo Shibuya Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition 10.4230/LIPIcs.WABI.2021.12
• Travis Gagie, Garance Gourdel, and Giovanni Manzini Compressing and Indexing Aligned Readsets 10.4230/LIPIcs.WABI.2021.13
• Ali Ebrahimpour-Boroojeny, Sanjay Rajopadhye, and Hamidreza Chitsaz BPPart: RNA-RNA Interaction Partition Function in the Absence of Entropy 10.4230/LIPIcs.WABI.2021.14
• Hamza Išerić, Can Alkan, Faraz Hach, and Ibrahim Numanagić BISER: Fast Characterization of Segmental Duplication Structure in Multiple Genome Assemblies 10.4230/LIPIcs.WABI.2021.15
• Lucia Williams, Alexandru I. Tomescu, and Brendan Mumey Flow Decomposition with Subpath Constraints 10.4230/LIPIcs.WABI.2021.16
• Marcin Wawerka, Dawid Dąbkowski, Natalia Rutecka, Agnieszka Mykowiecka, and Paweł Górecki Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks 10.4230/LIPIcs.WABI.2021.17
• Ron Zeira, Geoffrey Mon, and Benjamin J. Raphael Genome Halving and Aliquoting Under the Copy Number Distance 10.4230/LIPIcs.WABI.2021.18
• Ardalan Naseri, William Yue, Shaojie Zhang, and Degui Zhi Efficient Haplotype Block Matching in Bi-Directional PBWT 10.4230/LIPIcs.WABI.2021.19
• Spencer Krieger and John Kececioglu Fast Approximate Shortest Hyperpaths for Inferring Pathways in Cell Signaling Hypergraphs 10.4230/LIPIcs.WABI.2021.20