BOL: Related items

PostDoc Scientist Bioinformatics at CCMB

Fri, 26 Sep 2014 19:58:41 -0500

1. Project Assistant/Junior Research Fellow/ Project Fellow [PA_JRF_PF]

a) M.Sc/or equivalent in biological sciences/related areas [Position Code: PA_JRF_PF_a]
b) B.E/B.Tech/ M.Sc in biotechnology/bioinformatics/computer science/Chemistry/Physics or MCA [Position Code: PA_JRF_PF_b]
c) M.Sc/or equivalent in wildlife sciences/ecology/environmental sciences or MBBS/BVSc/MVSc. [Position Code: PA_JRF_PF_c]

(Candidates with result awaited are NOT eligible to apply)

Upper Age limit 28years

Rs.12000 / Rs.16000 (as sanctioned by the funding agency)

2. Post Doctoral Fellow/Research Associate in multiple research areas [PDF_RA]

Ph.D. (submitted/awarded) in any branch of biological Sciences. Candidates with Ph.D. in other sciences are also encouraged to apply.

Experience in molecular biology, biochemistry, structural biology, cell biology, infectious disease, conservation genetics, veterinary science, reproductive biology, and molecular diagnostics is desired but not mandatory.

[Position Code: PDF_RA]

UpperAge limit 35years

Rs. 22000- 26000 (as sanctioned by the funding agency)

3. Post Doctoral Scientist Fellow [PDSF]

Ph.D in any of the following areas: bioinformatics, next generation sequencing, high throughput data analysis, proteomics, bio-statistics, computer science, information technology, computer hardware and networking/clustering, parallel processing.
[Position Code: PDSF]

Upper Age limit 40 years

Rs. 40000 consolidated (as sanctioned by the funding agency)

Download Application: Last date for apply online: 09th Oct 2014

Advertisement: www.ccmb.res.in//index.php?view=notifications&mid=0&id=71&nid=38

Apply online http://www.ccmb.res.in/positions/temp_notif/online_form.html

More at http://www.ccmb.res.in//index.php?view=notifications&mid=0&id=71&nid=38

RapClust: Accurate, Lightweight Clustering of de novo Transcriptomes using Fragment Equivalence Classes

Rahul Nayak — Thu, 04 Oct 2018 17:57:10 -0500

RapClust is a tool for clustering contigs from de novo transcriptome assemblies. RapClust is designed to be run downstream of the Sailfish or Salmon tools for rapid transcript-level quantification. Specifically, RapClust relies on the fragment equivalence classes computed by these tools in order to determine how seqeunce is shared across the transcriptome, and how reads map to potentially-related contigs across different conditions.

Address of the bookmark: https://github.com/COMBINE-lab/RapClust

MMseqs2: ultra fast and sensitive sequence search and clustering suite

Abhi — Wed, 06 Oct 2021 07:01:14 -0500

MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.

Address of the bookmark: https://github.com/soedinglab/MMseqs2

Genome Stability Laboratory

Mon, 07 Mar 2016 04:16:32 -0600

The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims.

More at http://faculty.iisertvm.ac.in/~nishantkt/index.html

D-GENIES: A tool for Dotplot large Genomes in an Interactive, Efficient and Simple way

Jit — Mon, 11 Jun 2018 09:41:22 -0500

D-GENIES – for Dotplot large Genomes in an Interactive, Efficient and Simple way – is an online tool designed to compare two genomes. It supports large genome and you can interact with the dot plot to improve the visualisation. We use minimap version 2 to align the two genomes. Then, the PAF file is parsed and plotted into an interactive plot written with d3.js library. D-Genies also allows to display dot plots from other aligners by uploading their PAF or MAF alignment file. http://dgenies.toulouse.inra.fr/

Address of the bookmark: http://dgenies.toulouse.inra.fr/

gVolante: Completeness Assessment of Genome/Transcriptome Sequences

Jit — Tue, 06 Aug 2019 21:37:56 -0500

gVolante provides an online interface for completeness assessment of user’s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and transcriptome assemblies.

Address of the bookmark: https://gvolante.riken.jp/

Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation

Jit — Tue, 16 Mar 2021 05:45:44 -0500

We demonstrate a novel approach forlocal alignment of DNA reads with respect to reference genome.For this process we have used Skip-gram model for creatingencoding(Nucl2Vec) and k-nearest neighbor for the alignment.With our new approach we have reduced computation cost forlocal alignment , while achieving accuracy comparable to existingdefacto standard BWA-MEM tool.

https://prakharg24.github.io/papers/401851.full.pdf

Address of the bookmark: https://prakharg24.github.io/papers/401851.full.pdf

minimap2: A versatile pairwise aligner for genomic and spliced nucleotide sequences

Jit — Wed, 20 Jun 2018 07:55:29 -0500

git clone https://github.com/lh3/minimap2 cd minimap2 && make # long sequences against a reference genome ./minimap2 -a test/MT-human.fa test/MT-orang.fa > test.sam # create an index first and then map ./minimap2 -d MT-human.mmi test/MT-human.fa ./minimap2 -a MT-human.mmi test/MT-orang.fa > test.sam # use presets (no test data) ./minimap2 -ax map-pb ref.fa pacbio.fq.gz > aln.sam # PacBio genomic reads ./minimap2 -ax map-ont ref.fa ont.fq.gz > aln.sam # Oxford Nanopore genomic reads ./minimap2 -ax sr ref.fa read1.fa read2.fa > aln.sam # short genomic paired-end reads ./minimap2 -ax splice ref.fa rna-reads.fa > aln.sam # spliced long reads ./minimap2 -ax splice -k14 -uf ref.fa reads.fa > aln.sam # Nanopore Direct RNA-seq ./minimap2 -cx asm5 asm1.fa asm2.fa > aln.paf # intra-species asm-to-asm alignment ./minimap2 -x ava-pb reads.fa reads.fa > overlaps.paf # PacBio read overlap ./minimap2 -x ava-ont reads.fa reads.fa > overlaps.paf # Nanopore read overlap # man page for detailed command line options man ./minimap2.1

Address of the bookmark: https://github.com/lh3/minimap2

RopeBWT2: Incremental construction of FM-index for DNA sequences

Rahul Nayak — Thu, 25 Oct 2018 04:48:54 -0500

RopeBWT2 is an tool for constructing the FM-index for a collection of DNA sequences. It works by incrementally inserting one or multiple sequences into an existing pseudo-BWT position by position, starting from the end of the sequences. This algorithm can be largely considered a mixture of BCR and dynamic FM-index. Nonetheless, ropeBWT2 is unique in that it may implicitlysort the input into reverse lexicographical order (RLO) or reverse-complement lexicographical order (RCLO) while building the index.

Address of the bookmark: https://github.com/lh3/ropebwt2

LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.

Neel — Sun, 13 Jan 2019 07:05:53 -0600

LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.

The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE, http://www.expasy.org/prosite/) to locate cores of important enzymes if they occur.

Address of the bookmark: https://github.com/xzhub/LTR_Finder