default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th WABI 2024: London, UK
- Solon P. Pissis
, Wing-Kin Sung:
24th International Workshop on Algorithms in Bioinformatics, WABI 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. LIPIcs 312, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-340-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Tomás Vinar:
Bioinformatics of Pathogens (Invited Talk). 1:1-1:2 - Luís Cunha, Ignasi Sau, Uéverton S. Souza:
On the Complexity of the Median and Closest Permutation Problems. 2:1-2:23 - Yao-ban Chan:
An Efficient Algorithm for the Reconciliation of a Gene Network and Species Tree. 3:1-3:17 - Stephen Hwang, Nathaniel K. Brown, Omar Y. Ahmed, Katharine M. Jenike, Sam Kovaka, Michael C. Schatz, Ben Langmead:
MEM-Based Pangenome Indexing for k-mer Queries. 4:1-4:17 - Lukas Hübner, Alexandros Stamatakis:
Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests. 5:1-5:22 - Mahmudur Rahman Hera, David Koslicki:
Cosine Similarity Estimation Using FracMinHash: Theoretical Analysis, Safety Conditions, and Implementation. 6:1-6:16 - Yuanyuan Qi, Mohammed El-Kebir:
Sapling: Inferring and Summarizing Tumor Phylogenies from Bulk Data Using Backbone Trees. 7:1-7:19 - Sebastian S. Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I. Tomescu:
Applying the Safe-And-Complete Framework to Practical Genome Assembly. 8:1-8:16 - Tsuyoshi Urata, Manato Yokoyama, Momoko Hayamizu:
Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation. 9:1-9:17 - Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie, Jan Fostier:
b-move: Faster Bidirectional Character Extensions in a Run-Length Compressed Index. 10:1-10:18 - Ragnar Groot Koerkamp, Giulio Ermanno Pibiri:
The {mod-minimizer}: A Simple and Efficient Sampling Algorithm for Long k-Mers. 11:1-11:23 - Leonard Bohnenkämper, Jens Stoye, Daniel Dörr:
Reconstructing Rearrangement Phylogenies of Natural Genomes. 12:1-12:16 - Md. Hasin Abrar, Paul Medvedev:
PLA-index: A k-mer Index Exploiting Rank Curve Linearity. 13:1-13:18 - Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti:
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. 14:1-14:21 - Jens Zentgraf, Sven Rahmann:
Swiftly Identifying Strongly Unique k-Mers. 15:1-15:15 - Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard, Manuel Lafond:
Finding Maximum Common Contractions Between Phylogenetic Networks. 16:1-16:24 - Ragnar Groot Koerkamp:
A*PA2: Up to 19× Faster Exact Global Alignment. 17:1-17:25 - Kimon Boehmer, Sarah J. Berkemer, Sebastian Will, Yann Ponty:
RNA Triplet Repeats: Improved Algorithms for Structure Prediction and Interactions. 18:1-18:23 - Théo Boury, Laurent Bulteau, Yann Ponty:
RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs. 19:1-19:23 - Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales, Manuel Lafond:
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. 20:1-20:21 - Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi:
McDag: Indexing Maximal Common Subsequences in Practice. 21:1-21:18 - Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben-Yehezkel, Ryan Kelley, Mingfu Shao:
Anchorage Accurately Assembles Anchor-Flanked Synthetic Long Reads. 22:1-22:17 - Adam Cicherski, Anna Lisiecka, Norbert Dojer:
AlfaPang: Alignment Free Algorithm for Pangenome Graph Construction. 23:1-23:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
