| 0 | -- | 0 | Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, Süleyman Cenk Sahinalp. A multi-labeled tree dissimilarity measure for comparing "clonal trees" of tumor progression |
| 0 | -- | 0 | Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen. Linear time minimum segmentation enables scalable founder reconstruction |
| 0 | -- | 0 | Jimmy Wu, Alex Khodaverdian, Benjamin Weitz, Nir Yosef. Connectivity problems on heterogeneous graphs |
| 0 | -- | 0 | Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin. Differentially mutated subnetworks discovery |
| 0 | -- | 0 | Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone. SNPs detection by eBWT positional clustering |
| 0 | -- | 0 | Leonid Chindelevitch, Sean La, Joao Meidanis. A cubic algorithm for the generalized rank median of three genomes |
| 0 | -- | 0 | Yue Zhang, Chunfang Zheng, David Sankoff. A branching process for homology distribution-based inference of polyploidy, speciation and loss |
| 0 | -- | 0 | Yohei M. Rosen, Benedict J. Paten. An average-case sublinear forward algorithm for the haploid Li and Stephens model |
| 0 | -- | 0 | Riku Walve, Pasi Rastas, Leena Salmela. Kermit: linkage map guided long read assembly |
| 0 | -- | 0 | Lavinia Egidi, Felipe Alves Louza, Giovanni Manzini, Guilherme P. Telles. External memory BWT and LCP computation for sequence collections with applications |
| 0 | -- | 0 | Riccardo Dondi, Manuel Lafond, Céline Scornavacca. Reconciling multiple genes trees via segmental duplications and losses |
| 0 | -- | 0 | Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark, Gunnar W. Klau. Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach |
| 0 | -- | 0 | Hisanori Kiryu, Yuto Ichikawa, Yasuhiro Kojima. TMRS: an algorithm for computing the time to the most recent substitution event from a multiple alignment column |
| 0 | -- | 0 | Erin K. Molloy, Tandy J. Warnow. Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge |
| 0 | -- | 0 | Pijus Simonaitis, Annie Chateau, Krister M. Swenson. A general framework for genome rearrangement with biological constraints |
| 0 | -- | 0 | Christina Boucher, Travis Gagie, Alan Kuhnle, Ben Langmead, Giovanni Manzini, Taher Mun. Prefix-free parsing for building big BWTs |
| 0 | -- | 0 | John Wiedenhoeft, Alex Cagan, Rimma Kozhemyakina, Rimma Gulevich, Alexander Schliep. Bayesian localization of CNV candidates in WGS data within minutes |
| 0 | -- | 0 | Qiuyi (Richard) Zhang, Satish Rao, Tandy J. Warnow. Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy |
| 0 | -- | 0 | Emre Sefer, Carl Kingsford. Semi-nonparametric modeling of topological domain formation from epigenetic data |
| 0 | -- | 0 | Christophe Ambroise, Alia Dehman, Pierre Neuvial, Guillem Rigaill, Nathalie Villa-Vialaneix. Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics |
| 0 | -- | 0 | Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias. Super short operations on both gene order and intergenic sizes |
| 0 | -- | 0 | Alexandre Lemos, Inês Lynce, Pedro T. Monteiro. Repairing Boolean logical models from time-series data using Answer Set Programming |
| 24 | -- | 0 | Elizabeth S. Allman, Hector Baños, John A. Rhodes. NANUQ: a method for inferring species networks from gene trees under the coalescent model |
| 25 | -- | 0 | Martin D. Muggli, Simon J. Puglisi, Christina Boucher. Kohdista: an efficient method to index and query possible Rmap alignments |