default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th WABI 2020: Pisa, Italy (Virtual Conference)
- Carl Kingsford
, Nadia Pisanti:
20th International Workshop on Algorithms in Bioinformatics, WABI 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). LIPIcs 172, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-161-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Galia R. Zimerman, Dina Svetlitsky, Meirav Zehavi, Michal Ziv-Ukelson:
Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees. 1:1-1:24 - Hooman Zabeti, Nick C. Dexter, Amir Hosein Safari, Nafiseh Sedaghat, Maxwell W. Libbrecht, Leonid Chindelevitch:
An Interpretable Classification Method for Predicting Drug Resistance in M. Tuberculosis. 2:1-2:18 - Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga:
Natural Family-Free Genomic Distance. 3:1-3:23 - Jens Zentgraf, Sven Rahmann:
Fast Lightweight Accurate Xenograft Sorting. 4:1-4:16 - Leah L. Weber, Mohammed El-Kebir:
Phyolin: Identifying a Linear Perfect Phylogeny in Single-Cell DNA Sequencing Data of Tumors. 5:1-5:14 - Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau:
The Longest Run Subsequence Problem. 6:1-6:13 - Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. 7:1-7:18 - Vijini Mallawaarachchi, Anuradha Wickramarachchi, Yu Lin:
GraphBin2: Refined and Overlapped Binning of Metagenomic Contigs Using Assembly Graphs. 8:1-8:21 - Kingshuk Mukherjee, Massimiliano Rossi, Leena Salmela, Christina Boucher:
Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn Graph. 9:1-9:16 - Thomas Gatter, Sarah von Löhneysen, Polina Drozdova, Tom Hartmann, Peter F. Stadler:
Economic Genome Assembly from Low Coverage Illumina and Nanopore Data. 10:1-10:22 - Yoann Dufresne, Chen Sun, Pierre Marijon, Dominique Lavenier, Cédric Chauve, Rayan Chikhi:
A Graph-Theoretic Barcode Ordering Model for Linked-Reads. 11:1-11:17 - Cong Ma, Hongyu Zheng, Carl Kingsford:
Exact Transcript Quantification Over Splice Graphs. 12:1-12:18 - Leonie Selbach, Tobias Kowalski, Klaus Gerwert, Maike Buchin, Axel Mosig:
Shape Decomposition Algorithms for Laser Capture Microdissection. 13:1-13:17 - Katharina Jahn, Niko Beerenwinkel, Louxin Zhang:
The Bourque Distances for Mutation Trees of Cancers. 14:1-14:22 - Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow:
Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees. 15:1-15:17 - Amatur Rahman, Rayan Chikhi, Paul Medvedev:
Disk Compression of k-mer Sets. 16:1-16:18 - Arun Ganesh, Aaron Sy:
Near-Linear Time Edit Distance for Indel Channels. 17:1-17:18 - Trevor S. Frisby, Christopher J. Langmead:
Fold Family-Regularized Bayesian Optimization for Directed Protein Evolution. 18:1-18:17 - Domenico Cantone, Simone Faro, Arianna Pavone:
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. 19:1-19: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-01 15:16 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:
