HTML Export for WABI 2019

Copy to Clipboard Download

<h2>LIPIcs, Volume 143, WABI 2019</h2>
<ul>
<li>
    <span class="authors">Katharina T. Huber and Dan Gusfield</span>
    <span class="title">LIPIcs, Volume 143, WABI&#039;19, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019">10.4230/LIPIcs.WABI.2019</a>
</li>
<li>
    <span class="authors">Katharina T. Huber and Dan Gusfield</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.0">10.4230/LIPIcs.WABI.2019.0</a>
</li>
<li>
    <span class="authors">Jesper Jansson, Konstantinos Mampentzidis, and Sandhya T. P.</span>
    <span class="title">Building a Small and Informative Phylogenetic Supertree</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.1">10.4230/LIPIcs.WABI.2019.1</a>
</li>
<li>
    <span class="authors">Roland Wittler</span>
    <span class="title">Alignment- and Reference-Free Phylogenomics with Colored de Bruijn Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.2">10.4230/LIPIcs.WABI.2019.2</a>
</li>
<li>
    <span class="authors">Nathan L. Clement</span>
    <span class="title">Quantified Uncertainty of Flexible Protein-Protein Docking Algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.3">10.4230/LIPIcs.WABI.2019.3</a>
</li>
<li>
    <span class="authors">Sarah Christensen, Erin K. Molloy, Pranjal Vachaspati, and Tandy Warnow</span>
    <span class="title">TRACTION: Fast Non-Parametric Improvement of Estimated Gene Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.4">10.4230/LIPIcs.WABI.2019.4</a>
</li>
<li>
    <span class="authors">Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang</span>
    <span class="title">Better Practical Algorithms for rSPR Distance and Hybridization Number</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.5">10.4230/LIPIcs.WABI.2019.5</a>
</li>
<li>
    <span class="authors">Georgi D. Georgiev, Kevin F. Dodd, and Brian Y. Chen</span>
    <span class="title">pClay: A Precise Parallel Algorithm for Comparing Molecular Surfaces</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.6">10.4230/LIPIcs.WABI.2019.6</a>
</li>
<li>
    <span class="authors">Kavya Vaddadi, Rajgopal Srinivasan, and Naveen Sivadasan</span>
    <span class="title">Read Mapping on Genome Variation Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.7">10.4230/LIPIcs.WABI.2019.7</a>
</li>
<li>
    <span class="authors">Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, and Jens Stoye</span>
    <span class="title">Finding All Maximal Perfect Haplotype Blocks in Linear Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.8">10.4230/LIPIcs.WABI.2019.8</a>
</li>
<li>
    <span class="authors">Roni Zoller, Meirav Zehavi, and Michal Ziv-Ukelson</span>
    <span class="title">A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.9">10.4230/LIPIcs.WABI.2019.9</a>
</li>
<li>
    <span class="authors">Jie Liu, Yuanhao Huang, Ritambhara Singh, Jean-Philippe Vert, and William Stafford Noble</span>
    <span class="title">Jointly Embedding Multiple Single-Cell Omics Measurements</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.10">10.4230/LIPIcs.WABI.2019.10</a>
</li>
<li>
    <span class="authors">Alexandra Gesine Cauer, Gürkan Yardımcı, Jean-Philippe Vert, Nelle Varoquaux, and William Stafford Noble</span>
    <span class="title">Inferring Diploid 3D Chromatin Structures from Hi-C Data</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.11">10.4230/LIPIcs.WABI.2019.11</a>
</li>
<li>
    <span class="authors">Alexey Markin and Oliver Eulenstein</span>
    <span class="title">Consensus Clusters in Robinson-Foulds Reticulation Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.12">10.4230/LIPIcs.WABI.2019.12</a>
</li>
<li>
    <span class="authors">Pijus Simonaitis, Annie Chateau, and Krister M. Swenson</span>
    <span class="title">Weighted Minimum-Length Rearrangement Scenarios</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.13">10.4230/LIPIcs.WABI.2019.13</a>
</li>
<li>
    <span class="authors">Milad Miladi, Martin Raden, Sebastian Will, and Rolf Backofen</span>
    <span class="title">Fast and Accurate Structure Probability Estimation for Simultaneous Alignment and Folding of RNAs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.14">10.4230/LIPIcs.WABI.2019.14</a>
</li>
<li>
    <span class="authors">Hongyi Xin, Mingfu Shao, and Carl Kingsford</span>
    <span class="title">Context-Aware Seeds for Read Mapping</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.15">10.4230/LIPIcs.WABI.2019.15</a>
</li>
<li>
    <span class="authors">Alexander Tiskin</span>
    <span class="title">Bounded-Length Smith-Waterman Alignment</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.16">10.4230/LIPIcs.WABI.2019.16</a>
</li>
<li>
    <span class="authors">Chirag Jain, Haowen Zhang, Alexander Dilthey, and Srinivas Aluru</span>
    <span class="title">Validating Paired-End Read Alignments in Sequence Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.17">10.4230/LIPIcs.WABI.2019.17</a>
</li>
<li>
    <span class="authors">Yutong Qiu, Cong Ma, Han Xie, and Carl Kingsford</span>
    <span class="title">Detecting Transcriptomic Structural Variants in Heterogeneous Contexts via the Multiple Compatible Arrangements Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.18">10.4230/LIPIcs.WABI.2019.18</a>
</li>
<li>
    <span class="authors">Qi Wang, R. A. Leo Elworth, Tian Rui Liu, and Todd J. Treangen</span>
    <span class="title">Faster Pan-Genome Construction for Efficient Differentiation of Naturally Occurring and Engineered Plasmids with Plaster</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.19">10.4230/LIPIcs.WABI.2019.19</a>
</li>
<li>
    <span class="authors">Jakub Truszkowski, Olivier Gascuel, and Krister M. Swenson</span>
    <span class="title">Rapidly Computing the Phylogenetic Transfer Index</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.20">10.4230/LIPIcs.WABI.2019.20</a>
</li>
<li>
    <span class="authors">Zhen Cao, Jiafan Zhu, and Luay Nakhleh</span>
    <span class="title">Empirical Performance of Tree-Based Inference of Phylogenetic Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.21">10.4230/LIPIcs.WABI.2019.21</a>
</li>
<li>
    <span class="authors">Mohammadamin Edrisi, Hamim Zafar, and Luay Nakhleh</span>
    <span class="title">A Combinatorial Approach for Single-cell Variant Detection via Phylogenetic Inference</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.22">10.4230/LIPIcs.WABI.2019.22</a>
</li>
<li>
    <span class="authors">Natalie Sauerwald, Yihang Shen, and Carl Kingsford</span>
    <span class="title">Topological Data Analysis Reveals Principles of Chromosome Structure in Cellular Differentiation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.23">10.4230/LIPIcs.WABI.2019.23</a>
</li>
<li>
    <span class="authors">Evgeny Polevikov and Mikhail Kolmogorov</span>
    <span class="title">Synteny Paths for Assembly Graphs Comparison</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2019.24">10.4230/LIPIcs.WABI.2019.24</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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail