default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st WABI 2021
- Alessandra Carbone
, Mohammed El-Kebir:
21st International Workshop on Algorithms in Bioinformatics, WABI 2021, August 2-4, 2021, Virtual Conference. LIPIcs 201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-200-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Matthew LeMay, Yi-Chieh Wu, Ran Libeskind-Hadas:
The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. 1:1-1:10 - Yoshiki Nakagawa, Satsuya Ohata, Kana Shimizu:
Efficient Privacy-Preserving Variable-Length Substring Match for Genome Sequence. 2:1-2:23 - Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. 3:1-3:18 - Jason Fan, Skylar Chan, Rob Patro:
Perplexity: Evaluating Transcript Abundance Estimation in the Absence of Ground Truth. 4:1-4:22 - Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot:
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. 5:1-5:12 - Céline Scornavacca, Mathias Weller:
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. 6:1-6:21 - Bertrand Marchand, Yann Ponty, Laurent Bulteau:
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. 7:1-7:23 - Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Space-Efficient Representation of Genomic k-Mer Count Tables. 8:1-8:19 - Palash Sashittal, Simone Zaccaria, Mohammed El-Kebir:
Parsimonious Clone Tree Reconciliation in Cancer. 9:1-9:21 - Brandon Jew, Jiajin Li, Sriram Sankararaman, Jae Hoon Sul:
An Efficient Linear Mixed Model Framework for Meta-Analytic Association Studies Across Multiple Contexts. 10:1-10:17 - Anuradha Wickramarachchi, Yu Lin:
LRBinner: Binning Long Reads in Metagenomics Datasets. 11:1-11:18 - Kazushi Kitaya, Tetsuo Shibuya:
Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition. 12:1-12:17 - Travis Gagie, Garance Gourdel, Giovanni Manzini:
Compressing and Indexing Aligned Readsets. 13:1-13:21 - Ali Ebrahimpour Boroojeny, Sanjay V. Rajopadhye, Hamidreza Chitsaz:
BPPart: RNA-RNA Interaction Partition Function in the Absence of Entropy. 14:1-14:24 - Hamza Iseric, Can Alkan, Faraz Hach, Ibrahim Numanagic:
BISER: Fast Characterization of Segmental Duplication Structure in Multiple Genome Assemblies. 15:1-15:18 - Lucia Williams, Alexandru I. Tomescu, Brendan Mumey:
Flow Decomposition with Subpath Constraints. 16:1-16:15 - Marcin Wawerka, Dawid Dabkowski, Natalia Rutecka, Agnieszka Mykowiecka, Pawel Górecki:
Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks. 17:1-17:21 - Ron Zeira, Geoffrey Mon, Benjamin J. Raphael:
Genome Halving and Aliquoting Under the Copy Number Distance. 18:1-18:25 - Ardalan Naseri, William Yue, Shaojie Zhang, Degui Zhi:
Efficient Haplotype Block Matching in Bi-Directional PBWT. 19:1-19:13 - Spencer Krieger, John D. Kececioglu:
Fast Approximate Shortest Hyperpaths for Inferring Pathways in Cell Signaling Hypergraphs. 20:1-20:20
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-11-09 22:54 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:
