<?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/29384?offset=1320</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=1320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/29407/live-webinar-on-rna-seq-data-analysis-on-9-nov-2016</guid>
	<pubDate>Wed, 19 Oct 2016 05:25:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/29407/live-webinar-on-rna-seq-data-analysis-on-9-nov-2016</link>
	<title><![CDATA[Live Webinar on RNA-Seq Data Analysis on 9 Nov 2016]]></title>
	<description><![CDATA[<p><strong><a href="http://www.strand-ngs.com/webinar_registration">Live Webinar on RNA-Seq Data Analysis</a></strong></p><p><a href="http://www.strand-ngs.com/webinar_registration">Abstract: </a>Strand NGS supports an extensive workflow for the analysis and visualization of RNA-Seq data. The workflow includes Transcriptome / Genome alignment, Differential expression analysis with Statistical approach and Splicing events detection. Strand NGS also supports novel discovery like identification of novel genes, exons and Novel splice junctions, alongside it can also detect gene fusion events. Further downstream analysis such as GO and pathway analysis can be performed on the set of interesting genes. The product has an option to create pipelines for time consuming jobs which automates analysis and leaves more time for end data interpretation. This webinar will give an overview of the features in the RNA-Seq data analysis workflow in Strand NGS and also highlights on parameters within each feature that can be optimized depending on datasets and analysis needs.</p><p><a href="http://www.strand-ngs.com/webinar_registration">Speaker:</a> Mr. Sugandan Sivamani, Senior Application Scientist, Strand Life Sciences</p><p>Date: 9th Nov, <a href="http://www.strand-ngs.com/webinar_registration">Session 1</a> for SAPK/ APFO: 2:30 PM IST Date: 9th Nov, <a href="http://www.strand-ngs.com/webinar_registration">Session 2</a> for AFO/ EMEA: 9:00 AM PST</p><p>Register here <a href="http://www.strand-ngs.com/webinar_registration">http://www.strand-ngs.com/webinar_registration</a></p>]]></description>
	<dc:creator>Strand</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/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></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/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19792/irishgrid-irish-grid-mapping-system</guid>
	<pubDate>Fri, 26 Dec 2014 07:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19792/irishgrid-irish-grid-mapping-system</link>
	<title><![CDATA[irishgrid: Irish Grid Mapping System]]></title>
	<description><![CDATA[<p>Perl module for creating geographic 10km-square maps using either SVG or PNG (with GD library) output format.</p>
<p>Originally design to map the location of objects in a 10 km map IrishGrid includes:</p>
<ul>
<li>native support of the Irish Grid System (see <a href="http://www.osi.ie/">http://www.osi.ie/</a>)</li>
<li>optimize for speed (there's as less as possible data to conversion)</li>
<li>customized color functions</li>
</ul>
<p>https://code.google.com/p/irishgrid/downloads/detail?name=irishgrid.pl</p><p>Address of the bookmark: <a href="https://code.google.com/p/irishgrid/" rel="nofollow">https://code.google.com/p/irishgrid/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23536/teaching-assistant-at-svims</guid>
  <pubDate>Fri, 31 Jul 2015 10:15:16 -0500</pubDate>
  <link></link>
  <title><![CDATA[Teaching Assistant at SVIMS]]></title>
  <description><![CDATA[
<p>Eligible candidates are invited for a walk-in-interview for recruitment of Teaching Assistant in the Department of Bioinformatics on 8.08.2015 at 10 A.M. in the Committee Hall, SVIMS, Tirupati. The candidates have to attend with all original certificates of qualification, experience on the date of interview. The engagement will be made purely on adhoc basis for a period of 6 months and it can be terminated at any time without notice or without assigning any reason thereof. This is purely an adhoc appointment and the candidate will not have any right to claim permanent benefits of any kind.</p>

<p>1. Remuneration : Rs. 12000/- per month (consolidated)</p>

<p>2. Qualification : M.Sc./M.Tech. Bioinformatics (preference will be given to the candidates with BINC / NET / GATE / Bioinformatics DBT-Traineeship / Studentship and teaching experience)</p>

<p>3. Place of work : Department of Bioinformatics, SVIMS, Tirupati</p>

<p>4. No. of Position : One</p>

<p>Terms and conditions:</p>

<p>1. Candidates are required to submit the Biodata, attested copies of relevant certificates in support of their age, educational qualification, experience etc., before the interview committee, SVIMS University, Tirupati.<br />2. No TA / DA will be paid for attending the interview.<br />3. Interim enquiries will not be entertained.<br />4. The maximum age limit for Teaching Assistant is 34 years as on 8th August, 2015.<br />5. The tenure of will be further extended subject to performance of the incumbent.</p>

<p>Advertisement: http://svimsbic.org/Teaching_Assistant_B.I._2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/19838</guid>
	<pubDate>Sat, 27 Dec 2014 13:30:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/view/19838</link>
	<title><![CDATA[Interview with a bioinformatician series ...]]></title>
	<description><![CDATA[<p>The aim of this series to interviews some notable bioinformaticians to get their views on various aspects of bioinformatics research. Hopefully these answers will prove useful to others in the field, especially to those who are just starting their bioinformatics careers.<br /><br />This series will be available at BOL every fortnight.<br /><br /><br /><br /></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>