New Results
Improving the efficiency of de Bruijn graph construction using compact universal hitting sets
Yael Ben-Ari, Lianrong Pu, View ORCID ProfileYaron Orenstein, View ORCID ProfileRon Shamir
doi: https://doi.org/10.1101/2020.11.08.373050
Yael Ben-Ari
1Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel
Lianrong Pu
1Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel
Yaron Orenstein
2School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Ron Shamir
1Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel
Article usage
Posted November 10, 2020.
Improving the efficiency of de Bruijn graph construction using compact universal hitting sets
Yael Ben-Ari, Lianrong Pu, Yaron Orenstein, Ron Shamir
bioRxiv 2020.11.08.373050; doi: https://doi.org/10.1101/2020.11.08.373050
Subject Area
Subject Areas
- Biochemistry (11561)
- Bioengineering (8622)
- Bioinformatics (28861)
- Biophysics (14793)
- Cancer Biology (11918)
- Cell Biology (17159)
- Clinical Trials (138)
- Developmental Biology (9302)
- Ecology (14019)
- Epidemiology (2067)
- Evolutionary Biology (18128)
- Genetics (12144)
- Genomics (16615)
- Immunology (11706)
- Microbiology (27689)
- Molecular Biology (11384)
- Neuroscience (60089)
- Paleontology (447)
- Pathology (1847)
- Pharmacology and Toxicology (3183)
- Physiology (4878)
- Plant Biology (10276)
- Synthetic Biology (2849)
- Systems Biology (7289)
- Zoology (1618)