<?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/31302?offset=1000</link>
	<atom:link href="https://bioinformaticsonline.com/related/31302?offset=1000" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</guid>
	<pubDate>Sat, 31 May 2014 14:31:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11311/stephen-friend-the-hunt-for-unexpected-genetic-heroes</link>
	<title><![CDATA[Stephen Friend: The hunt for "unexpected genetic heroes"]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/Yagdvqn2YMU" frameborder="0" allowfullscreen></iframe>What can we learn from people with the genetics to get sick — who don't? With most inherited diseases, only some family members will develop the disease, while others who carry the same genetic risks dodge it. Stephen Friend suggests we start studying those family members who stay healthy. Hear about the Resilience Project, a massive effort to collect genetic materials that may help decode inherited disorders.

TEDTalks is a daily video podcast of the best talks and performances from the TED Conference, where the world's leading thinkers and doers give the talk of their lives in 18 minutes (or less). Look for talks on Technology, Entertainment and Design -- plus science, business, global issues, the arts and much more.
Find closed captions and translated subtitles in many languages at http://www.ted.com/translate

Follow TED news on Twitter: http://www.twitter.com/tednews
Like TED on Facebook: https://www.facebook.com/TED

Subscribe to our channel: http://www.youtube.com/user/TEDtalksDirector]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12896/inspire-faculty-scheme-a-component-of-%E2%80%9Cassured-opportunity-for-research-career-aorc%E2%80%9D-under-inspire</guid>
  <pubDate>Sat, 19 Jul 2014 14:59:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.]]></title>
  <description><![CDATA[
<p>Ministry of Science and Technology, Department of Science and Technology</p>

<p>7th ADVERTISEMENT – 2014 (2)</p>

<p>INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.</p>

<p>The Department of Science and Technology, Government of India, has launched the “Innovation in Science Pursuit for Inspired Research (INSPIRE)” [http://www.inspire-dst.gov.in] program in 2008.</p>

<p>The program aims to attract talent for study of science and careers with research. INSPIRE includes many components. The importance of Assured Career Opportunity in R&amp;D sector has been recognized.</p>

<p>INSPIRE Faculty Scheme opens up an “Assured Opportunity for Research Career (AORC)” for young researchers in the age group of 27-32 years. It offers a contractual research awards to young achievers and opportunity for independent research in the near term and emerge as a future leader in the long term.</p>

<p>Eligibility</p>

<p>Essential Indian citizens and people of Indian origin including NRI/PIO status with PhD (in science, mathematics, engineering, pharmacy, medicine, and agriculture related subjects) from any recognized university in the world,</p>

<p>Those who have submitted their PhD Theses and are awaiting award of the degree are also<br />eligible. However, the award will be conveyed only after confirmation of the awarding the<br />PhD degree.</p>

<p>The upper age limit as on 1st July 2014 should be 32 years for considering support for a<br />period of 5 years. However, for SC and ST candidates, upper age limit will be 35 years.</p>

<p>Publication(s) in highly reputed Journals demonstrating research potential of the candidate.</p>

<p>Desirable</p>

<p>Candidates who are within top 1% at the School Leaving Examination, IIT-JEE rank, 1st Rank Holder either in graduation or post-graduation level university examination (which are used presently for identifying INSPIRE Scholars at under-graduate level and INSPIRE Fellows for doctoral degree)</p>

<p>More at http://www.inspire-dst.gov.in/faculty_scheme.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Tue, 27 Nov 2018 03:38:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;sequencing reads. It does this with a deep&nbsp;<a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a>&nbsp;classifier, using many of the&nbsp;<a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a>&nbsp;that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p>
<ul>
<li><span>Reasons to use Deepbinner</span>:
<ul>
<li>To minimise the number of unclassified reads (use Deepbinner by itself).</li>
<li>To minimise the number of misclassified reads (use Deepbinner in conjunction with Albacore demultiplexing).</li>
<li>You plan on running signal-level downstream analyses, like&nbsp;<a href="https://github.com/jts/nanopolish">Nanopolish</a>. Deepbinner can&nbsp;<a href="https://github.com/rrwick/Deepbinner#using-deepbinner-before-basecalling">demultiplex the fast5 files</a>which makes this easier.</li>
</ul>
</li>
<li><span>Reasons to&nbsp;<em>not</em>&nbsp;use Deepbinner</span>:
<ul>
<li>You only have basecalled reads not the raw fast5 files (which Deepbinner requires).</li>
<li>You have a small/slow computer. Deepbinner is more computationally intensive than&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>.</li>
<li>You used a sequencing/barcoding kit other than&nbsp;<a href="https://github.com/rrwick/Deepbinner/blob/master/models">the ones Deepbinner was trained on</a>.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11494/postdoc-position-at-centre-mediterraneen-de-medecine-moleculaire-nice-france</guid>
  <pubDate>Wed, 04 Jun 2014 07:20:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position at Centre Méditerranéen de Médecine Moléculaire - Nice - France]]></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.</p>

<p>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>

<p>Homepage: http://www.unice.fr/c3m/EN/Equipe10.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40889/rcorrector-efficient-and-accurate-error-correction-for-illumina-rna-seq-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:23:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40889/rcorrector-efficient-and-accurate-error-correction-for-illumina-rna-seq-reads</link>
	<title><![CDATA[Rcorrector: efficient and accurate error correction for Illumina RNA-seq reads]]></title>
	<description><![CDATA[<p><span>Rcorrector has an accuracy higher than or comparable to existing methods, including the only other method (SEECER) designed for RNA-seq reads, and is more time and memory efficient. With a 5 GB memory footprint for 100 million reads, it can be run on virtually any desktop or server. The software is available free of charge under the GNU General Public License from&nbsp;</span><a href="https://github.com/mourisl/Rcorrector/" target="_blank">https://github.com/mourisl/Rcorrector/</a><span>.</span></p>
<pre><code>Usage: perl run_rcorrector.pl [OPTIONS]
OPTIONS:
	Required
	-s seq_files: comma separated files for single-end data sets
	-1 seq_files_left: comma separated files for the first mate in the paried-end data sets
	-2 seq_files_right: comma separated files for the second mate in the paired-end data sets
	-i seq_files_interleaved: comma sperated files for interleaved paired-end data sets
	Optional
	-k INT: kmer_length (&lt;=32, default: 23)
	-od STRING: output_file_directory (default: ./)
	-t INT: number of threads to use (default: 1)
	-trim : allow trimming (default: false)
	-maxcorK INT: the maximum number of correction within k-bp window (default: 4)
	-wk FLOAT: the proportion of kmers that are used to estimate weak kmer count threshold, lower for more divergent genome (default: 0.95)
	-ek INT: expected number of kmers; does not affect the correctness of program but affects the memory usage (default: 100000000)
	-stdout: output the corrected reads to stdout (default: not used)
	-verbose: output some correction information to stdout (default: not used)
	-stage INT: start from which stage (default: 0)
		0-start from begining(storing kmers in bloom filter) ;
		1-start from count kmers showed up in bloom filter;
		2-start from dumping kmer counts into a jf_dump file;
		3-start from error correction.</code></pre><p>Address of the bookmark: <a href="https://github.com/mourisl/Rcorrector/" rel="nofollow">https://github.com/mourisl/Rcorrector/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11611/ten-recommendations-for-creating-usable-bioinformatics-command-line-software</guid>
	<pubDate>Sun, 08 Jun 2014 10:06:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11611/ten-recommendations-for-creating-usable-bioinformatics-command-line-software</link>
	<title><![CDATA[Ten recommendations for creating usable bioinformatics command line software]]></title>
	<description><![CDATA[<p><span>Bioinformatics software varies greatly in quality. In terms of usability, the command line interface is the first experience a user will have of a tool. Unfortunately, this is often also the last time a tool will be used. Here I present ten recommendations for command line software author&rsquo;s tools to follow, which I believe would greatly improve the uptake and usability of their products, waste less user&rsquo;s time, and improve the quality of scientific analyses.</span></p><p>Address of the bookmark: <a href="http://www.gigasciencejournal.com/content/2/1/15?utm_content=buffer25ee0&amp;utm_medium=social&amp;utm_source=twitter.com&amp;utm_campaign=buffer" rel="nofollow">http://www.gigasciencejournal.com/content/2/1/15?utm_content=buffer25ee0&amp;utm_medium=social&amp;utm_source=twitter.com&amp;utm_campaign=buffer</a></p>]]></description>
	<dc:creator>RAJESH DETROJA</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</guid>
	<pubDate>Tue, 24 Jun 2014 00:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/12206/bioinformatics-algorithms-tutorials</link>
	<title><![CDATA[Bioinformatics algorithms tutorials]]></title>
	<description><![CDATA[<p>Useful bioinformatics tutorial, such as</p>
<p>De Bruijn Graphs for NGS Assembly<br>Algorithms for PacBio Reads<br>Software and Hardware Concepts for Bioinformatics<br>Finding us in Homolog.us (Search Algorithms)<br>NGS Genome and RNAseq Assembly - a Hands on Primer<br>Introduction to PERL, Python, R and C/C++ for Bioinformatics</p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/" rel="nofollow">http://www.homolog.us/Tutorials/</a></p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>