<?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/29343?offset=1090</link>
	<atom:link href="https://bioinformaticsonline.com/related/29343?offset=1090" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19161/niab-molecular-biologybioinformatics-scientistra-openings</guid>
  <pubDate>Thu, 13 Nov 2014 13:37:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[NIAB Molecular Biology/Bioinformatics Scientist/RA Openings]]></title>
  <description><![CDATA[
<p>D. No. 1-121/1, 4th and 5th Floors, Axis Clinicals Building, Miyapur, Hyderabad, Telangana, India- 500 049</p>

<p>Email: admin@niab.org.in Telephones: +91 40 2304 9403 Telefax: +91 40 2304 2740<br />Advertisement No: 5/2014</p>

<p>About NIAB National Institute of Animal Biotechnology (NIAB), Hyderabad, an autonomous institute under the aegis of Department of Biotechnology, Government of India, is aimed to harness novel and emerging biotechnologies and create knowledge in the cutting edge areas for improving animal health and productivity.</p>

<p>Applications are invited for the following temporary research positions to work in ongoing DBTBBSRC sponsored research project entitled “Transcriptome Analysis in Indian buffalo and the Genetics of Innate Immunity” at the National Institute of Animal Biotechnology, Hyderabad.</p>

<p>(A) Project Scientist – Level B (One Position)</p>

<p>Emoluments: Rs. 15600 + GP Rs. 5400 + 30 % HRA p.m. (Total emoluments will be Rs. 49,770/-p.m. for the duration of the project)</p>

<p>Essential Qualification: Candidates having M.V.Sc. in Veterinary Microbiology / Veterinary Pathology / Veterinary Public Health / Ph.D. degree in Life Sciences, Biotechnology, Molecular Biology or any other related field from the recognized university are eligible to apply.</p>

<p>The candidate should have a good academic record and research experience as evidenced from published in standard referred journals / patents.</p>

<p>Desirable: Candidates having research experience in the area of tissue culture, genomics, Transcriptomics and Advanced Molecular Biology will be given preference.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>(B) Research Associate in Bioinformatics (One position)</p>

<p>Fellowship: Rs. 22,000 + 30 % HRA</p>

<p>Essential Qualification: Candidates having Ph.D. degree or M.Tech. with three years of<br />experience in Bioinformatics, Computational Biology, Biotechnology, Life Sciences or any other related field are eligible to apply.</p>

<p>Desirable: Candidate having research experience in the area of next generation sequencing (NGS) data analysis, Genome wide association studies, Genomic selection, advance genomic data analysis etc., will be given preference. The candidate should have a good academic record and research experience as evidenced from published papers in standard journals / patents.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>Project Duration: The duration of the project is Three years and the positions are co- terminus with the duration of the project. (Initial appointment will be for one year and further extension will be granted based on annual review).</p>

<p>Mode of submission of application: Only online applications are to be submitted through<br />www.niab.org.in on or before 08 December, 2014. Link for online submission of applications will be available from 10 November 2014.</p>

<p>Advertisement: www.niab.org.in/Notifications/Advt_5_2014/Advt_5_2014.pdf</p>
]]></description>
</item>
<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/19249/bioinformatics-jrfrasrf-position-at-panjab-university</guid>
  <pubDate>Wed, 19 Nov 2014 20:19:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at PANJAB UNIVERSITY]]></title>
  <description><![CDATA[
<p>CENTRE FOR SYSTEMS BIOLOGY &amp; BIOINFORMATICS<br />UIEAST, PANJAB UNIVERSITY, CHANDIGARH</p>

<p>Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology &amp; Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of<br />the project.</p>

<p>Essential Qualification</p>

<p>For Research Fellow:-</p>

<p>M.Sc. in Systems Biology and Bioinformatics / Life Sciences with minimum 55% marks.</p>

<p>Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology &amp; Bioinformatics will also be eligible.</p>

<p>For Program Assistant:-</p>

<p>The candidate must have M.Sc./M.Tech/MCA/PGDCA in Computer Science and must be able to handle LAN, Linex. Preference will be given to the candidate having experience in<br />System Administration.</p>

<p>Emoluments</p>

<p>For Research Fellow Rs. 12,500/- per month (Fixed)<br />For Program Assistant Rs. 12,500/- per month (Fixed)</p>

<p>Applications should be reach on or before 19-11-2014 in the office of the undersigned.</p>

<p>Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology &amp; Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.</p>

<p>Advertisement:</p>

<p>http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf</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/opportunity/view/19541/bioinformatics-sub-dic-dic</guid>
  <pubDate>Fri, 12 Dec 2014 21:14:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics SUB DIC (DIC)]]></title>
  <description><![CDATA[
<p>Project Title BIOINFORMATICS SUB DIC (DIC)</p>

<p>Reference Number IIT/SRIC/R/DIC/2014/314, DATED 28thNovember, 2014</p>

<p>Temporary Position(s)</p>

<p>i) Junior/ Senior Project Officer (1)<br />ii) Junior Project Assistant (2)</p>

<p>Consolidated Compensation</p>

<p>i) Rs.16,000/- to Rs.18,000/- p.m. (depending on qualification &amp; experience)<br />ii) Rs.8,000/- to Rs.10,000/- p.m. (depending on qualification &amp; experience)</p>

<p>Coordinator / PI Dr. Sudip K. Ghosh, Dept of Biotechnology.</p>

<p>Department / Centre / School Dept of Biotechnology </p>

<p>Qualifications &amp; Experience</p>

<p>(i) M. Sc in any branch of Life Sciences with experience in Molecular  Biology/Genetics/Biochemistry preferably a Post Graduate diploma in Bioinformatics or two years working experience in bioinformatics (Minimum 60% marks starting from matriculation examination).</p>

<p>(ii) B. Sc. /B.A. /B. Com/Diploma in Management or Computer Science. Knowledge in computer software will be preferred (minimum 50% marks starting from matriculation examination).</p>

<p>More Information</p>

<p>Interested eligible persons may apply on plain paper, giving full bio-data along with attested copies of testimonials to the undersigned on or before 11thDecember, 2014. </p>

<p>Sponsor DBT, NEW DELHI</p>

<p>Last Date 11 Dec 2014</p>

<p>Application Fee Demand Draft for Rs.50/- (Not for female candidates) drawn in favour of IIT Kharagpur payable at Kharagpur</p>

<p>Advertisement: www.iitkgp.ac.in/topfiles/sric_job_details.php?serial=2826</p>
]]></description>
</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/blog/view/37236/installing-salmon-for-trinity</guid>
	<pubDate>Tue, 03 Jul 2018 09:02:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</link>
	<title><![CDATA[Installing Salmon for Trinity !]]></title>
	<description><![CDATA[
<p>➜  trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ conda install salmon<br />Solving environment: done</p>

<p>## Package Plan ##</p>

<p>  environment location: /home/urbe/anaconda3</p>

<p>  added / updated specs: <br />    - salmon</p>

<p>The following packages will be downloaded:</p>

<p>    package                    |            build<br />    ---------------------------|-----------------<br />    boost-1.64.0               |           py36_4         331 KB  conda-forge<br />    jemalloc-5.1.0             |       hfc679d8_0         8.2 MB  conda-forge<br />    boost-cpp-1.64.0           |                1        17.8 MB  conda-forge<br />    salmon-0.10.2              |                1         3.7 MB  bioconda<br />    conda-4.5.5                |           py36_0         624 KB  conda-forge<br />    tbb-2018_20171205          |                0         1.2 MB  conda-forge<br />    ------------------------------------------------------------<br />                                           Total:        31.8 MB</p>

<p>The following NEW packages will be INSTALLED:</p>

<p>    boost:     1.64.0-py36_4    conda-forge<br />    boost-cpp: 1.64.0-1         conda-forge<br />    jemalloc:  5.1.0-hfc679d8_0 conda-forge<br />    salmon:    0.10.2-1         bioconda   <br />    tbb:       2018_20171205-0  conda-forge</p>

<p>The following packages will be UPDATED:</p>

<p>    conda:     4.5.4-py36_0     conda-forge --&gt; 4.5.5-py36_0 conda-forge</p>

<p>Proceed ([y]/n)? y</p>

<p>Downloading and Extracting Packages<br />boost-1.64.0         |  331 KB | ####################################################################################################################################### | 100% <br />jemalloc-5.1.0       |  8.2 MB | ####################################################################################################################################### | 100% <br />boost-cpp-1.64.0     | 17.8 MB | ####################################################################################################################################### | 100% <br />salmon-0.10.2        |  3.7 MB | ####################################################################################################################################### | 100% <br />conda-4.5.5          |  624 KB | ####################################################################################################################################### | 100% <br />tbb-2018_20171205    |  1.2 MB | ####################################################################################################################################### | 100% <br />Preparing transaction: done<br />Verifying transaction: done<br />Executing transaction: done</p>
]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19580/internship-program-for-bioinformatics-biotechnology-mba-mca-no-of-vacancy-5</guid>
  <pubDate>Mon, 15 Dec 2014 08:11:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Internship Program for Bioinformatics / Biotechnology / MBA / MCA (No. Of Vacancy: 5)]]></title>
  <description><![CDATA[
<p>ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology / MBA / MCA students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis or marketing or software development. Applications are accepted throughout the year. Accepted students will be notified through email.</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>

</channel>
</rss>