HTML Export for WABI 2021

Copy to Clipboard Download

<h2>LIPIcs, Volume 201, WABI 2021</h2>
<ul>
<li>
    <span class="authors">Alessandra Carbone and Mohammed El-Kebir</span>
    <span class="title">LIPIcs, Volume 201, WABI 2021, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021">10.4230/LIPIcs.WABI.2021</a>
</li>
<li>
    <span class="authors">Alessandra Carbone and Mohammed El-Kebir</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.0">10.4230/LIPIcs.WABI.2021.0</a>
</li>
<li>
    <span class="authors">Matthew LeMay, Yi-Chieh Wu, and Ran Libeskind-Hadas</span>
    <span class="title">The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.1">10.4230/LIPIcs.WABI.2021.1</a>
</li>
<li>
    <span class="authors">Yoshiki Nakagawa, Satsuya Ohata, and Kana Shimizu</span>
    <span class="title">Efficient Privacy-Preserving Variable-Length Substring Match for Genome Sequence</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.2">10.4230/LIPIcs.WABI.2021.2</a>
</li>
<li>
    <span class="authors">Yishu Wang, Arnaud Mary, Marie-France Sagot, and Blerina Sinaimeri</span>
    <span class="title">Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.3">10.4230/LIPIcs.WABI.2021.3</a>
</li>
<li>
    <span class="authors">Jason Fan, Skylar Chan, and Rob Patro</span>
    <span class="title">Perplexity: Evaluating Transcript Abundance Estimation in the Absence of Ground Truth</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.4">10.4230/LIPIcs.WABI.2021.4</a>
</li>
<li>
    <span class="authors">Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, and Jérôme Monnot</span>
    <span class="title">The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.5">10.4230/LIPIcs.WABI.2021.5</a>
</li>
<li>
    <span class="authors">Celine Scornavacca and Mathias Weller</span>
    <span class="title">Treewidth-Based Algorithms for the Small Parsimony Problem on Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.6">10.4230/LIPIcs.WABI.2021.6</a>
</li>
<li>
    <span class="authors">Bertrand Marchand, Yann Ponty, and Laurent Bulteau</span>
    <span class="title">Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.7">10.4230/LIPIcs.WABI.2021.7</a>
</li>
<li>
    <span class="authors">Yoshihiro Shibuya, Djamal Belazzougui, and Gregory Kucherov</span>
    <span class="title">Space-Efficient Representation of Genomic k-Mer Count Tables</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.8">10.4230/LIPIcs.WABI.2021.8</a>
</li>
<li>
    <span class="authors">Palash Sashittal, Simone Zaccaria, and Mohammed El-Kebir</span>
    <span class="title">Parsimonious Clone Tree Reconciliation in Cancer</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.9">10.4230/LIPIcs.WABI.2021.9</a>
</li>
<li>
    <span class="authors">Brandon Jew, Jiajin Li, Sriram Sankararaman, and Jae Hoon Sul</span>
    <span class="title">An Efficient Linear Mixed Model Framework for Meta-Analytic Association Studies Across Multiple Contexts</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.10">10.4230/LIPIcs.WABI.2021.10</a>
</li>
<li>
    <span class="authors">Anuradha Wickramarachchi and Yu Lin</span>
    <span class="title">LRBinner: Binning Long Reads in Metagenomics Datasets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.11">10.4230/LIPIcs.WABI.2021.11</a>
</li>
<li>
    <span class="authors">Kazushi Kitaya and Tetsuo Shibuya</span>
    <span class="title">Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.12">10.4230/LIPIcs.WABI.2021.12</a>
</li>
<li>
    <span class="authors">Travis Gagie, Garance Gourdel, and Giovanni Manzini</span>
    <span class="title">Compressing and Indexing Aligned Readsets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.13">10.4230/LIPIcs.WABI.2021.13</a>
</li>
<li>
    <span class="authors">Ali Ebrahimpour-Boroojeny, Sanjay Rajopadhye, and Hamidreza Chitsaz</span>
    <span class="title">BPPart: RNA-RNA Interaction Partition Function in the Absence of Entropy</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.14">10.4230/LIPIcs.WABI.2021.14</a>
</li>
<li>
    <span class="authors">Hamza Išerić, Can Alkan, Faraz Hach, and Ibrahim Numanagić</span>
    <span class="title">BISER: Fast Characterization of Segmental Duplication Structure in Multiple Genome Assemblies</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.15">10.4230/LIPIcs.WABI.2021.15</a>
</li>
<li>
    <span class="authors">Lucia Williams, Alexandru I. Tomescu, and Brendan Mumey</span>
    <span class="title">Flow Decomposition with Subpath Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.16">10.4230/LIPIcs.WABI.2021.16</a>
</li>
<li>
    <span class="authors">Marcin Wawerka, Dawid Dąbkowski, Natalia Rutecka, Agnieszka Mykowiecka, and Paweł Górecki</span>
    <span class="title">Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.17">10.4230/LIPIcs.WABI.2021.17</a>
</li>
<li>
    <span class="authors">Ron Zeira, Geoffrey Mon, and Benjamin J. Raphael</span>
    <span class="title">Genome Halving and Aliquoting Under the Copy Number Distance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.18">10.4230/LIPIcs.WABI.2021.18</a>
</li>
<li>
    <span class="authors">Ardalan Naseri, William Yue, Shaojie Zhang, and Degui Zhi</span>
    <span class="title">Efficient Haplotype Block Matching in Bi-Directional PBWT</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.19">10.4230/LIPIcs.WABI.2021.19</a>
</li>
<li>
    <span class="authors">Spencer Krieger and John Kececioglu</span>
    <span class="title">Fast Approximate Shortest Hyperpaths for Inferring Pathways in Cell Signaling Hypergraphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2021.20">10.4230/LIPIcs.WABI.2021.20</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode