HTML Export for WABI 2024

Copy to Clipboard Download

<h2>LIPIcs, Volume 312, WABI 2024</h2>
<ul>
<li>
    <span class="authors">Solon P. Pissis and Wing-Kin Sung</span>
    <span class="title">LIPIcs, Volume 312, WABI 2024, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024">10.4230/LIPIcs.WABI.2024</a>
</li>
<li>
    <span class="authors">Solon P. Pissis and Wing-Kin Sung</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.0">10.4230/LIPIcs.WABI.2024.0</a>
</li>
<li>
    <span class="authors">Tomáš Vinař</span>
    <span class="title">Bioinformatics of Pathogens (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.1">10.4230/LIPIcs.WABI.2024.1</a>
</li>
<li>
    <span class="authors">Luís Cunha, Ignasi Sau, and Uéverton Souza</span>
    <span class="title">On the Complexity of the Median and Closest Permutation Problems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.2">10.4230/LIPIcs.WABI.2024.2</a>
</li>
<li>
    <span class="authors">Yao-ban Chan</span>
    <span class="title">An Efficient Algorithm for the Reconciliation of a Gene Network and Species Tree</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.3">10.4230/LIPIcs.WABI.2024.3</a>
</li>
<li>
    <span class="authors">Stephen Hwang, Nathaniel K. Brown, Omar Y. Ahmed, Katharine M. Jenike, Sam Kovaka, Michael C. Schatz, and Ben Langmead</span>
    <span class="title">MEM-Based Pangenome Indexing for k-mer Queries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.4">10.4230/LIPIcs.WABI.2024.4</a>
</li>
<li>
    <span class="authors">Lukas Hübner and Alexandros Stamatakis</span>
    <span class="title">Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.5">10.4230/LIPIcs.WABI.2024.5</a>
</li>
<li>
    <span class="authors">Mahmudur Rahman Hera and David Koslicki</span>
    <span class="title">Cosine Similarity Estimation Using FracMinHash: Theoretical Analysis, Safety Conditions, and Implementation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.6">10.4230/LIPIcs.WABI.2024.6</a>
</li>
<li>
    <span class="authors">Yuanyuan Qi and Mohammed El-Kebir</span>
    <span class="title">Sapling: Inferring and Summarizing Tumor Phylogenies from Bulk Data Using Backbone Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.7">10.4230/LIPIcs.WABI.2024.7</a>
</li>
<li>
    <span class="authors">Sebastian Schmidt, Santeri Toivonen, Paul Medvedev, and Alexandru I. Tomescu</span>
    <span class="title">Applying the Safe-And-Complete Framework to Practical Genome Assembly</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.8">10.4230/LIPIcs.WABI.2024.8</a>
</li>
<li>
    <span class="authors">Tsuyoshi Urata, Manato Yokoyama, and Momoko Hayamizu</span>
    <span class="title">Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.9">10.4230/LIPIcs.WABI.2024.9</a>
</li>
<li>
    <span class="authors">Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie, and Jan Fostier</span>
    <span class="title">b-move: Faster Bidirectional Character Extensions in a Run-Length Compressed Index</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.10">10.4230/LIPIcs.WABI.2024.10</a>
</li>
<li>
    <span class="authors">Ragnar Groot Koerkamp and Giulio Ermanno Pibiri</span>
    <span class="title">The mod-minimizer: A Simple and Efficient Sampling Algorithm for Long k-mers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.11">10.4230/LIPIcs.WABI.2024.11</a>
</li>
<li>
    <span class="authors">Leonard Bohnenkämper, Jens Stoye, and Daniel Dörr</span>
    <span class="title">Reconstructing Rearrangement Phylogenies of Natural Genomes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.12">10.4230/LIPIcs.WABI.2024.12</a>
</li>
<li>
    <span class="authors">Md. Hasin Abrar and Paul Medvedev</span>
    <span class="title">PLA-index: A k-mer Index Exploiting Rank Curve Linearity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.13">10.4230/LIPIcs.WABI.2024.13</a>
</li>
<li>
    <span class="authors">Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Esteban Gabory, Roberto Grossi, and Nadia Pisanti</span>
    <span class="title">A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.14">10.4230/LIPIcs.WABI.2024.14</a>
</li>
<li>
    <span class="authors">Jens Zentgraf and Sven Rahmann</span>
    <span class="title">Swiftly Identifying Strongly Unique k-Mers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.15">10.4230/LIPIcs.WABI.2024.15</a>
</li>
<li>
    <span class="authors">Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard, and Manuel Lafond</span>
    <span class="title">Finding Maximum Common Contractions Between Phylogenetic Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.16">10.4230/LIPIcs.WABI.2024.16</a>
</li>
<li>
    <span class="authors">Ragnar Groot Koerkamp</span>
    <span class="title">A*PA2: Up to 19× Faster Exact Global Alignment</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.17">10.4230/LIPIcs.WABI.2024.17</a>
</li>
<li>
    <span class="authors">Kimon Boehmer, Sarah J. Berkemer, Sebastian Will, and Yann Ponty</span>
    <span class="title">RNA Triplet Repeats: Improved Algorithms for Structure Prediction and Interactions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.18">10.4230/LIPIcs.WABI.2024.18</a>
</li>
<li>
    <span class="authors">Théo Boury, Laurent Bulteau, and Yann Ponty</span>
    <span class="title">RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.19">10.4230/LIPIcs.WABI.2024.19</a>
</li>
<li>
    <span class="authors">Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales, and Manuel Lafond</span>
    <span class="title">The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.20">10.4230/LIPIcs.WABI.2024.20</a>
</li>
<li>
    <span class="authors">Giovanni Buzzega, Alessio Conte, Roberto Grossi, and Giulia Punzi</span>
    <span class="title">McDag: Indexing Maximal Common Subsequences in Practice</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.21">10.4230/LIPIcs.WABI.2024.21</a>
</li>
<li>
    <span class="authors">Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben-Yehezkel, Ryan Kelley, and Mingfu Shao</span>
    <span class="title">Anchorage Accurately Assembles Anchor-Flanked Synthetic Long Reads</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.22">10.4230/LIPIcs.WABI.2024.22</a>
</li>
<li>
    <span class="authors">Adam Cicherski, Anna Lisiecka, and Norbert Dojer</span>
    <span class="title">AlfaPang: Alignment Free Algorithm for Pangenome Graph Construction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2024.23">10.4230/LIPIcs.WABI.2024.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