<?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/27261?offset=1380</link>
	<atom:link href="https://bioinformaticsonline.com/related/27261?offset=1380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</guid>
	<pubDate>Wed, 24 Oct 2018 23:35:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</link>
	<title><![CDATA[BAUM – Improving Genome Assembly by Adaptive Unique Mapping and Local Overlap-Layout-Consensus]]></title>
	<description><![CDATA[<p><span>BAUM, breaks the whole genome into regions by adaptive unique mapping; then the local OLC is used to assemble each region in parallel. BAUM can: (1) perform reference-assisted assembly based on the genome of a close species; (2) or improve the results of existing assemblies that are obtained based on short or long sequencing reads.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/" rel="nofollow">http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11735/search-shell-command-history</guid>
	<pubDate>Thu, 12 Jun 2014 17:43:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11735/search-shell-command-history</link>
	<title><![CDATA[Search Shell Command History]]></title>
	<description><![CDATA[<p>We use couple of hundreads of command in daily basis. Most of them are actually repeated several time. The question remain open how do I search old command history under bash shell and modify or reuse it? <br /><br />Now a days almost all modern shell allows you to search command history if enabled by user. Use history command to display the history list with line numbers. Lines listed with with a * have been modified by user.</p><p><br /><strong>Shell history search command</strong><br /><br />Type history at a shell prompt:<br />$ history</p><p>It will display the list of all used commandline history with an serial number.<br /><br />To search particular command, enter:<br />$ history | grep command-name<br />$ history | egrep -i 'scp|ssh|ftp'<br />Emacs Line-Edit Mode Command History Searching<br /><br />To get previous command containing string, hit [CTRL]+[r] followed by search string:<br /><br />(reverse-i-search): <br /><br />To get previous command, hit [CTRL]+[p]. You can also use up arrow key.<br /><br />CTRL-p<br /><br />To get next command, hit [CTRL]+[n]. You can also use down arrow key.<br /><br />CTRL-n<br /><br /></p><p><strong>fc command</strong></p><p>Apart from hostory command there are fc command to extract the command from history. The fc stands for either "find command" or "fix command.</p><p>For example list last 10 command, enter:<br />$ fc -l 10<br />To list commands 130 through 150, enter:<br />$ fc -l 130 150<br />To list all commands since the last command beginning with ssh, enter:<br />$ fc -l ssh<br />You can edit commands 1 through 5 using vi text editor, enter:<br />$ fc -e vi 1 5</p><p><strong>Delete command history</strong><br /><br />The -c option causes the history list to be cleared by deleting all of the entries:<br />$ history -c</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/3918/the-human-genome-project-video-3d-animation-introduction-low</guid>
	<pubDate>Sat, 24 Aug 2013 19:01:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/3918/the-human-genome-project-video-3d-animation-introduction-low</link>
	<title><![CDATA[The Human Genome Project Video   3D Animation Introduction Low)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/YxoQFSBwyms" frameborder="0" allowfullscreen></iframe>]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</guid>
	<pubDate>Sun, 08 Jun 2014 09:56:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</link>
	<title><![CDATA[Bioinformatician’s Pocket Reference !!]]></title>
	<description><![CDATA[<p><span>It is amusing how brain of bioinformaticians work! Learning a new programming language for days feels so much of fun that making 5 minute discussion with neighbours (unless under special circumstances!) in our own mother-tongue. Today every bioinformatician keeps more than few languages and core IT toolkits on their plate. It has become mandatory to be able to mould different code snippets to build our own custom workflows, and thus keeping syntax at our fingertips has become essential.Although Google is best way to get syntax problem solved, it is not a bad idea to keep reference sheets is our smartphones or stick out some printed sheets on the back of your door, in the old fashion way!!</span></p><p>Address of the bookmark: <a href="http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/" rel="nofollow">http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/</a></p>]]></description>
	<dc:creator>RAJESH DETROJA</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/21150/webinar-on-an-integrated-rna-and-dna-approach-to-unravel-genetic-regulation-in-cancer</guid>
	<pubDate>Wed, 11 Feb 2015 04:59:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/21150/webinar-on-an-integrated-rna-and-dna-approach-to-unravel-genetic-regulation-in-cancer</link>
	<title><![CDATA[Webinar on 'An integrated RNA and DNA approach to unravel genetic regulation in cancer']]></title>
	<description><![CDATA[<div><p><strong>Webinar on 'An integrated RNA and DNA approach to unravel genetic regulation in cancer'</strong></p><p><strong>Abstract</strong></p><p>Whole exome DNA sequencing (WES) or whole genome DNA sequencing (WGS) allows detection of mutations and polymorphisms in all exonic and genomic regions, respectively, while messenger RNA sequencing (RNA-Seq) enables quantitative analysis of gene expression. Mutations in the genome result in diverse transcriptional aberrations that can be missed in a stand-alone WES/WGS analysis. An integration of DNA variant analysis and RNA-Seq analysis enables one to investigate the consequences of genomic changes in the RNA transcripts including germline and somatic changes, imprinting, RNA editing and allele specific expression (ASE). In this webinar, we will demonstrate this integrated approach using Strand NGS to identify high confidence mutations, RNA editing events and ASE in cancer.</p><p><strong>Webinar Details</strong></p><table width="100%" border="1" cellspacing="0" cellpadding="0">
<tbody>
<tr>
<td valign="top">
<p style="text-align: center;"><br /> <strong>Sessions</strong></p>
</td>
<td valign="top">
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>San Francisco Time<br /> (PST)</strong></a></p>
</td>
<td valign="top">
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>Tokyo Time<br /> (GMT+09:00)</strong></a></p>
</td>
<td valign="top">
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>Berlin Time<br /> (GMT+01:00)</strong></a></p>
</td>
<td valign="top">
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>Mumbai Time<br /> (GMT+05:30)</strong></a></p>
</td>
</tr>
<tr>
<td>
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>Session 1</strong></a></p>
</td>
<td valign="top">
<p style="text-align: center;">25 Feb&nbsp;<br /> 12:30 AM</p>
</td>
<td>
<p style="text-align: center;">25 Feb&nbsp;<br /> 5:30 PM</p>
</td>
<td>
<p style="text-align: center;">25 Feb&nbsp;<br /> 9:30 AM</p>
</td>
<td>
<p style="text-align: center;">25 Feb&nbsp;<br /> 2:00 PM</p>
</td>
</tr>
<tr>
<td valign="top">
<p style="text-align: center;"><a href="http://www.strand-ngs.com/webinar_registration"><strong>Session 2</strong></a></p>
</td>
<td valign="top">
<p style="text-align: center;">25 Feb&nbsp;<br /> 9:00 AM</p>
</td>
<td>
<p style="text-align: center;">26 Feb<br /> 2:00 AM</p>
</td>
<td>
<p style="text-align: center;">25 Feb&nbsp;<br /> 6:00 PM</p>
</td>
<td>
<p style="text-align: center;">25 Feb&nbsp;<br /> 10:30 PM</p>
</td>
</tr>
</tbody>
</table><p><strong style="font-size: 12.8000001907349px;">Register here: </strong><a href="http://www.strand-ngs.com/webinar_registration">http://www.strand-ngs.com/webinar_registration</a></p><p><strong>About Speaker:</strong></p><p>Dr. Veena Hedatale, has a PhD in Plant Genetics from The Radboud University, Netherlands focused on meiosis and recombination. Her prior academic experience at Cornell University was on genetic mapping and gene transformation in Rice. She has worked with Monsanto, and contributed to data mining, database development as well as gene/promoter/pathway discovery for traits related to yield and stress in crop species. At Strand, Veena has worked on Pharmacogenomic analysis of targets and Gene family analysis projects. Currently, she is part of the Strand NGS Application Science team and is involved in the analysis of next generation sequencing data.</p><p>Please feel free to contact us 24/5, for availing free online training or if you have any questions.</p></div><div><p><strong style="font-size: 12.8000001907349px;">Email:</strong> sales@strandngs.com</p><p><strong>Phone (USA):</strong> 1-800-752-9122</p><p><strong>Phone (ROW):</strong> +1-650-353-5060</p><p>&nbsp;</p></div>]]></description>
	<dc:creator>Yeshodari</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12218/assistant-professor-in-medical-bioinformatics</guid>
  <pubDate>Tue, 24 Jun 2014 01:46:36 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor in Medical Bioinformatics]]></title>
  <description><![CDATA[
<p>Advt. No : ME-I/A-IV/03/14<br />No.of Posts:01 (SC)<br />Pay Scale:<br />Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.<br />Qualifications:<br />Area of Specialization:-<br />Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology<br />1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.<br />2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/<br />Immunology/Structural Biology etc<br />Experience:<br />1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical<br />Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.<br />2. Minimum two publication with atleast one in international journal and atleast one as first author<br />Desirable:-<br />Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)<br />Send your applications to O/O, Deputy Registrar, Recruitment &amp; Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014<br />For more details,please visit website: http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf<br />Last Apply Date: 08 Jul 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12582/postdoc-position-at-centre-mediterraneen-de-medecine-moleculaire</guid>
  <pubDate>Sun, 06 Jul 2014 11:23:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position at Centre Méditerranéen de Médecine Moléculaire]]></title>
  <description><![CDATA[
<p>The research group of Dr. Michele Trabucchi at the Centre Méditerranéen de Médecine Moléculaire (C3M) at INSERM U1065 (University of Nice Sophia-Antipolis, France) is seeking candidates for a Postdoctoral fellow position to start on October 2014 for 3 years funded by FRM (Fondation pour la Recherche Médicale).<br />The broad interest of the lab is in understanding the expression control and function of small RNAs in activated myeloid cells (visit our webpage to check research interests and publications of the group : http://www.unice.fr/c3m/EN/Equipe10.html ). </p>

<p>The work will focus on the functional studies of small RNAs by using next-generation sequencing approaches.<br /> <br />Candidates should hold a Ph.D. degree and have strong background in bioinformatics.<br />The University of Nice Sophia-Antipolis provides a wide range of facilities and training essential for biomedical research.<br />Interested applicants should send a PDF with a cover letter stating research interests and qualifications, an updated CV, a summary of previous research experience and contact information for two references to Michele Trabucchi ( mtrabucchi@unice.fr )</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12870/nuclear-dynamics-lab</guid>
  <pubDate>Thu, 17 Jul 2014 15:03:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Nuclear Dynamics Lab]]></title>
  <description><![CDATA[
<p>Lab focus is to elucidate fundamental principles, new mechanisms, machineries and emergent properties that are involved in maintaining the genome and gene expression programmes for improvements in lifelong health and well-being for all.</p>

<p>More at http://www.babraham.ac.uk/our-research/nuclear-dynamics/</p>
]]></description>
</item>

</channel>
</rss>