BOL: Related items

IVA: accurate de novo assembly of RNA virus genomes

Neel — Wed, 23 Jun 2021 07:51:59 -0500

IVA (Iterative Virus Assembler) designed specifically for read pairs sequenced at highly variable depth from RNA virus samples. We tested IVA on datasets from 140 sequenced samples from human immunodeficiency virus-1 or influenza-virus-infected people and demonstrated that IVA outperforms all other virus de novo assemblers.

Availability and implementation: The software runs under Linux, has the GPLv3 licence and is freely available from http://sanger-pathogens.github.io/iva

https://pubmed.ncbi.nlm.nih.gov/25725497/

Address of the bookmark: https://github.com/sanger-pathogens/iva

bipype

Jit — Thu, 01 Dec 2016 08:47:38 -0600

Bipype is a very useful program, which prepare a lot of types of bioinformatics analyses. There are three input options: amplicons, WGS (whole genome sequences) and metatranscriptomic data. If amplicons are input data, then bipype does reconstruction and pairs merging. After that biodiversity is searching. There are two types of searching depending on the amplicons types (ITS or 16S). If WGS are chosen, then bipype finds the SA coordinates of the input reads and generates alignments in the SAM format given single-end reads, aligns reads to reference sequence(s). All of these analyses will be shown with Krona program, which allows to show hierarchical data with pie charts.

Address of the bookmark: https://readthedocs.org/projects/bipype/

auN: a new metric to measure assembly contiguity

Jit — Tue, 02 Aug 2022 01:18:47 -0500

Given a de novo assembly, we often measure the “average” contig length by N50. N50 is neither the real average nor median. It is the length of the contig such that this and longer contigs cover at least 50% of the assembly. A longer N50 indicates better contiguity. We can similarly define Nx such that contigs no shorter than Nx covers x% of the assembly. The Nx curve plots Nx as a function of x, where x is ranged from 0 to 100.

Address of the bookmark: https://lh3.github.io/2020/04/08/a-new-metric-on-assembly-contiguity

Mitochondrial genome assembly tools !

Abhi — Wed, 06 Sep 2023 00:37:18 -0500

Mitochondrial genome assembly tools are specialized software and algorithms designed to accurately reconstruct the mitochondrial genome (mitogenome) from sequencing data, typically obtained through techniques like next-generation sequencing (NGS). The mitochondrial genome is relatively small compared to the nuclear genome, making it an ideal target for assembly. Here are some commonly used mitochondrial genome assembly tools:

MitoFinder: Mitofinder is a pipeline to assemble mitochondrial genomes and annotate mitochondrial genes from trimmed read sequencing data.

MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads

MITObim: MITObim is a tool specifically developed for the iterative assembly of mitochondrial genomes. It starts with a reference mitogenome and iteratively refines the assembly using the read data.

MITOS: MITOS is a web-based platform that provides a pipeline for annotating mitochondrial genomes. It integrates multiple software tools for assembly, annotation, and visualization of mitogenomes.

MIRA: MIRA (Mimicking Intelligent Read Assembly) is a versatile genome assembly tool that can be used for mitochondrial genome assembly. It supports various sequencing technologies and allows for reference-based or de novo assembly.

NOVOPlasty: NOVOPlasty is a user-friendly tool designed for de novo assembly of organelle genomes, including mitochondria. It utilizes a seed-and-extend algorithm and is suitable for both short-read and long-read data.

MITOS2: MITOS2 is an updated version of the MITOS pipeline, which automates the annotation of mitochondrial genomes. It provides improved accuracy and additional features for mitochondrial genome analysis.

GetOrganelle: While primarily designed for chloroplast genome assembly, GetOrganelle can also be used for mitochondrial genome assembly. It is particularly useful for dealing with high-throughput sequencing data.

SPAdes: SPAdes (St. Petersburg genome assembler) is a versatile genome assembly tool that can be employed for mitochondrial genome assembly, especially when dealing with complex datasets that may contain nuclear mitochondrial DNA sequences (numts).

IDBA-UD: IDBA-UD (Iterative De Bruijn Graph De Novo Assembler) is another de novo assembly tool that can be used for mitochondrial genome assembly, especially in cases with relatively low coverage.

Velvet: Velvet is a de novo assembly tool that can be applied to mitochondrial genome assembly, especially when working with short-read data.

When selecting a mitochondrial genome assembly tool, it's important to consider the specific characteristics of your sequencing data, such as read length and coverage, as well as the complexity of the mitochondrial genome. Additionally, some tools are better suited for specific organisms or research objectives, so choosing the right tool will depend on your particular project requirements.

16th Congress of the European Society for Evolutionary Biology (ESEB)

Thu, 22 Dec 2016 08:08:37 -0600

Abstract submissions for our upcoming symposium on the Genomics of Adaptation that will take place as part of the 16th Congress of the European Society for Evolutionary Biology (ESEB). The conference will take place from August 20th - August 25th, 2017 in Groningen, the Netherlands.

SYMPOSIUM DESCRIPTION: Genomics of Adaptation [S16] Model organisms for life-history research are mainly studied in the lab where functional genetics is assessable. In general, however, knowledge about their eco-evolutionary dynamics, such as biotic interactions, is rare. By contrast, in organisms for which the ecology and adaptation strategies in the field are well known, we typically lack the appropriate genetic tools to investigate functionality. Advances in genomics and statistics as well as investments in evolutionary model organisms are now providing access to putatively adaptive genome-wide variation within species from across the tree of life. In this symposium, we focus on integrating life-history biology, genetics and evolutionary ecology in the genomics era.

We wish to (1) highlight the role of genetic architecture of complex traits, such as adaptations to biotic interactions or life-history traits; (2) contrast this to morphological traits which are generally thought to have a less complex genetic architecture; and (3) discuss the opportunities and drawbacks of specific model systems.

INVITED SPEAKERS: Josephine Pemberton, University of Cambridge (http://bit.ly/2hJWytJ ) Peter Tiffin, University of Minnesota (http://bit.ly/2hK7HuS )

ABSTRACT SUBMISSION The deadline for abstract submission is January 10, 2017. For more information and to submit abstracts online, please visit: http://bit.ly/2fBXlvN We look forward to an exciting symposium and seeing you all in Groningen! Sincerely, Ben Blackman, UC Berkeley Maaike de Jong, University of Bristol Bart Pannebakker, Wageningen University Noah Whiteman, UC Berkeley Jelle Zandveld, Wageningen University

Bioinformatics Contest 2017!

Neel — Fri, 23 Dec 2016 14:03:37 -0600

Bioinformatics Contest 2017! Rosalind is co-organizer.
Compete with thousands of people worldwide on bioinformatics problem solving.
Everything is online. Qualification round starts on January 23, 2017. Final is on Feb 18.

You will need to solve bioinformatics problems using programming. The goal is to correctly solve as many problems as possible within 24 hours. Some of them will be approximation problems and will have partial grades. All rounds will be held online, submissions will be auto-graded in real time.

Check more at http://contest.bioinf.me/

Good luck!

GenomeRing: alignment visualization based on SuperGenome coordinates

Neel — Wed, 18 Jan 2017 10:24:10 -0600

The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions, deletions or from rearrangement events. Computational tools that can visualize genome alignments in a meaningful manner are needed to help researchers gain new insights into the underlying data. Such visualizations typically are either realized in a linear fashion as in genome browsers or by using a circular approach, where relationships between genomic regions are indicated by arcs. Both methods allow for the integration of additional information such as experimental data or annotations. However, providing a visualization that still allows for a quick and comprehensive interpretation of all important genomic variations together with various supplemental data, which may be highly heterogeneous, remains a challenge.

More at https://academic.oup.com/bioinformatics/article/28/12/i7/268598/GenomeRing-alignment-visualization-based-on

Address of the bookmark: http://it.informatik.uni-tuebingen.de/?page_id=185

Studentship

Tue, 24 Jan 2017 04:26:14 -0600

Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17
Research Associate/ Studentship/ Traineeship Jobs opportunity in University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis
Studentship
No. of Post : 01
Qualifications : Applicants who are pursuing Post Graduate Degree course/ Diploma in Bioinformatics/ Biomedical Sciences/ Biotechnology/Life Sciences/Chemistry/ Biochemistry with a programme in Bioinformatics to carry out the project.
Remuneration : Rs. 8,000/-
Traineeship
No. of Post : 01
Qualifications : Applicants who have completed their Post Graduate degree in Bioinformatics /Biomedical Sciences/Biotechnology/Life Sciences/Chemistry/Biochemistry or any other branch of Life Sciences with knowledge in Bioinformatics
Remuneration : Rs. 8,000/-
Research Associate
No. of Post : 01
Qualifications : Ph.D. in Bio-Medical Sciences/Bioinformatics/ Biotechnology/Life Sciences/ Chemistry/ Bio-Chemistry and related areas
Remuneration : Rs. 36,000/-

Applicant are required to bring applications on plain paper, stating the name, address, date of birth. educational qualifications and experiences and Institute, along with attested photocopies of mark sheets and certificates etc. at the time of Interview. Applications should also be sent by Entail to Dr. Madhu Chopra, Coordinator, BIF Facility. Email: acbrdu.blisnet@nic.in; mchopradu@gmail.com.
Interview Date : 13.02.2017
Time : 10:00 am-12:00 noon
Venue : ACBR

Many-Core Engine (MCE) for Perl example

Jit — Tue, 31 Jan 2017 05:37:50 -0600

MCE spawns a pool of workers and therefore does not fork a new process per each element of data. Instead, MCE follows a bank queuing model. Imagine the line being the data and bank-tellers the parallel workers. MCE enhances that model by adding the ability to chunk the next n elements from the input stream to the next available worker.

CORE MODULES

Three modules make up the core engine for MCE.

MCE::Core: Provides the Core API for Many-Core Engine. The various MCE options are described here.
MCE::Signal: Temporary directory creation, cleanup, and signal handling.
MCE::Util: Utility functions for Many-Core Engine.

MCE EXTRAS

There are 4 add-on modules for use with MCE.

MCE::Candy: Provides a collection of sugar methods and output iterators for preserving output order.
MCE::Mutex: Provides a simple semaphore implementation supporting threads and processes.
MCE::Queue: Provides a hybrid queuing implementation for MCE supporting normal queues and priority queues from a single module. MCE::Queue exchanges data via the core engine to enable queuing to work for both children (spawned from fork) and threads.
MCE::Relay: Enables workers to receive and pass on information orderly with zero involvement by the manager process while running.

MCE MODELS

The models take Many-Core Engine to a new level for ease of use. Two options (chunk_size and max_workers) are configured automatically as well as spawning and shutdown.

MCE::Loop: Provides a parallel loop utilizing MCE for building creative loops.
MCE::Flow: A parallel flow model for building creative applications. This makes use of user_tasks in MCE. The author has full control when utilizing this model. MCE::Flow is similar to MCE::Loop, but allows for multiple code blocks to run in parallel with a slight change to syntax.
MCE::Grep: Provides a parallel grep implementation similar to the native grep function.
MCE::Map: Provides a parallel map model similar to the native map function.
MCE::Step: Provides a parallel step implementation utilizing MCE::Queue between user tasks. MCE::Step is a spin off from MCE::Flow with a touch of MCE::Stream. This model, introduced in 1.506, allows one to pass data from one sub-task into the next transparently.
MCE::Stream: Provides an efficient parallel implementation for chaining multiple maps and greps together through user_tasks and MCE::Queue. Like with MCE::Flow, MCE::Stream can run multiple code blocks in parallel with a slight change to syntax from MCE::Map and MCE::Grep.

MISCELLANEOUS

Miscellaneous additions included with the distribution.

MCE::Examples: Describes various demonstrations for MCE including a Monte Carlo simulation.
MCE::Subs: Exports functions mapped directly to MCE methods; e.g. mce_wid. The module allows 3 options; :manager, :worker, and :getter.

REQUIREMENTS

Perl 5.8.0 or later. PDL::IO::Storable is required in scripts running PDL.

SOURCE AND FURTHER READING

The source, cookbook, and examples are hosted at GitHub.

Open Positions in Pasini’s lab

Sat, 04 Feb 2017 08:17:18 -0600

Computational Biologists
Open to PhD-student and Post-doc candidates
We are looking for wet and computational biologists to work on an ERC funded project in our
laboratory located at the Department of Experimental Oncology of the European Institute of
Oncology in Milan (Italy). The project will focus on different aspects of the function of Polycomb
Group proteins and other chromatin modifying activities in relation to their role in regulating cellular
identity in the development of adult tissues.
The candidates will be in charge of computational analysis and data management related to the
project. She/he will directly interact with the wet scientists working in our laboratory while working
embedded in the community of computational biologists present at our institution. The work will
involve the analysis of sequencing data produced with cutting edge technologies to study gene
expression and chromatin environment including data produced on rare cell populations and single
cells. The applicants must have a good knowledge of programming in python/perl/java along with
strong statistical background and performing analysis in R platform. A biological background is
also recommended however it’s not mandatory for application.
Each applicant should submit a full CV (with a detailed description of her/his background,
expertise, achievements and publication records) together with a letter of intent and at least two
contacts for recommendations (for a post-doc position). Competitive salary will be offered based
on the experience of the candidate. Non Italian as well as Italian applicants that have been working
outside Italy (>3yrs.) will have the opportunity to benefit of a full tax deduction for the first three
years of contract.
Applications should be submitted as single PDF to diego.pasini@ieo.it

Lab https://www.ieo.it/en/RESEARCH/People/Researchers/Pasini-Diego/