Coverage-preserving sparsification of overlap graphs for long-read assembly

HIGHLIGHTS

  • who: Bioinformatics, and Editor Anthony, Mathelier from the Department of Computational and Data Sciences, Indian Institute of Science, Bengaluru, Karnataka, India have published the article: Coverage-preserving sparsification of overlap graphs for long-read assembly, in the Journal: (JOURNAL)
  • what: The authors develop a novel theoretical framework under which the coverage-preserving properties of a graph model can be analyzed. The experiments done using simulated long reads from HG002 human diploid genome show that 50 coverage gaps are introduced on average by ignoring contained reads from nanopore datasets. To remedy this the authors propose practical . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?