HTML Export for WABI 2023

Copy to Clipboard Download

<h2>LIPIcs, Volume 273, WABI 2023</h2>
<ul>
<li>
    <span class="authors">Djamal Belazzougui and Aïda Ouangraoua</span>
    <span class="title">LIPIcs, Volume 273, WABI 2023, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023">10.4230/LIPIcs.WABI.2023</a>
</li>
<li>
    <span class="authors">Djamal Belazzougui and Aïda Ouangraoua</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.0">10.4230/LIPIcs.WABI.2023.0</a>
</li>
<li>
    <span class="authors">Teresa M. Przytycka</span>
    <span class="title">Algorithmic Approaches to Study Mutational Processes in Cancer (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.1">10.4230/LIPIcs.WABI.2023.1</a>
</li>
<li>
    <span class="authors">Chengze Shen, Baqiao Liu, Kelly P. Williams, and Tandy Warnow</span>
    <span class="title">EMMA: Adding Sequences into a Constraint Alignment with High Accuracy and Scalability (Abstract)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.2">10.4230/LIPIcs.WABI.2023.2</a>
</li>
<li>
    <span class="authors">Eleanor Wedell, Chengze Shen, and Tandy Warnow</span>
    <span class="title">BATCH-SCAMPP: Scaling Phylogenetic Placement Methods to Place Many Sequences (Abstract)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.3">10.4230/LIPIcs.WABI.2023.3</a>
</li>
<li>
    <span class="authors">Shayesteh Arasti and Siavash Mirarab</span>
    <span class="title">Optimal Subtree Prune and Regraft for Quartet Score in Sub-Quadratic Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.4">10.4230/LIPIcs.WABI.2023.4</a>
</li>
<li>
    <span class="authors">Junyan Dai, Tobias Rubel, Yunheng Han, and Erin K. Molloy</span>
    <span class="title">Leveraging Constraints Plus Dynamic Programming for the Large Dollo Parsimony Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.5">10.4230/LIPIcs.WABI.2023.5</a>
</li>
<li>
    <span class="authors">Paweł Górecki, Natalia Rutecka, Agnieszka Mykowiecka, and Jarosław Paszek</span>
    <span class="title">Simultaneous Reconstruction of Duplication Episodes and Gene-Species Mappings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.6">10.4230/LIPIcs.WABI.2023.6</a>
</li>
<li>
    <span class="authors">Leo van Iersel, Mark Jones, Esther Julien, and Yukihiro Murakami</span>
    <span class="title">Making a Network Orchard by Adding Leaves</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.7">10.4230/LIPIcs.WABI.2023.7</a>
</li>
<li>
    <span class="authors">Yunheng Han and Erin K. Molloy</span>
    <span class="title">Quartets Enable Statistically Consistent Estimation of Cell Lineage Trees Under an Unbiased Error and Missingness Model (Abstract)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.8">10.4230/LIPIcs.WABI.2023.8</a>
</li>
<li>
    <span class="authors">Mrinmoy Saha Roddur, Sagi Snir, and Mohammed El-Kebir</span>
    <span class="title">Inferring Temporally Consistent Migration Histories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.9">10.4230/LIPIcs.WABI.2023.9</a>
</li>
<li>
    <span class="authors">Nicola Rizzo, Manuel Cáceres, and Veli Mäkinen</span>
    <span class="title">Finding Maximal Exact Matches in Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.10">10.4230/LIPIcs.WABI.2023.10</a>
</li>
<li>
    <span class="authors">Yutong Qiu, Yihang Shen, and Carl Kingsford</span>
    <span class="title">Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.11">10.4230/LIPIcs.WABI.2023.11</a>
</li>
<li>
    <span class="authors">Jyotshna Rajput, Ghanshyam Chandra, and Chirag Jain</span>
    <span class="title">Co-Linear Chaining on Pangenome Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.12">10.4230/LIPIcs.WABI.2023.12</a>
</li>
<li>
    <span class="authors">Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, and Travis Gagie</span>
    <span class="title">Acceleration of FM-Index Queries Through Prefix-Free Parsing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.13">10.4230/LIPIcs.WABI.2023.13</a>
</li>
<li>
    <span class="authors">Tizian Schulz and Paul Medvedev</span>
    <span class="title">Exact Sketch-Based Read Mapping</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.14">10.4230/LIPIcs.WABI.2023.14</a>
</li>
<li>
    <span class="authors">Timothé Rouzé, Igor Martayan, Camille Marchet, and Antoine Limasset</span>
    <span class="title">Fractional Hitting Sets for Efficient and Lightweight Genomic Data Sketching</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.15">10.4230/LIPIcs.WABI.2023.15</a>
</li>
<li>
    <span class="authors">Jamshed Khan, Tobias Rubel, Laxman Dhulipala, Erin Molloy, and Rob Patro</span>
    <span class="title">Fast, Parallel, and Cache-Friendly Suffix Array Construction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.16">10.4230/LIPIcs.WABI.2023.16</a>
</li>
<li>
    <span class="authors">Amatur Rahman, Yoann Dufresne, and Paul Medvedev</span>
    <span class="title">Compression Algorithm for Colored de Bruijn Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.17">10.4230/LIPIcs.WABI.2023.17</a>
</li>
<li>
    <span class="authors">Jason Fan, Noor Pratap Singh, Jamshed Khan, Giulio Ermanno Pibiri, and Rob Patro</span>
    <span class="title">Fulgor: A Fast and Compact {k-mer} Index for Large-Scale Matching and Color Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.18">10.4230/LIPIcs.WABI.2023.18</a>
</li>
<li>
    <span class="authors">Mateo Gray, Sebastian Will, and Hosna Jabbari</span>
    <span class="title">SparseRNAFolD: Sparse RNA Pseudoknot-Free Folding Including Dangles</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.19">10.4230/LIPIcs.WABI.2023.19</a>
</li>
<li>
    <span class="authors">Théo Boury, Yann Ponty, and Vladimir Reinharz</span>
    <span class="title">Automatic Exploration of the Natural Variability of RNA Non-Canonical Geometric Patterns with a Parameterized Sampling Technique</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.20">10.4230/LIPIcs.WABI.2023.20</a>
</li>
<li>
    <span class="authors">Xinyu Gu, Yuanyuan Qi, and Mohammed El-Kebir</span>
    <span class="title">Balancing Minimum Free Energy and Codon Adaptation Index for Pareto Optimal RNA Design</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.21">10.4230/LIPIcs.WABI.2023.21</a>
</li>
<li>
    <span class="authors">Leonard Bohnenkämper</span>
    <span class="title">Bridging Disparate Views on the DCJ-Indel Model for a Capping-Free Solution to the Natural Distance Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.22">10.4230/LIPIcs.WABI.2023.22</a>
</li>
<li>
    <span class="authors">Mohsen Ferdosi, Yuejun Ge, and Carl Kingsford</span>
    <span class="title">Reinforcement Learning for Robotic Liquid Handler Planning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2023.23">10.4230/LIPIcs.WABI.2023.23</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