BOL: Related items

RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes

Rahul Nayak — Fri, 01 May 2020 03:00:40 -0500

RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.

Address of the bookmark: https://github.com/AppliedBioinformatics/RefKA

GraphMap - A highly sensitive and accurate mapper for long, error-prone reads

Jit — Wed, 07 Jun 2017 04:18:16 -0500

GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html

Features

    Mapping position agnostic to alignment parameters.
    Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.
    Circular genome handling to resolve coverage drops near ends of the genome.
    E-value.
    Meaningful mapping quality.
    Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).
    Overlapping of reads for de novo assembly.
    Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.
    ...and much more.

GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).
Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.

Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.
Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.

Address of the bookmark: https://github.com/isovic/graphmap

Scaffolding of a bacterial genome using MinION nanopore sequencing

Rahul Agarwal — Tue, 07 Jul 2015 16:59:25 -0500

Second generation sequencing has revolutionized genomic studies. However, most genomes contain repeated DNA elements that are longer than the read lengths achievable with typical sequencers, so the genomic order of several generated contigs cannot be easily resolved. A new generation of sequencers offering substantially longer reads is emerging, notably the Pacific Biosciences (PacBio) RS II system and the MinION system, released in early 2014 by Oxford Nanopore Technologies through an early access program.

Address of the bookmark: http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html

Nanopore adaptor !

Jit — Mon, 03 Feb 2020 00:10:29 -0600

Porechop is a tool for finding and removing adapters from Oxford Nanopore reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.

Porechop also supports demultiplexing of Nanopore reads that were barcoded with the Native Barcoding Kit, PCR Barcoding Kit or Rapid Barcoding Kit.

The known Nanopore adapters that Porechop looks for are defined

https://github.com/rrwick/Porechop/blob/master/porechop/adapters.py

They are:

Ligation kit adapters
Rapid kit adapters
PCR kit adapters
Barcodes
Native barcoding
Rapid barcoding

Address of the bookmark: https://github.com/rrwick/Porechop/blob/master/porechop/adapters.py

Run miniasm assembler on nanopore reads !

Jit — Mon, 18 Dec 2017 04:07:50 -0600

Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final unitig sequences. Thus the per-base error rate is similar to the raw input reads.

Find the detail of the reads repeats:

fq2fa ONT_A.fastq ONT_A.fasta

minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X > AONT.paf

awk '{if($1==$6){print}}' AONT.paf > AONTself.paf

awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq > invertedrepeat.list

Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)

minidot -f 5 -m 30000 AONTself.paf > AONTself30000.eps
sed 's/_template_pass_FAH31515//' AONTself30000.eps > AONTself30000final.eps

minidot -f 5 -m 20000 AONTself.paf > AONTself20000.eps
sed 's/_template_pass_FAH31515//' AONTself20000.eps > AONTself20000final.eps

minidot -f 5 -m 10000 AONTself.paf > AONTself10000.eps
sed 's/_template_pass_FAH31515//' AONTself10000.eps > AONTself10000final.eps

Assemble with miniasm:

miniasm -f ONT_A.fasta AONT.paf > AONT.gfa
grep '^S' AONT.gfa |awk '{print ">"$2"\n"$3}' > AONT_miniasm.fasta

minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X > AONT_miniasm.paf

awk '{if($1==$6){print}}' AONT_miniasm.paf > AONT_miniasm_self.paf

minidot -f 5 -m 10000 AONT_miniasm_self.paf > AONT_miniasm_self10000.eps

Njoy the assembly !

Interview Mark Sansom (U. Oxford): Simulations of Membrane Proteins

Mon, 07 Oct 2013 14:34:13 -0500

Workshop in Bioinformatics, 4/June/2012 Campus Vida's Research Centers organize in Santiago de Compostela the Workshop in Bioinformatics. This event addressed issues such as structural bioinformatics, biological modelling and mining bioinformatics data. Professor Mark Sansom (University of Oxford), belonging to the Structural Bioinformatics and Computational Biochemistr Unit, opened the sessions with the lecture "Multiscale Simulations of Membrane Proteins: Lipid Interactions and Signalling".

Postdoctoral Fellowship at Department of Psychiatry, Warneford Hospital, Oxford

Tue, 01 Sep 2015 05:24:49 -0500

Applications are invited for a postdoctoral research assistant to work in the Translational Neuroscience and Dementia Research Group (TNDRG) on a project using informatics approaches to understand and prevent dementia, specifically on the role of the immune system in Alzheimer’s. The post is for a fixed-term duration of 1 year.

Working with other members of the TNDRG you will analyse complex genomic and epidemiological datasets, evaluating which computational tools are most suitable. You will contribute to the generation of innovative tools for linking epidemiological and multilevel omics datasets, ensuring that computer programs are written in a form that other collaborators can use and expand.

You will have or be close to completion of a PhD in either: bioinformatics; neuroscience; machine learning; statistics; epidemiology; neurology; or other relevant field. You will have experience programming on either R, Matlab, Python, C++, Java or any other imperative, object oriented or functional language.

Please direct Informal enquiries to Dr Alejo Nevado-Holgado (alejo.nevado-holgado@psych.ox.ac.uk).

You will be required to upload a supporting statement explaining how you meet the selection criteria for the post, a CV, and details of two referees as part of your online application.

The closing date for applications is 12.00 midday on 2 September 2015. Interviews will be held on Tuesday 15 September 2015.

https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.jobspec?p_id=118696

FinisherSC: a repeat-aware and scalable tool for upgrading de novo assembly using long reads

Jit — Mon, 27 Feb 2017 09:49:45 -0600

FinisherSC, a repeat-aware and scalable tool for upgrading de novo assembly using long reads. Experiments with real data suggest that FinisherSC can provide longer and higher quality contigs than existing tools while maintaining high concordance.

Address of the bookmark: http://kakitone.github.io/finishingTool/

npScarf: Scaffolding and Completing Assemblies in Real-time Fashion

Jit — Tue, 23 May 2017 04:53:29 -0500

npScarf (jsa.np.npscarf) is a program that scaffolds and completes draft genomes assemblies in real-time with Oxford Nanopore sequencing. The pipeline can run on a computing cluster as well as on a laptop computer for microbial datasets. It also facilitates the real-time analysis of positional information such as gene ordering and the detection of genes from mobile elements (plasmids and genomic islands).

Complete paper at https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5321748/

Address of the bookmark: https://github.com/mdcao/npScarf

Hercules: a profile HMM-based hybrid error correction algorithm for long reads

Jit — Mon, 20 Aug 2018 14:14:11 -0500

Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability:

Hercules source code is available at https://github.com/BilkentCompGen/Hercules

Address of the bookmark: https://github.com/BilkentCompGen/Hercules