skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

Title: The Complexity of Approximate Pattern Matching on de Bruijn Graphs
Award ID(s):
2112643 2146003 1704552 1816027
NSF-PAR ID:
10342338
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Research in Computational Molecular Biology - 26th Annual International Conference, RECOMB 2022
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email