<h2>LIPIcs, Volume 113, WABI 2018</h2>
<ul>
<li>
<span class="authors">Laxmi Parida and Esko Ukkonen</span>
<span class="title">LIPIcs, Volume 113, WABI'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018">10.4230/LIPIcs.WABI.2018</a>
</li>
<li>
<span class="authors">Laxmi Parida and Esko Ukkonen</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.0">10.4230/LIPIcs.WABI.2018.0</a>
</li>
<li>
<span class="authors">Hooman Zabeti, Tamon Stephen, Bonnie Berger, and Leonid Chindelevitch</span>
<span class="title">A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.1">10.4230/LIPIcs.WABI.2018.1</a>
</li>
<li>
<span class="authors">Christina Boucher, Travis Gagie, Alan Kuhnle, and Giovanni Manzini</span>
<span class="title">Prefix-Free Parsing for Building Big BWTs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.2">10.4230/LIPIcs.WABI.2018.2</a>
</li>
<li>
<span class="authors">Nicola Prezza, Nadia Pisanti, Marinella Sciortino, and Giovanna Rosone</span>
<span class="title">Detecting Mutations by eBWT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.3">10.4230/LIPIcs.WABI.2018.3</a>
</li>
<li>
<span class="authors">Jouni Sirén, Erik Garrison, Adam M. Novak, Benedict J. Paten, and Richard Durbin</span>
<span class="title">Haplotype-aware graph indexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.4">10.4230/LIPIcs.WABI.2018.4</a>
</li>
<li>
<span class="authors">Riccardo Dondi, Manuel Lafond, and Celine Scornavacca</span>
<span class="title">Reconciling Multiple Genes Trees via Segmental Duplications and Losses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.5">10.4230/LIPIcs.WABI.2018.5</a>
</li>
<li>
<span class="authors">Tamal K. Dey and Sayan Mandal</span>
<span class="title">Protein Classification with Improved Topological Data Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.6">10.4230/LIPIcs.WABI.2018.6</a>
</li>
<li>
<span class="authors">Barak Sternberg and Roded Sharan</span>
<span class="title">A Dynamic Algorithm for Network Propagation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.7">10.4230/LIPIcs.WABI.2018.7</a>
</li>
<li>
<span class="authors">Qiuyi (Richard) Zhang, Satish Rao, and Tandy Warnow</span>
<span class="title">New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.8">10.4230/LIPIcs.WABI.2018.8</a>
</li>
<li>
<span class="authors">Yohei M. Rosen and Benedict J. Paten</span>
<span class="title">An Average-Case Sublinear Exact Li and Stephens Forward Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.9">10.4230/LIPIcs.WABI.2018.9</a>
</li>
<li>
<span class="authors">Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, and Guilherme P. Telles</span>
<span class="title">External memory BWT and LCP computation for sequence collections with applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.10">10.4230/LIPIcs.WABI.2018.10</a>
</li>
<li>
<span class="authors">Riku Walve, Pasi Rastas, and Leena Salmela</span>
<span class="title">Kermit: Guided Long Read Assembly using Coloured Overlap Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.11">10.4230/LIPIcs.WABI.2018.11</a>
</li>
<li>
<span class="authors">Martin D. Muggli, Simon J. Puglisi, and Christina Boucher</span>
<span class="title">A Succinct Solution to Rmap Alignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.12">10.4230/LIPIcs.WABI.2018.12</a>
</li>
<li>
<span class="authors">Till Hartmann and Sven Rahmann</span>
<span class="title">Spalter: A Meta Machine Learning Approach to Distinguish True DNA Variants from Sequencing Artefacts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.13">10.4230/LIPIcs.WABI.2018.13</a>
</li>
<li>
<span class="authors">Saugata Basu, Filippo Utro, and Laxmi Parida</span>
<span class="title">Essential Simplices in Persistent Homology and Subtle Admixture Detection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.14">10.4230/LIPIcs.WABI.2018.14</a>
</li>
<li>
<span class="authors">Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, and Veli Mäkinen</span>
<span class="title">Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.15">10.4230/LIPIcs.WABI.2018.15</a>
</li>
<li>
<span class="authors">Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark, and Gunnar W. Klau</span>
<span class="title">Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.16">10.4230/LIPIcs.WABI.2018.16</a>
</li>
<li>
<span class="authors">Stéphane Chrétien, Christophe Guyeux, and Serge Moulin</span>
<span class="title">l1-Penalised Ordinal Polytomous Regression Estimators with Application to Gene Expression Studies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.17">10.4230/LIPIcs.WABI.2018.17</a>
</li>
<li>
<span class="authors">Morteza Chalabi Hajkarim, Eli Upfal, and Fabio Vandin</span>
<span class="title">Differentially Mutated Subnetworks Discovery</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.18">10.4230/LIPIcs.WABI.2018.18</a>
</li>
<li>
<span class="authors">Ryan A. Leo Elworth, Chabrielle Allen, Travis Benedict, Peter Dulworth, and Luay Nakhleh</span>
<span class="title">DGEN: A Test Statistic for Detection of General Introgression Scenarios</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.19">10.4230/LIPIcs.WABI.2018.19</a>
</li>
<li>
<span class="authors">Mehrdad Mansouri, Julian Booth, Margaryta Vityaz, Cedric Chauve, and Leonid Chindelevitch</span>
<span class="title">PRINCE: Accurate Approximation of the Copy Number of Tandem Repeats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.20">10.4230/LIPIcs.WABI.2018.20</a>
</li>
<li>
<span class="authors">Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, and Giovanna Rosone</span>
<span class="title">Degenerate String Comparison and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.21">10.4230/LIPIcs.WABI.2018.21</a>
</li>
<li>
<span class="authors">Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, and S. Cenk Sahinalp</span>
<span class="title">A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.22">10.4230/LIPIcs.WABI.2018.22</a>
</li>
<li>
<span class="authors">Kai Dührkop, Marie A. Lataretu, W. Timothy J. White, and Sebastian Böcker</span>
<span class="title">Heuristic Algorithms for the Maximum Colorful Subtree Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.23">10.4230/LIPIcs.WABI.2018.23</a>
</li>
<li>
<span class="authors">Mohammed El-Kebir</span>
<span class="title">Parsimonious Migration History Problem: Complexity and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.24">10.4230/LIPIcs.WABI.2018.24</a>
</li>
<li>
<span class="authors">Szymon Majewski, Michal Aleksander Ciach, Michal Startek, Wanda Niemyska, Blazej Miasojedow, and Anna Gambin</span>
<span class="title">The Wasserstein Distance as a Dissimilarity Measure for Mass Spectra with Application to Spectral Deconvolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2018.25">10.4230/LIPIcs.WABI.2018.25</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
Feedback for Dagstuhl Publishing