| 1 | -- | 0 | Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye. Investigating the complexity of the double distance problems |
| 2 | -- | 0 | Junyan Dai, Tobias Rubel, Yunheng Han, Erin K. Molloy. Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem |
| 3 | -- | 0 | Jason Fan, Jamshed Khan, Noor Pratap Singh, Giulio Ermanno Pibiri, Rob Patro. Fulgor: a fast and compact k-mer index for large-scale matching and color queries |
| 4 | -- | 0 | Jyotshna Rajput, Ghanshyam Chandra, Chirag Jain. Co-linear chaining on pangenome graphs |
| 5 | -- | 0 | Victor Epain, Rumen Andonov. Global exact optimisations for chloroplast structural haplotype scaffolding |
| 6 | -- | 0 | Alitzel López Sánchez, Manuel Lafond. Predicting horizontal gene transfers with perfect transfer networks |
| 7 | -- | 0 | Pawel Górecki 0001, Natalia Rutecka, Agnieszka Mykowiecka 0002, Jaroslaw Paszek. Unifying duplication episode clustering and gene-species mapping inference |
| 8 | -- | 0 | Leonard Bohnenkämper. Recombinations, chains and caps: resolving problems with the DCJ-indel model |
| 9 | -- | 0 | Mateo Gray, Sebastian Will, Hosna Jabbari. SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration |
| 10 | -- | 0 | Nicola Rizzo 0001, Manuel Cáceres, Veli Mäkinen. Finding maximal exact matches in graphs |
| 11 | -- | 0 | Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi. Suffix sorting via matching statistics |
| 12 | -- | 0 | Shayesteh Arasti, Siavash Mirarab. Median quartet tree search algorithms using optimal subtree prune and regraft |
| 13 | -- | 0 | Hua-Ting Yao, Bertrand Marchand, Sarah J. Berkemer, Yann Ponty, Sebastian Will. Infrared: a declarative tree decomposition-powered framework for bioinformatics |
| 14 | -- | 0 | Diego Díaz-Domínguez, Miika Leinonen, Leena Salmela. Space-efficient computation of k-mer dictionaries for large values of k |
| 15 | -- | 0 | Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie. Pfp-fm: an accelerated FM-index |
| 16 | -- | 0 | Jamshed Khan, Tobias Rubel, Erin K. Molloy, Laxman Dhulipala, Rob Patro. Fast, parallel, and cache-friendly suffix array construction |
| 17 | -- | 0 | Yutong Qiu, Yihang Shen, Carl Kingsford. Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants |
| 18 | -- | 0 | Yushu Liu, Mohammad Amin Edrisi, Zhi Yan 0008, Huw A. Ogilvie, Luay Nakhleh. NestedBD: Bayesian inference of phylogenetic trees from single-cell copy number profiles under a birth-death model |
| 19 | -- | 0 | Tizian Schulz, Paul Medvedev. ESKEMAP: exact sketch-based read mapping |
| 20 | -- | 0 | Amatur Rahman, Yoann Dufresne, Paul Medvedev. Compression algorithm for colored de Bruijn graphs |
| 21 | -- | 0 | Stefan Canzar, Van Hoan Do, Slobodan Jelic, Sören Laue, Domagoj Matijevic, Tomislav Prusina. Metric multidimensional scaling for large single-cell datasets using neural networks |
| 22 | -- | 0 | Mahsa Farnia, Nadia Tahiri. New generalized metric based on branch length distance to compare B cell lineage trees |
| 23 | -- | 0 | Elizabeth S. Allman, Hector Baños, Jonathan D. Mitchell, John A. Rhodes. TINNiK: inference of the tree of blobs of a species network under the coalescent model |
| 24 | -- | 0 | Luís Cunha, Ignasi Sau, Uéverton S. Souza. On the parameterized complexity of the median and closest problems under some permutation metrics |