Algorithms for Molecular Biology

Papers
(The median citation count of Algorithms for Molecular Biology is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-04-01 to 2024-04-01.)
ArticleCitations
Alignment- and reference-free phylogenomics with colored de Bruijn graphs15
Improving metagenomic binning results with overlapped bins using assembly graphs12
From pairs of most similar sequences to phylogenetic best matches10
Binning long reads in metagenomics datasets using composition and coverage information9
Fast lightweight accurate xenograft sorting9
Evolution through segmental duplications and losses: a Super-Reconciliation approach9
Fast characterization of segmental duplication structure in multiple genome assemblies9
INGOT-DR: an interpretable classifier for predicting drug resistance in M. tuberculosis9
Bayesian optimization with evolutionary and structure-based regularization for directed protein evolution9
A new 1.375-approximation algorithm for sorting by transpositions7
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections7
Disk compression of k-mer sets7
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes6
Space-efficient representation of genomic k-mer count tables6
The Bourque distances for mutation trees of cancers6
Distinguishing linear and branched evolution given single-cell DNA sequencing data of tumors6
Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions6
Parsimonious Clone Tree Integration in cancer5
The distance and median problems in the single-cut-or-join model with single-gene duplications5
Reconstruction of time-consistent species trees5
Heuristic shortest hyperpaths in cell signaling hypergraphs5
Embedding gene trees into phylogenetic networks by conflict resolution algorithms4
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming4
Treewidth-based algorithms for the small parsimony problem on networks3
Fulgor: a fast and compact k-mer index for large-scale matching and color queries3
Pangenomic genotyping with the marker array3
Detecting transcriptomic structural variants in heterogeneous contexts via the Multiple Compatible Arrangements Problem3
A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set3
Exact transcript quantification over splice graphs3
LazyB: fast and cheap genome assembly3
Context-aware seeds for read mapping3
Bi-alignments with affine gaps costs2
On weighted k-mer dictionaries2
Efficient privacy-preserving variable-length substring match for genome sequence2
On an enhancement of RNA probing data using information theory2
Fast and accurate structure probability estimation for simultaneous alignment and folding of RNAs with Markov chains2
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics2
Automated design of dynamic programming schemes for RNA folding with pseudoknots2
Mono-valent salt corrections for RNA secondary structures in the ViennaRNA package2
Precise parallel volumetric comparison of molecular surfaces and electrostatic isopotentials2
All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees2
Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph2
Natural family-free genomic distance2
Approximate search for known gene clusters in new genomes using PQ-trees2
Quantifying steric hindrance and topological obstruction to protein structure superposition2
Constructing phylogenetic networks via cherry picking and machine learning2
Fast computation of genome-metagenome interaction effects2
Heuristic algorithms for best match graph editing2
Shape decomposition algorithms for laser capture microdissection2
Adding hydrogen atoms to molecular models via fragment superimposition2
0.059162139892578