| 1 | -- | 0 | Peter Røgen. Quantifying steric hindrance and topological obstruction to protein structure superposition |
| 2 | -- | 0 | Jens Zentgraf, Sven Rahmann. Fast lightweight accurate xenograft sorting |
| 3 | -- | 0 | Vijini Mallawaarachchi, Anuradha Wickramarachchi, Yu Lin. Improving metagenomic binning results with overlapped bins using assembly graphs |
| 4 | -- | 0 | Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga. Natural family-free genomic distance |
| 5 | -- | 0 | Cong Ma, Hongyu Zheng, Carl Kingsford. Exact transcript quantification over splice graphs |
| 6 | -- | 0 | Kingshuk Mukherjee, Massimiliano Rossi 0001, Leena Salmela, Christina Boucher. Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph |
| 7 | -- | 0 | Fenix W. D. Huang, Christopher L. Barrett, Christian M. Reidys. The energy-spectrum of bicompatible sequences |
| 8 | -- | 0 | Thomas Gatter, Sarah von Löhneysen, Jörg Fallmann, Polina Drozdova, Tom Hartmann, Peter F. Stadler. LazyB: fast and cheap genome assembly |
| 9 | -- | 0 | Katharina Jahn, Niko Beerenwinkel, Louxin Zhang. The Bourque distances for mutation trees of cancers |
| 10 | -- | 0 | Amatur Rahman, Rayan Chikhi, Paul Medvedev. Disk compression of k-mer sets |
| 11 | -- | 0 | Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau. Using the longest run subsequence problem within homology-based scaffolding |
| 12 | -- | 0 | Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow. Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation |
| 13 | -- | 0 | Trevor S. Frisby, Christopher James Langmead. Bayesian optimization with evolutionary and structure-based regularization for directed protein evolution |
| 14 | -- | 0 | Leah L. Weber, Mohammed El-Kebir. Distinguishing linear and branched evolution given single-cell DNA sequencing data of tumors |
| 15 | -- | 0 | Leonie Selbach, Tobias Kowalski, Klaus Gerwert, Maike Buchin, Axel Mosig. Shape decomposition algorithms for laser capture microdissection |
| 16 | -- | 0 | Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson. Approximate search for known gene clusters in new genomes using PQ-trees |
| 17 | -- | 0 | Hooman Zabeti, Nick Dexter, Amir Hosein Safari, Nafiseh Sedaghat, Maxwell W. Libbrecht, Leonid Chindelevitch. INGOT-DR: an interpretable classifier for predicting drug resistance in M. tuberculosis |
| 18 | -- | 0 | Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming |
| 19 | -- | 0 | David Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler. Heuristic algorithms for best match graph editing |
| 20 | -- | 0 | Fabian Hausmann, Stefan Kurtz. DeepGRP: engineering a software tool for predicting genomic repetitive elements using Recurrent Neural Networks with attention |
| 21 | -- | 0 | Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Zanoni Dias. Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions |
| 22 | -- | 0 | David Fernández-Baca, Lei Liu. Testing the agreement of trees with internal labels |
| 23 | -- | 0 | David Schaller 0001, Marc Hellmuth, Peter F. Stadler. A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set |
| 24 | -- | 0 | Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias. An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes |
| 25 | -- | 0 | Tim Anderson, Travis J. Wheeler. An optimized FM-index library for nucleotide and amino acid search |