Project proposal: Why are Read-Overlap Graphs Computationally Tractable?

This resource has been withdrawn from the Duke Digital Repository.

NESCent materials were deaccessioned from the Duke Digital Repository in March 2026. Contact Hilmar Lapp (hilmar.lapp@duke.edu) with questions about NESCent.

Item Info

Title:
Project proposal: Why are Read-Overlap Graphs Computationally Tractable?
Permalink:
https://idn.duke.edu/ark:/87924/r4qq2k
Type:
Text
Description:
Project proposal
Identifier:
  • duke:278855
  • ark:/87924/r4qq2k
  • aba1a967-a2bb-46e5-8499-a0392c4d9d4a
Collection:
Why are Read-Overlap Graphs Computationally Tractable? (Visiting Scholar)