Products
Services
Applications
Resources Get started
Resource Centre
Back

BOSS-RUNS: a flexible and practical dynamic read sampling framework for nanopore sequencing

Publication

Date: 9th February 2020 | Source: BioRxiv

Authors: Nicola De Maio, Charlotte Manser, Rory Munro, Ewan Birney, Matthew Loose, Nick Goldman.

Real-time selective sequencing of individual DNA fragments, or 'Read Until', allows the focusing of Oxford Nanopore Technology sequencing on pre-selected genomic regions. This can lead to large improvements in DNA sequencing performance in many scenarios where only part of the DNA content of a sample is of interest. This approach is based on the idea of deciding whether to sequence a fragment completely after having sequenced only a small initial part of it. If, based on this small part, the fragment is not deemed of (sufficient) interest it is rejected and sequencing is continued on a new fragment.

To date, only simple decision strategies based on location within a genome have been proposed to determine what fragments are of interest.

We present a new mathematical model and algorithm for the real-time assessment of the value of prospective fragments.

Our decision framework is based not only on which genomic regions are a priori interesting, but also on which fragments have so far been sequenced, and so on the current information available regarding the genome being sequenced. As such, our strategy can adapt dynamically during each run, focusing sequencing efforts in areas of highest uncertainty (typically areas currently low coverage).

We show that our approach can lead to considerable savings of time and materials, providing high-confidence genome reconstruction sooner than a standard sequencing run, and resulting in more homogeneous coverage across the genome, even when entire genomes are of interest.

Read the full text Read more about adaptive sequencing - UNCALLED Read more about adaptive sequencing - panels

Recommended for you

Open a chat to talk to our sales team
Subscribe

Subscribe

FAQs

FAQs

Search