| Reconciling multiple genes trees via segmental duplications and losses |
5 |
| SNPs detection by eBWT positional clustering |
5 |
| External memory BWT and LCP computation for sequence collections with applications |
5 |
| Differentially mutated subnetworks discovery |
4 |
| Implications of non-uniqueness in phylogenetic deconvolution of bulk DNA samples of tumors |
3 |
| OCTAL: Optimal Completion of gene trees in polynomial time |
3 |
| Split-inducing indels in phylogenomic analysis |
3 |
| Time-consistent reconciliation maps and forbidden time travel |
3 |
| Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach |
3 |
| Prefix-free parsing for building big BWTs |
3 |
| Gene tree parsimony for incomplete gene trees: addressing true biological loss |
3 |
| A multi-labeled tree dissimilarity measure for comparing clonal trees of tumor progression |
3 |
| Locus-aware decomposition of gene trees with respect to polytomous species trees |
1 |
| Fast phylogenetic inference from typing data |
1 |
| Derivative-free neural network for optimizing the scoring functions associated with dynamic programming of pairwise-profile alignment |
1 |
| Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge |
1 |
| Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy |
1 |
| KOHDISTA: an efficient method to index and query possible Rmap alignments |
1 |
| Kermit: linkage map guided long read assembly |
1 |
| Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics |
1 |
| Sorting signed circular permutations by super short operations |
1 |
| NANUQ: a method for inferring species networks from gene trees under the coalescent model |
1 |
| Repairing Boolean logical models from time-series data using Answer Set Programming |
1 |
| FSH: fast spaced seed hashing exploiting adjacent hashes |
1 |
| Superbubbles revisited |
0 |
| Bayesian localization of CNV candidates in WGS data within minutes |
0 |
| Outlier detection in BLAST hits |
0 |
| TMRS: an algorithm for computing the time to the most recent substitution event from a multiple alignment column |
0 |
| Connectivity problems on heterogeneous graphs |
0 |
| Finding local genome rearrangements |
0 |
| Coordinate systems for supergenomes |
0 |
| Regmex: a statistical tool for exploring motifs in ranked sequence lists from genomics experiments |
0 |
| An average-case sublinear forward algorithm for the haploid Li and Stephens model |
0 |
| A fast and accurate enumeration-based algorithm for haplotyping a triploid individual |
0 |
| Super short operations on both gene order and intergenic sizes |
0 |
| Improved de novo peptide sequencing using LC retention time information |
0 |
| A branching process for homology distribution-based inference of polyploidy, speciation and loss |
0 |
| A safe and complete algorithm for metagenomic assembly |
0 |
| A cubic algorithm for the generalized rank median of three genomes |
0 |
| A general framework for genome rearrangement with biological constraints |
0 |
| Semi-nonparametric modeling of topological domain formation from epigenetic data |
0 |
| Linear time minimum segmentation enables scalable founder reconstruction |
0 |
