<?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/26309?offset=320</link>
	<atom:link href="https://bioinformaticsonline.com/related/26309?offset=320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</guid>
	<pubDate>Fri, 30 Sep 2016 10:22:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</link>
	<title><![CDATA[Murasaki]]></title>
	<description><![CDATA[<p>Murasaki is an anchor alignment program that is</p>
<ul style="margin-left: 16px;">
<li>exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))</li>
<li>scalable (Arbitrarily parallelizable across multiple nodes using MPI)</li>
<li>memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)</li>
<li>unlimited by pattern length or selection</li>
<li>repeat tolerant</li>
</ul>
<p><img src="http://murasaki.dna.bio.keio.ac.jp/9mammals-small.png" width="500" height="375" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki" rel="nofollow">http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</guid>
	<pubDate>Tue, 04 Oct 2016 14:50:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</link>
	<title><![CDATA[MIRO : miRNA omics]]></title>
	<description><![CDATA[<p><span>The MIRO (the miRNA omics) pipeline is a flexible and powerful tool for the analysis of miRNA (or more generall short RNA) expression using short-read deep sequencing data. In its present implementation MIRO is especially adapted for the analysis of reads generated with the Illumina sequencing platform. MIRO allows to preprocess the Solexa-reads, map them flexibly to several reference genomes using one of four different mappers, create differential gene (miRNA) expression profiles and cluster reads using one of several algorithm. MIRO output is furthermore compatible with software such as genome browsers and miRDeep.</span></p><p>Address of the bookmark: <a href="http://seq.crg.es/download/software/Miro/" rel="nofollow">http://seq.crg.es/download/software/Miro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</guid>
	<pubDate>Thu, 14 May 2020 15:09:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</link>
	<title><![CDATA[LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly]]></title>
	<description><![CDATA[<p>LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.</p><p>Address of the bookmark: <a href="https://github.com/CAFS-bioinformatics/LR_Gapcloser" rel="nofollow">https://github.com/CAFS-bioinformatics/LR_Gapcloser</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</guid>
	<pubDate>Sat, 19 Jan 2019 17:29:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38735/genome-assembly-tutorial-genome-assembly-for-short-and-long-reads</link>
	<title><![CDATA[Genome assembly tutorial &quot;Genome Assembly for short and long reads&quot;]]></title>
	<description><![CDATA[<p>In this lab we will perform de novo genome assembly of a bacterial genome. You will be guided through the genome assembly starting with data quality control, through to building contigs and analysis of the results. At the end of the lab you will know:</p>
<ol>
<li>How to perform basic quality checks on the input data</li>
<li>How to run a short read assembler on Illumina data</li>
<li>How to run a long read assembler on Pacific Biosciences or Oxford Nanopore data</li>
<li>How to improve the accuracy of a long read assembly using short reads</li>
<li>How to assess the quality of an assembly</li>
</ol>
<p>https://bioinformaticsdotca.github.io/high-throughput_biology_2017</p><p>Address of the bookmark: <a href="https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab" rel="nofollow">https://bioinformaticsdotca.github.io/high-throughput_biology_2017_module6_lab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</guid>
	<pubDate>Sat, 26 Jan 2019 18:02:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</link>
	<title><![CDATA[Genome assembly forensics: finding the elusive mis-assembly]]></title>
	<description><![CDATA[<p><span>We present the first collection of tools aimed at automated genome assembly validation. This work formalizes several mechanisms for detecting mis-assemblies, and describes their implementation in our automated validation pipeline, called&nbsp;</span><em>amosvalidate</em><span>. We demonstrate the application of our pipeline in both bacterial and eukaryotic genome assemblies, and highlight several assembly errors in both draft and finished genomes. The software described is compatible with common assembly formats and is released, open-source, at&nbsp;</span><a href="http://amos.sourceforge.net/" target="_blank">http://amos.sourceforge.net</a><span>.</span></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2397507/&nbsp;</p>
<p>http://amos.sourceforge.net/wiki/index.php/AMOS</p><p>Address of the bookmark: <a href="http://amos.sourceforge.net/wiki/index.php/AMOS" rel="nofollow">http://amos.sourceforge.net/wiki/index.php/AMOS</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</guid>
	<pubDate>Thu, 03 Nov 2016 04:55:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</link>
	<title><![CDATA[Statistics Using R   with Biological Examples]]></title>
	<description><![CDATA[<p>This book is a manifestation of my desire to teach researchers in biology a bit more about statistics than an ordinary introductory course covers and to introduce the utilization of R as a tool for analyzing their data. My goal is to reach those with little or no training in higher level statistics so that they can do more of their own data analysis, communicate more with statisticians, and appreciate the great potential statistics has to offer as a tool to answer biological questions. </p><p>This is necessary in light of the increasing use of higher level statistics in biomedical research. I hope it accomplishes this mission and encourage its free distribution and use as a course text or supplement.</p><p>K Seefeld, May 2007</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29601" length="4581031" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Tue, 02 Apr 2019 21:54:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for single molecule sequencing reads, such as those produced by PacBio and Oxford Nanopore Technologies. It is designed for a wide range of datasets, from small bacterial projects to large mammalian-scale assemblies. The package represents a complete pipeline: it takes raw PB / ONT reads as input and outputs polished contigs. Flye also includes a special mode for metagenome assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29998/csir-nehru-science-postdoctoral-research-fellowship</guid>
  <pubDate>Tue, 29 Nov 2016 12:34:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[CSIR Nehru Science Postdoctoral Research Fellowship]]></title>
  <description><![CDATA[
<p>CSIR Nehru Science Postdoctoral Research Fellowship</p>

<p>About Fellowship: <br />CSIR Nehru Science Postdoctoral Research Fellowship Scheme is an Research Fellowship awarded/given by HRD Ministry, Govt. of India every year to more than 100 fellows.</p>

<p>It was started to identify promising and young researchers with novel ideas and provide them research opportunities in the areas of basic science, engineering, medicine &amp; agriculture.</p>

<p>The fellowship aims at facilitating their transition from mentored to independent research career.</p>

<p>In addition, check these ICTS Research Fellowships:<br />1.) Max-Planck Partner Group Fellowships 2017-18<br />2.) ICTS-Simons Postdoctoral Fellowships 2017<br />3.) ICTS Post Doctoral Fellowships 2017<br />4.) Airbus Prize Postdoctoral Fellowship 2017-18</p>

<p>Eligibility: To be eligible for this fellowship, you:<br />1.) PhD degree (within 3 years of award of PhD degree), OR<br />2.) Those who have submitted PhD theses.<br />3.) Applicants should have research publications in good impact factor SCI journals.<br />4.) Indian nationals, Persons of Indian Origin (PIO) &amp; Overseas Citizen of India (OCI), a can also apply.<br />5.) Maximum Age Limit: 32 years.</p>

<p>Duration: <br />– 2 Years.<br />– extendable for a maximum of 1 more year based on performance.</p>

<p>Remuneration: <br />– Rs. 50,000/- per month plus House Rent Allowance (HRA)<br />– A contingency grant of Rs. 3.0 lakh per annum.<br />– 25% of the contingency grant can be used for domestic and international travel.</p>

<p>Mode of Selection: You can apply throughout the year, but selection will be made twice a year, in June and December.</p>

<p>How to Apply: <br />– Read the instructions, given at Annexure-I in this PDF file.<br />– And, application form is given as, Annexure-II.<br />– Fill the form &amp; send it to the given address in the PDF file.</p>

<p>Deadline: Rolling Deadline (Applications accepted throughout the year)</p>

<p>Also See: Research Internship/ Fellowship in India:<br />1.) IIT Bombay Research Internship Awards Programme 2016-17<br />2.) IIT Delhi Internship Program 2016-17<br />3.) DAAD WISE – International Internship in Germany<br />4.) Summer Research Fellowship Programme| JNCASR Bangalore<br />5.) Indian Academy of Sciences Summer Internships 2017<br />6.) Winter Internship – IIT Bombay NPDE-TCA<br />7.) Viterbi – India Program 2017 | Research Internship in US<br />8.) Internship – Centre for Stem Cell Research, Vellore</p>

<p>Accommodation &amp; other benefits: <br />– Accommodation may be provided by CSIR, if available.<br />– Medical benefits as per CSIR norms.</p>

<p>For more details: <br />– Check this PDF Notification of Fellowship.<br />– List of CSIR Labs &amp; their work/activities can be seen at www.csir.res.in.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>