Skip to content

closing gaps in long read assemblies by long read walking

License

Notifications You must be signed in to change notification settings

bpucker/LongReadWalker

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 

Repository files navigation

LongReadWalker

Inspired by primer walking in the first sequencing projects, this script is intended to close genome assembly gaps by long read walking. The focus is on a short run time and a very small number of depencencies (BLAST).

Background

Initially, tools for gap filling relied on short reads e.g. Sealer and GapFiller. Now, there are even some tools which can utilize long reads e.g. GAPPadder, TGS-GapCloser, PGcloser, and gapFinisher. While some of these tools might not be suitable for the large size of plant genome sequencing datasets, others might require the installation of dependencies. Therefore, I developed the LongReadWalker as a single Python script to close gaps harnessing the power of long sequence reads.

Concept

The LongReadWalker needs a start sequence i.e. a sequence at a contig end. All sequence reads are screened for a match and the read which allows the best extension is used for the first step. The sequence of this read is used to extend the "assembled" sequence and to define a new query sequence at the unmatched read end. This query is searched against all reads for the next extension step. This simple combination of extension and search is repeated for a defined number of iteration. Depending on the read length distribution 10 steps can be sufficient to "assemble" one million basepairs which should be enough to span most gaps.

About

closing gaps in long read assemblies by long read walking

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages