default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th WABI 2019: Niagara Falls, NY, USA
- Katharina T. Huber, Dan Gusfield:
19th International Workshop on Algorithms in Bioinformatics, WABI 2019, September 8-10, 2019, Niagara Falls, NY, USA. LIPIcs 143, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-123-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Jesper Jansson
, Konstantinos Mampentzidis, Sandhya T. P.:
Building a Small and Informative Phylogenetic Supertree. 1:1-1:14 - Roland Wittler:
Alignment- and Reference-Free Phylogenomics with Colored de Bruijn Graphs. 2:1-2:14 - Nathan L. Clement:
Quantified Uncertainty of Flexible Protein-Protein Docking Algorithms. 3:1-3:12 - Sarah A. Christensen, Erin K. Molloy, Pranjal Vachaspati, Tandy J. Warnow:
TRACTION: Fast Non-Parametric Improvement of Estimated Gene Trees. 4:1-4:16 - Kohei Yamada, Zhi-Zhong Chen, Lusheng Wang:
Better Practical Algorithms for rSPR Distance and Hybridization Number. 5:1-5:12 - Georgi D. Georgiev, Kevin F. Dodd, Brian Y. Chen:
pClay: A Precise Parallel Algorithm for Comparing Molecular Surfaces. 6:1-6:13 - Naga Sai Kavya Vaddadi, Rajgopal Srinivasan, Naveen Sivadasan:
Read Mapping on Genome Variation Graphs. 7:1-7:17 - Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding All Maximal Perfect Haplotype Blocks in Linear Time. 8:1-8:9 - Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson:
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation. 9:1-9:13 - Jie Liu, Yuanhao Huang, Ritambhara Singh, Jean-Philippe Vert, William Stafford Noble:
Jointly Embedding Multiple Single-Cell Omics Measurements. 10:1-10:13 - Alexandra Gesine Cauer, Gürkan Yardimci, Jean-Philippe Vert, Nelle Varoquaux, William Stafford Noble:
Inferring Diploid 3D Chromatin Structures from Hi-C Data. 11:1-11:13 - Alexey Markin, Oliver Eulenstein:
Consensus Clusters in Robinson-Foulds Reticulation Networks. 12:1-12:12 - Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
Weighted Minimum-Length Rearrangement Scenarios. 13:1-13:17 - Milad Miladi, Martin Raden, Sebastian Will, Rolf Backofen:
Fast and Accurate Structure Probability Estimation for Simultaneous Alignment and Folding of RNAs. 14:1-14:13 - Hongyi Xin, Mingfu Shao, Carl Kingsford:
Context-Aware Seeds for Read Mapping. 15:1-15:13 - Alexander Tiskin:
Bounded-Length Smith-Waterman Alignment. 16:1-16:12 - Chirag Jain, Haowen Zhang, Alexander T. Dilthey, Srinivas Aluru:
Validating Paired-End Read Alignments in Sequence Graphs. 17:1-17:13 - Yutong Qiu, Cong Ma, Han Xie, Carl Kingsford:
Detecting Transcriptomic Structural Variants in Heterogeneous Contexts via the Multiple Compatible Arrangements Problem. 18:1-18:19 - Qi Wang, Ryan A. Leo Elworth, Tian-Rui Liu, Todd J. Treangen:
Faster Pan-Genome Construction for Efficient Differentiation of Naturally Occurring and Engineered Plasmids with Plaster. 19:1-19:12 - Jakub Truszkowski, Olivier Gascuel, Krister M. Swenson:
Rapidly Computing the Phylogenetic Transfer Index. 20:1-20:12 - Zhen Cao, Jiafan Zhu, Luay Nakhleh:
Empirical Performance of Tree-Based Inference of Phylogenetic Networks. 21:1-21:13 - Mohammad Amin Edrisi, Hamim Zafar, Luay Nakhleh:
A Combinatorial Approach for Single-cell Variant Detection via Phylogenetic Inference. 22:1-22:13 - Natalie Sauerwald, Yihang Shen, Carl Kingsford:
Topological Data Analysis Reveals Principles of Chromosome Structure in Cellular Differentiation. 23:1-23:16 - Evgeny Polevikov, Mikhail Kolmogorov:
Synteny Paths for Assembly Graphs Comparison. 24:1-24:14
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-03-24 00:13 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:
