default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd WABI 2022
- Christina Boucher
, Sven Rahmann:
22nd International Workshop on Algorithms in Bioinformatics, WABI 2022, September 5-7, 2022, Potsdam, Germany. LIPIcs 242, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-243-3 - Leena Salmela:
Efficient Solutions to Biological Problems Using de Bruijn Graphs (Invited Talk). 1:1-1:2 - Sebastian S. Schmidt, Jarno N. Alanko:
Eulertigs: Minimum Plain Text Representation of k-mer Sets Without Repetitions in Linear Time. 2:1-2:21 - Alitzel López Sánchez, Manuel Lafond:
Predicting Horizontal Gene Transfers with Perfect Transfer Networks. 3:1-3:22 - Ahsan Sanaullah, Degui Zhi, Shaoije Zhang:
Haplotype Threading Using the Positional Burrows-Wheeler Transform. 4:1-4:14 - Mathieu Gascon, Nadia El-Mabrouk:
Non-Binary Tree Reconciliation with Endosymbiotic Gene Transfer. 5:1-5:20 - Konstantinn Bonnet, Tobias Marschall, Daniel Doerr:
Constructing Founder Sets Under Allelic and Non-Allelic Homologous Recombination. 6:1-6:23 - Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, Yann Ponty:
Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots. 7:1-7:24 - Baqiao Liu, Tandy J. Warnow:
Fast and Accurate Species Trees from Weighted Internode Distances. 8:1-8:24 - Giulio Ermanno Pibiri:
On Weighted k-mer Dictionaries. 9:1-9:20 - Yoshihiko Suzuki, Gene Myers:
Accurate k-mer Classification Using Read Profiles. 10:1-10:20 - Eden Ozery, Meirav Zehavi, Michal Ziv-Ukelson:
New Algorithms for Structure Informed Genome Rearrangement. 11:1-11:19 - Jens Zentgraf, Sven Rahmann:
Fast Gapped k-mer Counting with Subdivided Multi-Way Bucketed Cuckoo Hash Tables. 12:1-12:20 - Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. 13:1-13:16 - Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Efficient Reconciliation of Genomic Datasets of High Similarity. 14:1-14:14 - Wei Wei, David Koslicki:
WGSUniFrac: Applying UniFrac Metric to Whole Genome Shotgun Data. 15:1-15:22 - Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie:
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning. 16:1-16:22 - Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time. 17:1-17:16 - Adrián Goga, Andrej Baláz:
Prefix-Free Parsing for Building Large Tunnelled Wheeler Graphs. 18:1-18:12 - Taher Mun, Naga Sai Kavya Vaddadi, Ben Langmead:
Pangenomic Genotyping with the Marker Array. 19:1-19:17 - Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi:
Suffix Sorting via Matching Statistics. 20:1-20:15 - Pijus Simonaitis, Benjamin J. Raphael:
A Maximum Parsimony Principle for Multichromosomal Complex Genome Rearrangements. 21:1-21:22 - Ke Chen, Mingfu Shao:
Locality-Sensitive Bucketing Functions for the Edit Distance. 22:1-22:14 - Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. 23:1-23:19 - Diego P. Rubert, Marília D. V. Braga:
Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes. 24:1-24:22 - Clément Agret, Bastien Cazaux, Antoine Limasset:
Toward Optimal Fingerprint Indexing for Large Scale Genomics. 25:1-25:15
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 2024-10-31 20:20 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:
