New Results
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
View ORCID ProfileJamshed Khan, View ORCID ProfileMarek Kokot, View ORCID ProfileSebastian Deorowicz, View ORCID ProfileRob Patro
doi: https://doi.org/10.1101/2021.12.14.472718
Jamshed Khan
1Department of Computer Science, University of Maryland, College Park, Maryland, USA
2Center for Bioinformatics and Computational Biology, University of Maryland, College Park, Maryland, USA
Marek Kokot
3Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland
Sebastian Deorowicz
3Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland
Rob Patro
1Department of Computer Science, University of Maryland, College Park, Maryland, USA
2Center for Bioinformatics and Computational Biology, University of Maryland, College Park, Maryland, USA
Posted June 19, 2022.
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
Jamshed Khan, Marek Kokot, Sebastian Deorowicz, Rob Patro
bioRxiv 2021.12.14.472718; doi: https://doi.org/10.1101/2021.12.14.472718
Subject Area
Subject Areas
- Biochemistry (11718)
- Bioengineering (8724)
- Bioinformatics (29132)
- Biophysics (14936)
- Cancer Biology (12051)
- Cell Biology (17360)
- Clinical Trials (138)
- Developmental Biology (9406)
- Ecology (14146)
- Epidemiology (2067)
- Evolutionary Biology (18269)
- Genetics (12223)
- Genomics (16768)
- Immunology (11844)
- Microbiology (28016)
- Molecular Biology (11560)
- Neuroscience (60822)
- Paleontology (450)
- Pathology (1864)
- Pharmacology and Toxicology (3231)
- Physiology (4940)
- Plant Biology (10401)
- Synthetic Biology (2878)
- Systems Biology (7333)
- Zoology (1642)