default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms for Molecular Biology, Volume 19
Volume 19, Number 1, December 2024
- Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
Investigating the complexity of the double distance problems. 1 - Junyan Dai, Tobias Rubel, Yunheng Han, Erin K. Molloy
:
Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem. 2 - Jason Fan, Jamshed Khan, Noor Pratap Singh, Giulio Ermanno Pibiri, Rob Patro:
Fulgor: a fast and compact k-mer index for large-scale matching and color queries. 3 - Jyotshna Rajput, Ghanshyam Chandra, Chirag Jain:
Co-linear chaining on pangenome graphs. 4 - Victor Epain, Rumen Andonov:
Global exact optimisations for chloroplast structural haplotype scaffolding. 5 - Alitzel López Sánchez, Manuel Lafond:
Predicting horizontal gene transfers with perfect transfer networks. 6 - Pawel Górecki, Natalia Rutecka, Agnieszka Mykowiecka, Jaroslaw Paszek:
Unifying duplication episode clustering and gene-species mapping inference. 7 - Leonard Bohnenkämper:
Recombinations, chains and caps: resolving problems with the DCJ-indel model. 8 - Mateo Gray, Sebastian Will, Hosna Jabbari:
SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration. 9 - Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Finding maximal exact matches in graphs. 10 - Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi:
Suffix sorting via matching statistics. 11 - Shayesteh Arasti, Siavash Mirarab:
Median quartet tree search algorithms using optimal subtree prune and regraft. 12 - Hua-Ting Yao, Bertrand Marchand, Sarah J. Berkemer, Yann Ponty, Sebastian Will:
Infrared: a declarative tree decomposition-powered framework for bioinformatics. 13 - Diego Díaz-Domínguez, Miika Leinonen, Leena Salmela:
Space-efficient computation of k-mer dictionaries for large values of k. 14 - Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Pfp-fm: an accelerated FM-index. 15 - Jamshed Khan, Tobias Rubel, Erin K. Molloy, Laxman Dhulipala, Rob Patro:
Fast, parallel, and cache-friendly suffix array construction. 16 - Yutong Qiu, Yihang Shen, Carl Kingsford:
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants. 17 - Yushu Liu, Mohammad Amin Edrisi, Zhi Yan, Huw A. Ogilvie, Luay Nakhleh:
NestedBD: Bayesian inference of phylogenetic trees from single-cell copy number profiles under a birth-death model. 18 - Tizian Schulz, Paul Medvedev:
ESKEMAP: exact sketch-based read mapping. 19 - Amatur Rahman, Yoann Dufresne, Paul Medvedev:
Compression algorithm for colored de Bruijn graphs. 20 - Stefan Canzar, Van Hoan Do, Slobodan Jelic, Sören Laue, Domagoj Matijevic, Tomislav Prusina:
Metric multidimensional scaling for large single-cell datasets using neural networks. 21 - Mahsa Farnia, Nadia Tahiri:
New generalized metric based on branch length distance to compare B cell lineage trees. 22 - Elizabeth S. Allman, Hector Baños, Jonathan D. Mitchell, John A. Rhodes:
TINNiK: inference of the tree of blobs of a species network under the coalescent model. 23
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-12-31 21:47 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:
