default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms for Molecular Biology, Volume 20
Volume 20, Number 1, December 2025
- Timothé Rouzé, Igor Martayan, Camille Marchet, Antoine Limasset:
Fractional hitting sets for efficient multiset sketching. 1 - Chris Jennings-Shaffer
, David H. Rich, Matthew Macaulay, Michael D. Karcher, Tanvi Ganapathy, Shosuke Kiami, Anna Kooperberg, Cheng Zhang, Marc A. Suchard, Frederick A. Matsen IV:
Finding high posterior density phylogenies by systematically extending a directed acyclic graph. 2 - 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. 3 - Ragnar Groot Koerkamp, Daniel Liu, Giulio Ermanno Pibiri:
The open-closed mod-minimizer algorithm. 4 - Karl Käther, Andreas Remmel, Steffen Lemke, Peter F. Stadler:
Unbiased anchors for reliable genome-wide synteny detection. 5 - Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi:
sc McDag: indexing maximal common subsequences for k strings. 6 - Adam Cicherski, Anna Lisiecka, Norbert Dojer:
AlfaPang: alignment free algorithm for pangenome graph construction. 7 - Mahmudur Rahman Hera, David Koslicki:
Estimating similarity and distance using FracMinHash. 8 - Leena Salmela:
Sama: a contig assembler with correctness guarantee. 9 - Leonard Bohnenkämper, Jens Stoye, Daniel Doerr:
Reconstructing rearrangement phylogenies of natural genomes. 10 - Larissa L. M. Aguiar, Felipe A. Louza:
Faster computation of left-bounded shortest unique substrings. 11 - Xiaofei Carl Zang, Xiang Li, Kyle Metcalfe, Tuval Ben-Yehezkel, Ryan Kelley, Mingfu Shao:
Anchorage accurately assembles anchor-flanked synthetic long reads. 12 - Jens Zentgraf, Sven Rahmann:
Swiftly identifying strongly unique k-mers. 13 - Elizabeth S. Allman, Hector Baños, John A. Rhodes, Kristina Wicke:
NANUQ+: A divide-and-conquer approach to network estimation. 14 - Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie, Jan Fostier:
b-move: faster lossless approximate pattern matching in a run-length compressed index. 15 - 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. 16 - Gleb S. Buzanov, Vsevolod J. Makeev:
Exclusive functional signatures for gene annotation with vast OpenOrd layout. 17 - Bertrand Marchand, Nadia Tahiri, Shohreh Golpaigani Fard, Olivier Tremblay-Savard, Manuel Lafond:
Finding maximum common contractions between phylogenetic networks. 18 - Anna Lindeberg, Guillaume E. Scholz, Nicolas Wieseke, Marc Hellmuth:
Orthology and near-cographs in the context of phylogenetic networks. 19 - Théo Boury, Samuel Gardelle, Laurent Bulteau, Yann Ponty:
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs. 20
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-12-04 01:28 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:
