<?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/40228?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/40228?offset=380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/10739/science-for-life-laboratory-scilifelab-sweden</guid>
  <pubDate>Sat, 10 May 2014 06:22:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Science for Life Laboratory (SciLifeLab)-Sweden]]></title>
  <description><![CDATA[
<p>Science for Life Laboratory (SciLifeLab) is a national center for molecular biosciences with focus on health and environmental research. The center combines frontline technical expertise with advanced knowledge of translational medicine and molecular bioscience. SciLifeLab is a national resource and a collaboration between four universities: Karolinska Institutet, KTH Royal Institute of Technology, Stockholm University and Uppsala University.</p>

<p>Webpage : https://www.scilifelab.se/about-us/<br />Opportunity: https://www.scilifelab.se/about-us/career/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</guid>
	<pubDate>Tue, 07 Jul 2015 16:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</link>
	<title><![CDATA[Scaffolding of a bacterial genome using MinION nanopore sequencing]]></title>
	<description><![CDATA[<p><span>Second generation sequencing has revolutionized genomic studies. However, most genomes contain repeated DNA elements that are longer than the read lengths achievable with typical sequencers, so the genomic order of several generated contigs cannot be easily resolved. A new generation of sequencers offering substantially longer reads is emerging, notably the Pacific Biosciences (PacBio) RS II system and the MinION system, released in early 2014 by Oxford Nanopore Technologies through an early access program.</span></p><p>Address of the bookmark: <a href="http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html" rel="nofollow">http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<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/11000/professorassociate-professor-assistant-professor-at-chettinad-academy-of-research-and-education</guid>
  <pubDate>Sat, 24 May 2014 00:00:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Professor/Associate Professor/ Assistant Professor at Chettinad Academy of Research and Education]]></title>
  <description><![CDATA[
<p>OPEN FACULTY POSITION</p>

<p>Chettinad Academy of Research and Education (CARE) invites applications from eligible and translational research-oriented candidates to the posts of Professor/Associate Professor/ Assistant Professor  Computational Biology, Bioinformatics, and Pharmaceutical Chemistry.</p>

<p>Emoluments: As per UGC norms (Adequate Compensation for Postdoctoral/Teaching experience)</p>

<p>Candidates fulfilling the eligibility criteria as per the UGC norms can send their full CV with copies of certificates and reference letters to the following address by post or by e-mail on or before 31st May 2014</p>

<p>The Registrar,<br />Chettinad Academy of Research and Education,<br />Chettinad Health City<br />Kelambakkam, Chennai 603 103<br />Tamil Nadu<br />T +91 (0)44 4741 1000<br />F +91 (0)44 4741 1011<br />Email: jobs @chettinadhealthcity.com</p>

<p>Advertisement: http://182.73.176.163/chc/ads2014.pdf</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/researchlabs/view/11107/the-minerva-research-group-for-bioinformatics</guid>
  <pubDate>Tue, 27 May 2014 15:48:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Minerva Research Group for Bioinformatics]]></title>
  <description><![CDATA[
<p>The focus of the bioinformatics group is to use computational approaches to gain an insight into genome evolution in primates.</p>

<p>http://www.eva.mpg.de/genetics/bioinformatics/overview.html?Fsize=0%2C%20%40%2F%27</p>

<p>Kelso Group<br />Department of Evolutionary Genetics<br />Max Planck Institute for Evolutionary Anthropology<br />Deutscher Platz 6<br />04103 Leipzig<br />Germany<br />Phone: +49 341 3550 500</p>

<p>Job: <br />http://www.eva.mpg.de/genetics/bioinformatics/jobs.html?Fsize=0%2C%2B%40</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</guid>
	<pubDate>Wed, 14 Feb 2018 02:49:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</link>
	<title><![CDATA[MeDuSa: a multi-draft based scaffolder]]></title>
	<description><![CDATA[<p><span>MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/combogenomics/medusa" rel="nofollow">https://github.com/combogenomics/medusa</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</guid>
	<pubDate>Fri, 06 Jun 2014 16:18:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</link>
	<title><![CDATA[Monitor running jobs on Linux server]]></title>
	<description><![CDATA[<p>You as a bioinformatican run lots of program on your servers. Sometime the shared server is also used by your colleague. If server is busy you sometime need to check the running programs and want to monitor the running programs as well. The "top" command will come in handy when you need to find out if things are still running, how long they&rsquo;ve been running, or how much memory is being used.<br /><br />&lsquo;top&rsquo; is very simple to run: type<br /><br />%% top<br /><br />You&rsquo;ll get a screen that looks like this, and is updated regularly:<br /><br /><img src="http://bioinformaticsonline.com/mod/photo/top.png" width="659" height="582" alt="image" style="border: 0px;"><br />Simple, right? Heh.<br /><br />First! Note that you can use &lsquo;q&rsquo; or &lsquo;CTRL-C&rsquo; to exit from &lsquo;top&rsquo;.<br /><br />Now let&rsquo;s read and understand at each line independently.<br /><br />The first line:<br /><br />top - 23:00:48 up 39 days,&nbsp; 2 user,&nbsp; load average: 0.00, 0.00, 0.00<br /><br />The first line tells you the current time, how long the machine has been up, how many users are logged in, and the short/medium/long-term compute load on the machine. If you run something for a long time, you&rsquo;ll see these numbers go up. Right now, the machine is basically just sitting there, so these are all close to 0.<br /><br />The second line:</p><p>Tasks:&nbsp; 239 total,&nbsp;&nbsp; 1 running,&nbsp; 238 sleeping,&nbsp;&nbsp; 0 stopped,&nbsp;&nbsp; 0 zombie<br /><br />This line tells you how many processes are running. If you are using laptops machines it&rsquo;s not so interesting because you really are the only one using this machine.<br /><br />Cpu(s):&nbsp; 0.0%us,&nbsp; 0.0%sy,&nbsp; 0.0%ni,100.0%id,&nbsp; 0.0%wa,&nbsp; 0.0%hi,&nbsp; 0.0%si,&nbsp; 0.0%st<br /><br />This line contains the CPU load. The first two numbers are how busy the system is doing computation (&ldquo;us&rdquo; stands for &ldquo;user&rdquo;) and how busy the system is doing system-y things like accessing disks or network (&ldquo;sy&rdquo; stands for &ldquo;system&rdquo;). We&rsquo;ll talk more about this later.<br /><br />Mem:&nbsp;&nbsp; 49457320k total,&nbsp;&nbsp;&nbsp; 3492174k used,&nbsp; 14535596k free,&nbsp;&nbsp;&nbsp; 1435148k buffers<br /><br />This should be easy to understand &ndash; how much memory you&rsquo;re using! <br /><br />Swap:&nbsp;&nbsp; 539356k total,&nbsp;&nbsp; 28332k used,&nbsp;&nbsp; 836562k free,&nbsp;&nbsp;&nbsp; 29862014k cached<br /><br />Swap is just on-disk memory that can be used to &ldquo;swap&rdquo; out programs from main memory. Again, we&rsquo;ll talk about this later.:<br /><br />PID USER&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PR&nbsp; NI&nbsp; VIRT&nbsp; RES&nbsp; SHR S %CPU %MEM&nbsp;&nbsp;&nbsp; TIME+&nbsp; COMMAND<br />&nbsp; 1 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 39 &nbsp; 19&nbsp; 0&nbsp; 0&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 246:57.22 kipmi0<br />&nbsp; 2 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; RT&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 0:00.00 migration/0<br /><br />And... finally! What&rsquo;s actually running! The two most important numbers are the %CPU and %MEM towards the right, as well as the COMMAND. This tells you how compute- and memory-intensive your program is. Right now, nothing&rsquo;s running so the numbers aren&rsquo;t very interesting, but just wait until we run something...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</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/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>

</channel>
</rss>