<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/27216?offset=1250</link>
	<atom:link href="https://bioinformaticsonline.com/related/27216?offset=1250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22028/walk-in-for-research-asst-programmer-enterovirus-research-centre-mumbai-india</guid>
  <pubDate>Tue, 14 Apr 2015 12:36:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk in for Research Asst &amp; Programmer Enterovirus Research Centre Mumbai - India]]></title>
  <description><![CDATA[
<p>Enterovirus Research Centre Mumbai Jobs 2015 –</p>

<p>Walk in for Research Asst &amp; Programmer Posts: Enterovirus Research Centre, Mumbai, Indian Council of Medical Research has issued notification for the recruitment of Research Asst &amp; Programmer vacancies on temporary basis for the project entitled “An Atlas of Non-Polio Enterovirus Types Isolated from Cases of Acute Flaccid Paralysis in India”. Eligible candidates may walk in on 20-04-2015 from 10:00 AM to 12:00 Noon. Other details like age limit, educational qualification, how to apply are given below…</p>

<p>Enterovirus Research Centre Mumbai Vacancy Details:<br />Total No. of Posts: 04<br />Name of the Posts:<br />1. Research Assistant: 03 Posts<br />2. Programmer: 01 Post</p>

<p>Age Limit: Candidates age should below 28 years. Age relaxations are applicable as per rules.</p>

<p>Educational Qualification: Candidates should have M.Sc (1st Class) in Microbiology/ Bioinformatics/ Biotechnology/ Life Science for post 1, BE/ B.Tech/ MCA for post 2.</p>

<p>Selection Process: Candidates are selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates may attend for interview along with original certificates, CV, attested copies of relevant certificates, one recent passport size photograph duly affixed on right side of application at Enterovirus Research Centre, Mumbai, Indian Council of Medical Research, Haffkine Institute Cmpound, Acharya Donde Marg, Parel, Mumbai-400012 on 20-04-2015 from 10:00 AM to 12:00 Noon.</p>

<p>Important Dates:<br />Date &amp; Time of Interview: 20-04-2015 from 10:00 AM to 12:00 Noon.<br />Registration Time: 12:00 Noon.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:15:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper round THREE ...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22050" length="316" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</guid>
	<pubDate>Tue, 29 May 2018 07:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</link>
	<title><![CDATA[Porechop:  tool for finding and removing adapters from Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Porechop is a tool for finding and removing adapters from <a href="https://nanoporetech.com/">Oxford Nanopore</a> 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.</p>
<p>Porechop also supports demultiplexing of Nanopore reads that were barcoded with the <a href="https://store.nanoporetech.com/native-barcoding-kit-1d.html">Native Barcoding Kit</a>, <a href="https://store.nanoporetech.com/pcr-barcoding-kit-96.html">PCR Barcoding Kit</a> or <a href="https://store.nanoporetech.com/rapid-barcoding-sequencing-kit.html">Rapid Barcoding Kit</a>.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Porechop" rel="nofollow">https://github.com/rrwick/Porechop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22130/senior-research-fellow-srf-bioinformatics-at-central-institute-for-research-on-buffaloes</guid>
  <pubDate>Sat, 18 Apr 2015 04:30:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes]]></title>
  <description><![CDATA[
<p>Senior Research Fellow (SRF) Bioinformatics at Central Institute for Research on Buffaloes<br />Address: Central Institute for Research on Buffaloes, Sirsa Road, Hisar<br />State: Haryana<br />Pay Scale: Post Graduate in subjects other than Veterinary Science Rs. 16000/- per month for 1st and 2nd year and Rs. 18000/- per month for 3rd year. Post Graduate in Veterinary Science Rs. 18000/- per month for 1st and 2nd Year and Rs. 20000/- per month for 3rd year.<br />Educational Requirements: Master’s degree in biotechnology/animal biotechnology, veterinary/animal biochemistry, veterinary microbiology or veterinary/animal physiology/Nano Technology/Bioinformatics or related area.<br />Qualifications: Ph.D in relevant field/experience of working in any research project<br />Details will be available at: http://www.cirb.res.in/attachments/195_Walk-in-Interview%20for%20Senior%20Research%20Fellow%20%28SRF%29%20%28On%20Dated%2020.4.2015%29.pdf<br />How To Apply: Interested candidates who fulfill the above conditions should report for interview with a copy of their bio-data, photocopy and original certificates and testimonials, other related material i.e. reports, documents, articles, etc., if any.<br />Date &amp; Time of Interview: 20.04.2015 at 11.00 hrs<br />Venue: CIRB, Hisar</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</guid>
	<pubDate>Tue, 03 Jul 2018 08:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37233/rna-seq-analysis-workshop-course-materials</link>
	<title><![CDATA[RNA-seq Analysis Workshop Course Materials]]></title>
	<description><![CDATA[RNAseq can be roughly divided into two "types":

Reference genome-based - an assembled genome exists for a species for which an RNAseq experiment is performed. It allows reads to be aligned against the reference genome and significantly improves our ability to reconstruct transcripts. This category would obviously include humans and most model organisms but excludes the majority of truly biologically intereting species (e.g., Hyacinth macaw);

Reference genome-free - no genome assembly for the species of interest is available. In this case one would need to assemble the reads into transcripts using de novo approaches. This type of RNAseq is as much of an art as well as science because assembly is heavily parameter-dependent and difficult to do well.
In this lesson we will focus on the Reference genome-based type of RNA seq.

http://chagall.med.cornell.edu/RNASEQcourse/<p>Address of the bookmark: <a href="http://chagall.med.cornell.edu/RNASEQcourse/" rel="nofollow">http://chagall.med.cornell.edu/RNASEQcourse/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22236/savitribai-phule-pune-university-recruitment-for-04-jrf-post-in-april-2015</guid>
  <pubDate>Mon, 27 Apr 2015 20:28:59 -0500</pubDate>
  <link></link>
  <title><![CDATA[Savitribai Phule Pune University Recruitment for 04 JRF Post in April 2015]]></title>
  <description><![CDATA[
<p>Savitribai Phule Pune University announced application for recruitment to the post of Junior Research Fellow. The candidates for the post can apply through prescribed format before 10 May 2015.<br />Description:</p>

<p>Important Date &amp; Details</p>

<p>Closing Date for Registration: 10 May 2015</p>

<p>Details of Post</p>

<p>Name of Post: Junior Research Fellow- 04 Posts</p>

<p>Pay Scale: Rs. 12,000 or 16,00+ HRA Post Graduate degree with NET (16,000+HRA) Post Graduate Degree (12,000+HRA)</p>

<p>Eligibility Criteria: M.Sc. in Microbiology/Marine Microbiology/ Marine Biotechnology/Biotechnology/Bioinformatics/Zoology or equivalent degree with minimum 60% marks or equivalent grade</p>

<p>Age Limit- Not more than 28 years</p>

<p>Organisation Name: Savitribai Phule Pune University<br />Eligibility for the post:</p>

<p>Selection Procedure: The selection procedure is through personal interview. No TA/DA will be paid for appearing in the interview.</p>

<p>How to Apply: The candidates may send their application along with CV to the Head Department of Zoology, Savitribai Phule University on or before 10 May 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37514/list-of-non-commercial-ngs-genotype-calling-software</guid>
	<pubDate>Thu, 09 Aug 2018 04:21:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37514/list-of-non-commercial-ngs-genotype-calling-software</link>
	<title><![CDATA[List of non-commercial NGS genotype-calling software]]></title>
	<description><![CDATA[<p><span>Meaningful analysis of next-generation sequencing (NGS) data, which are produced extensively by genetics and genomics studies, relies crucially on the accurate calling of SNPs and genotypes. Recently developed statistical methods both improve and quantify the considerable uncertainty associated with genotype calling, and will especially benefit the growing number of studies using low- to medium-coverage data.&nbsp;</span></p><p><span>A list of programs for genotype and SNP calling :</span></p><p><br />SOAP2&nbsp;http://soap.genomics.org.cn/index.html</p><p>Single-sample High-quality variant database (for example, dbSNP) Package for NGS data analysis, which includes a single individual genotype caller (SOAPsnp)</p><p>realSFS&nbsp;http://128.32.118.212/thorfinn/realSFS/</p><p>Single-sample Aligned reads Software for SNP and genotype calling using single individuals and allele frequencies. Site frequency spectrum (SFS) estimation</p><p>Samtools http://samtools.sourceforge.net/</p><p>Multi-sample Aligned reads Package for manipulation of NGS alignments, which includes a computation of genotype likelihoods (samtools) and SNP and genotype calling (bcftools)</p><p>GATK http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit Multi-sample Aligned reads Package for aligned NGS data analysis, which includes a SNP and genotype caller (Unifed Genotyper), SNP filtering (Variant Filtration) and SNP quality recalibration (Variant Recalibrator)</p><p>Beagle http://faculty.washington.edu/browning/beagle/beagle.html</p><p>Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation, phasing and association that includes a mode for genotype calling</p><p>IMPUTE2 http://mathgen.stats.ox.ac.uk/impute/impute_v2.html</p><p>Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation and phasing, including a mode for genotype calling. Requires fine-scale linkage map</p><p>QCall ftp://ftp.sanger.ac.uk/pub/rd/QCALL</p><p>Multi-sample LD &lsquo;Feasible&rsquo; genealogies at a dense set of loci, genotype likelihoods Software for SNP and genotype calling, including a method for generating candidate SNPs without LD information (NLDA) and a method for incorporating LD information (LDA). The &lsquo;feasible&rsquo; genealogies can be generated using Margarita (http://www.sanger.ac.uk/resources/software/margarita)</p><p>MaCH http://genome.sph.umich.edu/wiki/Thunder</p><p>Multi-sample LD Genotype likelihoods Software for SNP and genotype calling, including a method (GPT_Freq) for generating candidate SNPs without LD information and a method (thunder_glf_freq) for incorporating LD information</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</guid>
	<pubDate>Fri, 09 Nov 2018 13:34:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</link>
	<title><![CDATA[AMStat: display statistics of large sequence files from next generation sequencing projects]]></title>
	<description><![CDATA[<p><span>SAMStat is an efficient C program to quickly display statistics of large sequence files from next generation sequencing projects. When applied to&nbsp;</span><a href="http://samstat.sourceforge.net/#about">SAM/BAM</a><span>&nbsp;files all statistics are reported for unmapped, poorly and accurately mapped reads separately. This allows for identification of a variety of problems, such as remaining linker and adaptor sequences, causing poor mapping. Apart from this SAMStat can be used to verify individual processing steps in large analysis pipelines.</span></p><p>Address of the bookmark: <a href="http://samstat.sourceforge.net/" rel="nofollow">http://samstat.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>