BOL: Related items

3D de novo assembly (3D DNA) pipeline

Jit — Sun, 02 Feb 2020 13:41:55 -0600

For a detailed description of the pipeline and how it integrates with other tools designed by the Aiden Lab see Genome Assembly Cookbook on http://aidenlab.org/assembly.

For the original version of the pipeline and to reproduce the Hs2-HiC and the AaegL4 genomes reported in (Dudchenko et al., Science, 2017) see the original commit.

For the detailed description of the merge section see https://github.com/theaidenlab/AGWG-merge.

Address of the bookmark: https://github.com/theaidenlab/3d-dna

BlobToolKit: A toolkit for genome assembly QC

Jit — Fri, 21 Feb 2020 00:17:50 -0600

Filtering raw genomic datasets is essential to avoid chimeric assemblies and to increase the validity of sequence-based biological inference. BlobToolKit extends the BlobTools1/Blobology2 approach to simplify interactive and reproducible filtering.

BlobToolKit is comprised of four components:

BlobToolKit Viewer allows browser-based interactive visualisation and filtering of preliminary or published genomic datasets even for highly fragmented assemblies.
BlobTools2 is a command-line program to convert assemblies and analysis results into datasets that can be further processed using BlobTools2 and/or visualised in the Viewer.
The BlobToolKit Specification features a formal schema and validator for the JSON-based BlobDir format used by BlobTools2 and the Viewer.
The BlobToolKit Pipeline is a configurable Snakemake pipeline that automates all steps from retrieving public datasets through running analyses and generating a BlobDir dataset with BlobTools2, ready for visualisation in the Viewer.

Paper https://www.biorxiv.org/content/10.1101/844852v1.full.pdf

Address of the bookmark: https://blobtoolkit.genomehubs.org/

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

CSIR Nehru Science Postdoctoral Research Fellowship

Tue, 29 Nov 2016 12:34:59 -0600

CSIR Nehru Science Postdoctoral Research Fellowship

About Fellowship:
CSIR Nehru Science Postdoctoral Research Fellowship Scheme is an Research Fellowship awarded/given by HRD Ministry, Govt. of India every year to more than 100 fellows.

It was started to identify promising and young researchers with novel ideas and provide them research opportunities in the areas of basic science, engineering, medicine & agriculture.

The fellowship aims at facilitating their transition from mentored to independent research career.

In addition, check these ICTS Research Fellowships:
1.) Max-Planck Partner Group Fellowships 2017-18
2.) ICTS-Simons Postdoctoral Fellowships 2017
3.) ICTS Post Doctoral Fellowships 2017
4.) Airbus Prize Postdoctoral Fellowship 2017-18

Eligibility: To be eligible for this fellowship, you:
1.) PhD degree (within 3 years of award of PhD degree), OR
2.) Those who have submitted PhD theses.
3.) Applicants should have research publications in good impact factor SCI journals.
4.) Indian nationals, Persons of Indian Origin (PIO) & Overseas Citizen of India (OCI), a can also apply.
5.) Maximum Age Limit: 32 years.

Duration:
– 2 Years.
– extendable for a maximum of 1 more year based on performance.

Remuneration:
– Rs. 50,000/- per month plus House Rent Allowance (HRA)
– A contingency grant of Rs. 3.0 lakh per annum.
– 25% of the contingency grant can be used for domestic and international travel.

Mode of Selection: You can apply throughout the year, but selection will be made twice a year, in June and December.

How to Apply:
– Read the instructions, given at Annexure-I in this PDF file.
– And, application form is given as, Annexure-II.
– Fill the form & send it to the given address in the PDF file.

Deadline: Rolling Deadline (Applications accepted throughout the year)

Also See: Research Internship/ Fellowship in India:
1.) IIT Bombay Research Internship Awards Programme 2016-17
2.) IIT Delhi Internship Program 2016-17
3.) DAAD WISE – International Internship in Germany
4.) Summer Research Fellowship Programme| JNCASR Bangalore
5.) Indian Academy of Sciences Summer Internships 2017
6.) Winter Internship – IIT Bombay NPDE-TCA
7.) Viterbi – India Program 2017 | Research Internship in US
8.) Internship – Centre for Stem Cell Research, Vellore

Accommodation & other benefits:
– Accommodation may be provided by CSIR, if available.
– Medical benefits as per CSIR norms.

For more details:
– Check this PDF Notification of Fellowship.
– List of CSIR Labs & their work/activities can be seen at www.csir.res.in.

PRISM

Jit — Sat, 10 Dec 2016 15:19:40 -0600

PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.

PRISM and PRISM_CTX were originally designed and written by Michael Brudno and Yue Jiang, The original PRISM publication can be found here.

The authors may be contacted via e-mail at: prism at cs.toronto.edu.

Additional information is available in the PRISM README file and PRISM_CTX README file.

http://compbio.cs.toronto.edu/prism/

Address of the bookmark: http://compbio.cs.toronto.edu/prism/

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/

quarTeT: a telomere-to-telomere toolkit for gap-free genome assembly and centromeric repeat identification.

Abhi — Sat, 08 Jun 2024 15:54:36 -0500

quarTeT is a collection of tools for T2T genome assembly and basic analysis in automatic workflow.

Task include:

AssemblyMapper : reference-guided genome assembly
GapFiller : long-reads based gap filling
TeloExplorer : telomere identification
CentroMiner : centromere candidate prediction

https://academic.oup.com/hr/article/10/8/uhad127/7197191?login=false

Address of the bookmark: http://www.atcgn.com:8080/quarTeT/home.html

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/

Mercator

Jit — Mon, 06 Feb 2017 04:20:36 -0600

Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:

For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.
Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use BLAT to do this all-vs-all comparison with alignments being performed in protein space.
Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.
Identify cliques in this graph. These cliques are potential anchors to be used in the map.
Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.
The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as MAVID) to do a detailed alignment of each orthologous segment.

https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: https://www.biostat.wisc.edu/~cdewey/mercator/

CLgenomics

Radha Agarkar — Fri, 03 Mar 2017 09:57:28 -0600

CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes.

To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics). Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers >40,000 CLG files of publicly available Bacterial and Archaeal genomes.

Address of the bookmark: https://chunlab.wordpress.com/clgenomics-software/