<?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/29912?offset=990</link>
	<atom:link href="https://bioinformaticsonline.com/related/29912?offset=990" 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/22615/jrf-position-%E2%80%93-bioinformatics-department-aravind-medical-research-foundation-amrf-madurai</guid>
  <pubDate>Fri, 12 Jun 2015 05:42:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Position – Bioinformatics Department, Aravind Medical Research Foundation (AMRF), Madurai.]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the post of Junior Research Fellow (JRF) to work at the Department of Bioinformatics, Aravind Medical Research Foundation in the following DST-SERB funded project “Clinical exome analysis pipeline for eye disease next-generation sequencing panel”.</p>

<p>Post: Junior Research Fellow (1 Position)</p>

<p>Duration: Three years</p>

<p>Qualification: First class in M.Sc/M.tech in Bioinformatics/Life Sciences/Biophysics/ Biostatistics/Bioengineering. Experience in Database development, NGS data analysis, Systems Biology and Structural Bioinformatics is desired. Preference will be given to the candidates with good computer programming skills in C, C++, R, Perl, PHP, Unix Scripting etc.</p>

<p>Selected candidates will be paid fellowship as per existing DST norms.</p>

<p>How to apply:</p>

<p>Candidates are requested to apply through one of the two modes given below<br />1. Online application – Click here to submit the online application https://docs.google.com/forms/d/16h2GLnQ-Ny-tLtlgfY3Bx3sCjeHJE30cfhJaDqW_uRs/viewform?c=0&amp;w=1<br />2. Application forms can be downloaded from here.https://docs.google.com/file/d/0BwwJEudQStxFWXdNWXl4NWtDaWc/edit<br /> Filled in application form should be sent by post to Dr. D. Bharanidharan, Department of Bioinformatics, Aravind Medical Research Foundation No 1, Anna Nagar Madurai – 625 020,</p>

<p>Candidates should apply by online or submit their applications by post on or before 15th June, 2015. Only Short listed candidates will be called for an interview. No TA/DA will be paid.</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/pages/view/22571/pattern-matching-problem-solution-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22571/pattern-matching-problem-solution-with-perl</link>
	<title><![CDATA[Pattern Matching Problem Solution with Perl]]></title>
	<description><![CDATA[<p>Problem at http://rosalind.info/problems/1c/</p><p>#Find all occurrences of a pattern in a string.<br />#Given: Strings Pattern and Genome.<br />#Return: All starting positions in Genome where Pattern appears as a substring. Use 0-based indexing.<br /><br />use strict;<br />use warnings;<br /><br />my $string="GATATATGCATATACTT";<br />my $subStr="ATAT";<br />my $kmer=length($subStr);<br /><br />kmerMatch ($string, $subStr, $kmer);<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />for (my $aa=0; $aa&lt;=(length($string)-$kmer); $aa++) {<br />&nbsp;&nbsp;&nbsp; my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp;&nbsp; if ($myWin eq $myStr) {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; #print "$myWin eq $myStr\n";<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; print $aa;<br />&nbsp;&nbsp;&nbsp; }<br />}<br />}</p>]]></description>
	<dc:creator>Jit</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/news/view/22769/ensembl-27</guid>
	<pubDate>Tue, 16 Jun 2015 16:10:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22769/ensembl-27</link>
	<title><![CDATA[Ensembl 27]]></title>
	<description><![CDATA[<h3>What is new?</h3><ul>
<li>Expansion of Protists and Fungi with hundreds of annotated genomes</li>
<li>Variation data for bread wheat, rice, <em>Aedes aegypti</em>, and <em>Ixodes scapularis</em></li>
<li>Whole genome alignments for <em>O. longistaminata</em> and <em>T. cacao</em></li>
<li>Non-coding RNA gene models in <a href="http://bacteria.ensembl.org">Bacteria</a></li>
<li>New assembly of tomato (version 2.50)</li>
<li>Full support for UCSC Track Hub format for hosting your own data in Ensembl</li>
</ul><p>More at http://www.ensembl.info/blog/2015/06/16/ensembl-genomes-release-27-is-out/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/opportunity/view/22780/ra-bioinformatics-at-institution-centre-for-human-genetics-bangalore</guid>
  <pubDate>Wed, 17 Jun 2015 19:14:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Institution: Centre for Human Genetics,  Bangalore]]></title>
  <description><![CDATA[
<p>Institution: Centre for Human Genetics, <br />Bangalore <br />Discipline: Molecular Genetics of Human Disease Biology </p>

<p>Minimum qualification: MSc in any branch of life sciences</p>

<p>Applications are invited for the position of a Research Assistant in the Centre for Human Genetics, Bangalore. </p>

<p>The project involves identification of mutations in MPS (mucopolysaccharidosis) patients, and study of their predicted effects to understand how the mutations lead to disease. </p>

<p>Techniques used will be genomic DNA isolation, PCR, DNA sequencing and sequence analysis. Computational tools would also be used to analyse and interpret data. </p>

<p>Candidates may be assigned work in the ongoing project or in new ones. </p>

<p>The candidate who is selected and joins would acquire hands-on experience in research and the capability to conduct insightful research. </p>

<p>Candidates applying for the position should have an MSc in any branch of life sciences. Those with research experience in cell and molecular biology, and high NET/ GATE score would be preferred. </p>

<p>The successful applicant is expected to stay for at least one and a half years. </p>

<p>Please apply with CV to Sudha Srinivasan (sudha@ibab.ac.in), stating where you saw this ad.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</guid>
	<pubDate>Fri, 24 Jun 2016 18:08:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</link>
	<title><![CDATA[Convert EnsEMBL GTF to Annotation table (Geneid, GeneSymbol, GeneWiseChrLocation, GeneClass, Strand) Raw]]></title>
	<description><![CDATA[<p><strong>Bash Script source:</strong></p><p>https://gist.github.com/santhilalsubhash/367befcf5216be4b1fd9</p><p>&nbsp;</p><p><strong>Information</strong>:</p><p>This script converts EnsEMBL GTF (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF">https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF</a>) file to annotation table format. It generated two files<br />1) Transcript wise chromosome location with information about transcripts (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt</a>)<br />2) Gene wise chromosome location with information about genes (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt</a>)</p><p>Note: You can download GTF files from&nbsp;<a href="http://www.ensembl.org/info/data/ftp/index.html">http://www.ensembl.org/info/data/ftp/index.html</a></p>]]></description>
	<dc:creator>EagleEye</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</guid>
	<pubDate>Thu, 04 Oct 2018 05:23:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</link>
	<title><![CDATA[nQuire: a statistical framework for ploidy estimation using next generation sequencing]]></title>
	<description><![CDATA[<p>nQuire provides a statistical framework to study organisms with intraspecific variation in ploidy. nQuire is likely to be useful in epidemiological studies of pathogens, artificial selection experiments, and for historical or ancient samples where intact nuclei are not preserved. It is implemented as a stand-alone Linux command line tool in the C programming language and is available at https://github.com/clwgg/nQuireunder the MIT license.</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuireunder" rel="nofollow">https://github.com/clwgg/nQuireunder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>