BOL: Related items

LoReTTA, a user-friendly tool for assembling viral genomes from PacBio sequence data

Neel — Wed, 23 Jun 2021 07:54:53 -0500

LoReTTA (Long Read Template-Targeted Assembler), a tool designed for performing de novo assembly of long reads generated from viral genomes on the PacBio platform. LoReTTA exploits a reference genome to guide the assembly process, an approach that has been successful with short reads.

https://academic.oup.com/ve/article/7/1/veab042/6248116

Address of the bookmark: https://academic.oup.com/ve/article/7/1/veab042/6248116

RA Bioinformatics at NATIONAL INSTITUTE OF CANCER PREVENTION & RESEARCH (ICMR)

Thu, 17 Nov 2016 04:11:09 -0600

NATIONAL INSTITUTE OF CANCER PREVENTION & RESEARCH (ICMR)

Noida 201301 (U.P)

Applications are invited upto 21.11.2016 from interested candidates as per details available on NICPR website (www.nicpr.res.in)/ ICMR website (www.icmr.nic.in) to fill up following temporary position in the time bound DHR Project entitled “Next generation EGFR inhibitor identification using ligand based QSAR technique” under Dr. Subhash M. Agarwal, Scientist-D, Division of Bioinformatics.

Research Assistant (One)

Rs.27000/- p.m. (Fixed/temporary)

Essential: M.Sc. in Bioinformatics or related field.

Desirable: Experience in QSAR and structure based drug designing.

More Info : www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf

Spades tutorial PDF

Abhimanyu Singh — Tue, 01 Feb 2022 04:56:43 -0600

SPAdes—St. Petersburg genome Assembler—was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets.

Professor (all levels) in Bioinformatics and Computational Biology

Tue, 22 Nov 2016 05:43:38 -0600

King Abdullah University of Science and Technology (KAUST) (kaust.edu.sa) is seeking a highly motivated and skilled faculty member for the Bioinformatics track whose research focuses on development of methods and tools for Bioinformatics and Computational Biology.
KAUST is an international, graduate-level research university dedicated to advancing science and technology through interdisciplinary research, education, and innovation. Located on the shores of the Red Sea in Saudi Arabia, KAUST offers superb research facilities, generous assured research funding, and internationally competitive salaries, attracting top international faculty, scientists, engineers, and students to conduct fundamental and goal-oriented research to address the world’s pressing scientific and technological challenges in the areas of food, water, energy, and the environment.
The successful applicant is expected to develop world-leading research in domain of bioinformatics/computational biology with focus on development of novel computational approaches for efficient and accurate methods of analyzing biological phenomena at molecular level. The faculty member will be part of the Computational Bioscience Research Center (CBRC) within the Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division. The position will remain open until filled.

Requirements:

PhD or equivalent in a Computer Science, Mathematics or Engineering discipline. Candidates should be well-established within the research field relevant to the position grade. They should demonstrate original research and experience at the highest international level.

Responsibilities and tasks:

Research competence in the following areas is preferred:
Analysis of next generation sequencing (NGS) and other ‘omics’ data (e.g. CAGE, ChIP-Seq, DHS, RNA-Seq, Ribo-Seq, proteomic, metabolic and NMR spectra, etc.).
Signaling, regulatory and metabolic pathways analysis.
Development of tools (web-based and standalone) suited for efficient computational biology/bioinformatics.

Visit cemse.kaust.edu.sa to apply.

ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data

LEGE — Wed, 08 May 2024 07:32:45 -0500

ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.

More at https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/

Address of the bookmark: https://github.com/dengzac/contig-extender

EXCAVATOR2tool

Bulbul — Wed, 30 Nov 2016 04:09:19 -0600

EXCAVATOR2 is a collection of bash, R and Fortran scripts and codes that analyses Whole Exome Sequencing (WES) data to identify CNVs. EXCAVATOR2 enhances the identification of all genomic CNVs, both overlapping and non-overlapping targeted exons by integrating the analysis of In-targets and Off- targets reads. Specifically, it improves the precision of calling CNVs overlapping targeted exons from WES data and enlarges the spectrum of detectable CNVs to off-target events.
EXCAVATOR2 can be effectively employed for the identification of CNVs in small as well as large-scale re-sequencing population and cancer studies. Lastly, it’s of particular interest that all WES experiments can be re-analysed using our method with the beneficial effect to identify novelCNVs in extra-exonic regions by having the full-genome CN profile.

Address of the bookmark: https://sourceforge.net/projects/excavator2tool/

MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction

Abhi — Mon, 08 Apr 2024 06:19:52 -0500

MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303 Zea, 141 Ficus, 67 Oryza, and 43 Saccharum spontaneum samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.

Address of the bookmark: https://github.com/Argonum-Clever2/mike

DBT India

Jit — Sun, 04 Dec 2016 22:30:37 -0600

Latest announcement on DBT India.

Calls

Events

Projects

Jobs

Address of the bookmark: http://www.dbtindia.nic.in/out-reach/latest-announcements/

Structural variation: the hidden genomic treasure

Jit — Sat, 10 Dec 2016 16:19:09 -0600

Genome re-sequencing projects have revealed substantial amounts of genetic variation between individuals extending beyond single nucleotide polymorphisms (SNPs) and short indels. Structural Variations (SVs) and Copy Number Variations (CNVs) are a major source of genomic variation. However, compared to SNPs, accurate detection, genotyping and understanding of CNVs is lagging behind due to much greater analytical challenges related to SV/CNV detection and analysis. In our lab we analyse SVs/CNVs using high-throughput sequencing and different analytical approaches. The most‐studied structural variants are copy number variations (CNVs) which can be generated by several different mechanisms including non‐allelic homologous recombination, non‐homologous end‐joining and deoxyribonucleic acid (DNA) replication‐related fork stalling and template switching. CNVs are closely related to segmental duplications (SDs): SDs can stimulate the formation of CNVs and themselves started out as CNVs, but became fixed in a species. Structural variation can be neutral but has also influenced our phenotypic evolution, for example our susceptibility to disease and our ability to digest certain types of food. Our understanding of the extent of structural variation is increasing rapidly, but it will be much more difficult to understand its phenotypic consequences.

Structural variants (SVs) such as deletions, insertions, duplications, inversions and translocations litter genomes and are often associated with gene expression changes and severe phenotypes (ie. genetic diseases in humans). Recent studies on the functional aspects of different types of SVs have unveiled several cases of adaptive evolution. For example, inversions have been associated with ecological adaptations and may facilitate speciation. Due to their prevalent nature, SVs arguably have a large impact on genome evolution and should not be neglected when studying the genetics of adaptation and speciation. SVs were classically defined as chromosomal rearrangements larger than 1kb, but due to a higher resolution of new detection methods, smaller variants (between 50 and 1000 base pairs) can now be accurately assessed. Besides various methods of detection in next generation sequencing data (paired end mapping, split reads, and depth of coverage), array-based approaches have proven to be particularly useful for detecting copy number variations (CNVs). These technologies have enabled researchers to catalog a wide spectrum of SVs in many organisms and infer the effects of selection shaping their evolutionary trajectories.

Structure variation sequencing signature (Source: NatRev Genetics)

Related tools, databases and publications are listed below. If you know any interesing papers, please let us know in comment section:

Key concepts

Structural variation includes balanced variants such as inversions and translocations, and unbalanced ones such as duplications and deletions (copy number variations or CNVs).

Structural variants can arise by several mechanisms, including nonallelic homologous recombination (NAHR), nonhomologous end‐joining (NHEJ) and DNA replication‐based fork stalling and template switching (FoSTeS).

CNV is closely linked to segmental duplication, but is not exactly the same. Segmental duplications can stimulate CNV formation by NAHR, and themselves arise from CNVs that have become fixed.

Segmental duplications did not appear uniformly during the evolution of the Great Ape species, but rather during a burst of activity around the time of the divergence of gorilla from the human/chimpanzee ancestor.

Duplicated genes play a critical role in the evolution of a genome as they act as ‘spare parts’ than can evolve to perform new or more specialized functions.

Effects of structural variation on gene expression can be identified but only a few examples of the consequences for species biology have been documented.

Tools

CNVnatora tool for CNV discovery and genotyping from depth of read mapping.2011a,2011b

AGEa tools that implements an algorithm for optimal alignment of sequences with SVs.2011

BreakSeqa pipeline for annotation, classification and analysis of SVs at single nucleotide resolution.2010

PEMera computational and simulation framework for discovering SVs by paired-end read mapping.2009,2007

GASV https://code.google.com/archive/p/gasv/

PAIROSCOPE http://pairoscope.sourceforge.net/

SVDetect http://svdetect.sourceforge.net/Site/Home.html

BreakPtr, discovery of unbalanced structural variants (copy-number variants) with tiling microarrays Link

R Package https://www.bioconductor.org/help/course-materials/2010/EMBL2010/Practical-4-StructuralVariants.pdf

BreakSeq, structural variant genotyping using split reads Link

CopySeq, genotyping of unbalanced structural variants (copy-number variants) using read-depth Link

DELLY2, integrated structural variant discovery, genotyping and visualization in deep sequencing data Link

PEMer, structural variant discovery in 454 sequencing data by paired-end mapping Link

TIGER, transduction inference in germline genomes using short read data Link

MANTA https://github.com/Illumina/manta

SV-Bay https://github.com/InstitutCurie/SV-Bay

BreakDancer http://breakdancer.sourceforge.net/

Variation Hunter http://compbio.cs.sfu.ca/software-variation-hunter

Lumpy https://github.com/arq5x/lumpy-sv

ForestSV http://sebatlab.ucsd.edu/index.php/software-data

PBSuites for long reads https://sourceforge.net/projects/pb-jelly/

Visualization

The SV visualization tool: http://genomesavant.com/savant/

InGAP-SV (http://ingap.sourceforge.net/) that is nice tools for both detection and visualisation of severals kind of structural variations (Large insertions, translocation, deletion, inversions....)

Tools table: http://www.nature.com/nbt/journal/v29/n8/fig_tab/nbt.1904_T2.html

Variation Viewer https://www.ncbi.nlm.nih.gov/variation/view/

Papers

http://www.nature.com/nmeth/journal/v9/n2/full/nmeth.1858.html

http://journal.frontiersin.org/researchtopic/1412/structural-variations-in-genomes-ecological-and-evolutionary-implications

http://www.mi.fu-berlin.de/wiki/pub/ABI/GenomicsLecture10Materials/structural-variation.pdf

http://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-015-1479-3

https://www.ncbi.nlm.nih.gov/dbvar/content/overview/

http://www.nature.com/subjects/structural-variation

https://eichlerlab.gs.washington.edu/news/NatMeth_Feb2012.pdf

https://www.ncbi.nlm.nih.gov/pubmed/19477992 ***

https://www.ncbi.nlm.nih.gov/pubmed/22452995

http://biorxiv.org/content/early/2016/09/06/073833

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4479793/

http://www.nature.com/articles/srep18501

http://www.genetics.org/content/202/1/351

http://www.cs.cmu.edu/~sssykim/teaching/s13/slides/Lecture_SVI.pdf

https://www.omicsonline.org/open-access/structural-variation-detection-from-next-generation-sequencing-2469-9853-S1-007.php?aid=69055

http://schatzlab.cshl.edu/presentations/2016/2016.01.12.PAG.Structural%20Variations.pdf

E-MEM: Efficient computation of Maximal Exact Matches

Jit — Thu, 15 Dec 2016 09:30:43 -0600

E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.

E-MEM source code

The source code can be downloaded here.

If you use E-MEM, please cite:

N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/