default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms for Molecular Biology, Volume 14
Volume 14, Number 1, December 2019
- Martin S. Engler
, Bertrand Caron, Lourens E. Veen, Daan P. Geerke, Alan E. Mark, Gunnar W. Klau:
Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach. 1:1-1:10 - Qiuyi Zhang, Satish Rao, Tandy J. Warnow:
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. 2:1-2:12 - Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
SNPs detection by eBWT positional clustering. 3:1-3:13 - Emre Sefer, Carl Kingsford:
Semi-nonparametric modeling of topological domain formation from epigenetic data. 4:1-4:11 - Jimmy Wu, Alex Khodaverdian, Benjamin Weitz, Nir Yosef:
Connectivity problems on heterogeneous graphs. 5:1-5:17 - Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. 6:1-6:15 - Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling multiple genes trees via segmental duplications and losses. 7:1-7:19 - Riku Walve, Pasi Rastas, Leena Salmela:
Kermit: linkage map guided long read assembly. 8:1-8:10 - Alexandre Lemos, Inês Lynce, Pedro T. Monteiro:
Repairing Boolean logical models from time-series data using Answer Set Programming. 9:1-9:16 - Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin:
Differentially mutated subnetworks discovery. 10:1-10:11 - Yohei M. Rosen, Benedict J. Paten:
An average-case sublinear forward algorithm for the haploid Li and Stephens model. 11:1-11:12 - Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Linear time minimum segmentation enables scalable founder reconstruction. 12:1-12:15 - Christina Boucher, Travis Gagie, Alan Kuhnle, Ben Langmead, Giovanni Manzini, Taher Mun:
Prefix-free parsing for building big BWTs. 13:1-13:15 - Erin K. Molloy, Tandy J. Warnow:
Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge. 14:1-14:17 - Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
A general framework for genome rearrangement with biological constraints. 15:1-15:14 - Leonid Chindelevitch, Sean La, Joao Meidanis:
A cubic algorithm for the generalized rank median of three genomes. 16:1-16:16 - Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, Süleyman Cenk Sahinalp:
A multi-labeled tree dissimilarity measure for comparing "clonal trees" of tumor progression. 17:1-17:18 - Yue Zhang, Chunfang Zheng, David Sankoff:
A branching process for homology distribution-based inference of polyploidy, speciation and loss. 18:1-18:13 - John Wiedenhoeft, Alex Cagan, Rimma Kozhemyakina, Rimma Gulevich, Alexander Schliep:
Bayesian localization of CNV candidates in WGS data within minutes. 20:1-20:16 - Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Super short operations on both gene order and intergenic sizes. 21:1-21:17 - Christophe Ambroise, Alia Dehman, Pierre Neuvial, Guillem Rigaill, Nathalie Villa-Vialaneix:
Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics. 22:1-22:14 - Hisanori Kiryu, Yuto Ichikawa, Yasuhiro Kojima:
TMRS: an algorithm for computing the time to the most recent substitution event from a multiple alignment column. 23:1-23:14 - Elizabeth S. Allman, Hector Baños, John A. Rhodes:
NANUQ: a method for inferring species networks from gene trees under the coalescent model. 24 - Martin D. Muggli, Simon J. Puglisi, Christina Boucher:
Kohdista: an efficient method to index and query possible Rmap alignments. 25
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
