HTML Export for WABI 2022

Copy to Clipboard Download

<h2>LIPIcs, Volume 242, WABI 2022</h2>
<ul>
<li>
    <span class="authors">Christina Boucher and Sven Rahmann</span>
    <span class="title">LIPIcs, Volume 242, WABI 2022, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022">10.4230/LIPIcs.WABI.2022</a>
</li>
<li>
    <span class="authors">Christina Boucher and Sven Rahmann</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.0">10.4230/LIPIcs.WABI.2022.0</a>
</li>
<li>
    <span class="authors">Leena Salmela</span>
    <span class="title">Efficient Solutions to Biological Problems Using de Bruijn Graphs (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.1">10.4230/LIPIcs.WABI.2022.1</a>
</li>
<li>
    <span class="authors">Sebastian Schmidt and Jarno N. Alanko</span>
    <span class="title">Eulertigs: Minimum Plain Text Representation of k-mer Sets Without Repetitions in Linear Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.2">10.4230/LIPIcs.WABI.2022.2</a>
</li>
<li>
    <span class="authors">Alitzel López Sánchez and Manuel Lafond</span>
    <span class="title">Predicting Horizontal Gene Transfers with Perfect Transfer Networks</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.3">10.4230/LIPIcs.WABI.2022.3</a>
</li>
<li>
    <span class="authors">Ahsan Sanaullah, Degui Zhi, and Shaoije Zhang</span>
    <span class="title">Haplotype Threading Using the Positional Burrows-Wheeler Transform</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.4">10.4230/LIPIcs.WABI.2022.4</a>
</li>
<li>
    <span class="authors">Mathieu Gascon and Nadia El-Mabrouk</span>
    <span class="title">Non-Binary Tree Reconciliation with Endosymbiotic Gene Transfer</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.5">10.4230/LIPIcs.WABI.2022.5</a>
</li>
<li>
    <span class="authors">Konstantinn Bonnet, Tobias Marschall, and Daniel Doerr¹</span>
    <span class="title">Constructing Founder Sets Under Allelic and Non-Allelic Homologous Recombination</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.6">10.4230/LIPIcs.WABI.2022.6</a>
</li>
<li>
    <span class="authors">Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, and Yann Ponty</span>
    <span class="title">Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.7">10.4230/LIPIcs.WABI.2022.7</a>
</li>
<li>
    <span class="authors">Baqiao Liu and Tandy Warnow</span>
    <span class="title">Fast and Accurate Species Trees from Weighted Internode Distances</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.8">10.4230/LIPIcs.WABI.2022.8</a>
</li>
<li>
    <span class="authors">Giulio Ermanno Pibiri</span>
    <span class="title">On Weighted k-mer Dictionaries</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.9">10.4230/LIPIcs.WABI.2022.9</a>
</li>
<li>
    <span class="authors">Yoshihiko Suzuki and Gene Myers</span>
    <span class="title">Accurate k-mer Classification Using Read Profiles</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.10">10.4230/LIPIcs.WABI.2022.10</a>
</li>
<li>
    <span class="authors">Eden Ozery, Meirav Zehavi, and Michal Ziv-Ukelson</span>
    <span class="title">New Algorithms for Structure Informed Genome Rearrangement</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.11">10.4230/LIPIcs.WABI.2022.11</a>
</li>
<li>
    <span class="authors">Jens Zentgraf and Sven Rahmann</span>
    <span class="title">Fast Gapped k-mer Counting with Subdivided Multi-Way Bucketed Cuckoo Hash Tables</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.12">10.4230/LIPIcs.WABI.2022.12</a>
</li>
<li>
    <span class="authors">Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, and Jens Stoye</span>
    <span class="title">A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.13">10.4230/LIPIcs.WABI.2022.13</a>
</li>
<li>
    <span class="authors">Yoshihiro Shibuya, Djamal Belazzougui, and Gregory Kucherov</span>
    <span class="title">Efficient Reconciliation of Genomic Datasets of High Similarity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.14">10.4230/LIPIcs.WABI.2022.14</a>
</li>
<li>
    <span class="authors">Wei Wei and David Koslicki</span>
    <span class="title">WGSUniFrac: Applying UniFrac Metric to Whole Genome Shotgun Data</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.15">10.4230/LIPIcs.WABI.2022.15</a>
</li>
<li>
    <span class="authors">Giulia Bernardini, Leo van Iersel, Esther Julien, and Leen Stougie</span>
    <span class="title">Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.16">10.4230/LIPIcs.WABI.2022.16</a>
</li>
<li>
    <span class="authors">Daniel Gibney, Sharma V. Thankachan, and Srinivas Aluru</span>
    <span class="title">Feasibility of Flow Decomposition with Subpath Constraints in Linear Time</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.17">10.4230/LIPIcs.WABI.2022.17</a>
</li>
<li>
    <span class="authors">Adrián Goga and Andrej Baláž</span>
    <span class="title">Prefix-Free Parsing for Building Large Tunnelled Wheeler Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.18">10.4230/LIPIcs.WABI.2022.18</a>
</li>
<li>
    <span class="authors">Taher Mun, Naga Sai Kavya Vaddadi, and Ben Langmead</span>
    <span class="title">Pangenomic Genotyping with the Marker Array</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.19">10.4230/LIPIcs.WABI.2022.19</a>
</li>
<li>
    <span class="authors">Zsuzsanna Lipták, Francesco Masillo, and Simon J. Puglisi</span>
    <span class="title">Suffix Sorting via Matching Statistics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.20">10.4230/LIPIcs.WABI.2022.20</a>
</li>
<li>
    <span class="authors">Pijus Simonaitis and Benjamin J. Raphael</span>
    <span class="title">A Maximum Parsimony Principle for Multichromosomal Complex Genome Rearrangements</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.21">10.4230/LIPIcs.WABI.2022.21</a>
</li>
<li>
    <span class="authors">Ke Chen and Mingfu Shao</span>
    <span class="title">Locality-Sensitive Bucketing Functions for the Edit Distance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.22">10.4230/LIPIcs.WABI.2022.22</a>
</li>
<li>
    <span class="authors">Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, and Lorenzo Tattini</span>
    <span class="title">phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.23">10.4230/LIPIcs.WABI.2022.23</a>
</li>
<li>
    <span class="authors">Diego P. Rubert and Marília D. V. Braga</span>
    <span class="title">Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.24">10.4230/LIPIcs.WABI.2022.24</a>
</li>
<li>
    <span class="authors">Clément Agret, Bastien Cazaux, and Antoine Limasset</span>
    <span class="title">Toward Optimal Fingerprint Indexing for Large Scale Genomics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.WABI.2022.25">10.4230/LIPIcs.WABI.2022.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

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