| 2022 | A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. | Marlia D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye |
| 2022 | Constructing Founder Sets Under Allelic and Non-Allelic Homologous Recombination. | Konstantinn Bonnet, Tobias Marschall, Daniel Doerr |
| 2022 | Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning. | Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie |
| 2022 | Toward Optimal Fingerprint Indexing for Large Scale Genomics. | Clment Agret, Bastien Cazaux, Antoine Limasset |
| 2021 | Genome Halving and Aliquoting Under the Copy Number Distance. | Ron Zeira, Geoffrey Mon, Benjamin J. Raphael |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2021 | Flow Decomposition with Subpath Constraints. | Lucia Williams, Alexandru I. Tomescu, Brendan Mumey |
| 2021 | LRBinner: Binning Long Reads in Metagenomics Datasets. | Anuradha Wickramarachchi, Yu Lin |
| 2021 | Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks. | Marcin Wawerka, Dawid Dabkowski, Natalia Rutecka, Agnieszka Mykowiecka, Pawel Grecki |
| 2021 | Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. | Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri |
| 2021 | Space-Efficient Representation of Genomic k-Mer Count Tables. | Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov |
| 2021 | Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. | Cline Scornavacca, Mathias Weller |
| 2021 | Parsimonious Clone Tree Reconciliation in Cancer. | Palash Sashittal, Simone Zaccaria, Mohammed El-Kebir |
| 2021 | Efficient Haplotype Block Matching in Bi-Directional PBWT. | Ardalan Naseri, William Yue, Shaojie Zhang, Degui Zhi |
| 2021 | Efficient Privacy-Preserving Variable-Length Substring Match for Genome Sequence. | Yoshiki Nakagawa, Satsuya Ohata, Kana Shimizu |
| 2021 | Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. | Bertrand Marchand, Yann Ponty, Laurent Bulteau |
| 2021 | The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. | Matthew LeMay, Yi-Chieh Wu, Ran Libeskind-Hadas |
| 2021 | Fast Approximate Shortest Hyperpaths for Inferring Pathways in Cell Signaling Hypergraphs. | Spencer Krieger, John D. Kececioglu |
| 2021 | Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition. | Kazushi Kitaya, Tetsuo Shibuya |
| 2021 | An Efficient Linear Mixed Model Framework for Meta-Analytic Association Studies Across Multiple Contexts. | Brandon Jew, Jiajin Li, Sriram Sankararaman, Jae Hoon Sul |
| 2021 | BISER: Fast Characterization of Segmental Duplication Structure in Multiple Genome Assemblies. | Hamza Iseric, Can Alkan, Faraz Hach, Ibrahim Numanagic |
| 2021 | Compressing and Indexing Aligned Readsets. | Travis Gagie, Garance Gourdel, Giovanni Manzini |
| 2021 | Perplexity: Evaluating Transcript Abundance Estimation in the Absence of Ground Truth. | Jason Fan, Skylar Chan, Rob Patro |
| 2021 | BPPart: RNA-RNA Interaction Partition Function in the Absence of Entropy. | Ali Ebrahimpour Boroojeny, Sanjay V. Rajopadhye, Hamidreza Chitsaz |
| 2021 | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. | Nicolas Boria, Laurent Gourvs, Vangelis Th. Paschos, Jrme Monnot |