<?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/4197?offset=1130</link>
	<atom:link href="https://bioinformaticsonline.com/related/4197?offset=1130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</guid>
	<pubDate>Thu, 19 Apr 2018 08:06:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</link>
	<title><![CDATA[Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data]]></title>
	<description><![CDATA[<p><span>Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from&nbsp;</span><a href="https://github.com/meiji-bioinf/heap">https://github.com/meiji-bioinf/heap</a><span>&nbsp;and our web site (</span><a href="http://bioinf.mind.meiji.ac.jp/lab/en/tools.html">http://bioinf.mind.meiji.ac.jp/lab/en/tools.html</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/meiji-bioinf/heap" rel="nofollow">https://github.com/meiji-bioinf/heap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21538/senior-research-fellow-at-all-india-institute-of-medical-sciences-aiims-delhi-delhi-delhi</guid>
  <pubDate>Wed, 11 Mar 2015 03:06:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[SENIOR RESEARCH FELLOW at All India Institute of Medical Sciences (AIIMS Delhi) - Delhi, Delhi]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the following temporary post in an ICMR funded Research Project entitle “An Investigation to find out reasons for Phenotypic Heterogeneity/Variability in 22q11.2 Microdeletion Syndrome” in Department of Reproductive Biology, AIIMS, New Delhi PI: Dr. Ashutosh Halder, Professor, Department of Reproductive Biology </p>

<p>Name of the post: Senior Research Fellow (SRF) <br />Duration: 2 year <br />Salary: Rs. 28000/- per month + 30% HRA <br />Eligibility: MSc (life sciences) with 2 years research experience, NET/GATE qualified <br />Desirable: Experience in the field of Genomics, Epigenomics &amp; Bioinformatics <br />SELECTION PROCEDURE FOR ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI) – SENIOR RESEARCH FELLOW POST: </p>

<p>Candidates can apply on or before 15/03/2015 <br />No Detailed information about the selection process is mentioned in the recruitment notification <br />HOW TO APPLY FOR SENIOR RESEARCH FELLOW VACANCY IN ALL INDIA INSTITUTE OF MEDICAL SCIENCES (AIIMS DELHI): </p>

<p>Deadline: 15.03.15 Submit your C.V in Room No. 2099 (Molecular Cytogenetics Lab), 2nd floor, Reproductive Biology, All India Institute of Medical Sciences, New Delhi-110029 or Email CV to: ashutoshhalder@gmail.com Your CV should include the details of your work experience &amp; degrees along with two references with e-mail and contact number Only 10 shortlisted (on merit) candidates will be invited for interview. No TA/DA will be applicable for the same</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36806/manta-rapid-detection-of-structural-variants-and-indels-for-germline-and-cancer-sequencing-applications</guid>
	<pubDate>Mon, 28 May 2018 09:41:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36806/manta-rapid-detection-of-structural-variants-and-indels-for-germline-and-cancer-sequencing-applications</link>
	<title><![CDATA[Manta: rapid detection of structural variants and indels for germline and cancer sequencing applications.]]></title>
	<description><![CDATA[Manta calls structural variants (SVs) and indels from mapped paired-end sequencing reads. It is optimized for analysis of germline variation in small sets of individuals and somatic variation in tumor/normal sample pairs. Manta discovers, assembles and scores large-scale SVs, medium-sized indels and large insertions within a single efficient workflow.<p>Address of the bookmark: <a href="https://github.com/Illumina/manta" rel="nofollow">https://github.com/Illumina/manta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Fri, 07 Sep 2018 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[<p><span>P_RNA_scaffolder is a novel scaffolding tool using Pair-end RNA-seq to scaffold genome fragments. The method is suitable for most genomes. The program could utilize Illumina Paired-end RNA-sequencing reads from target speciesies. Our method provides another practical alternative to existing mate-pair_based approaches or other Protein-based approaches (for instance,&nbsp;</span><a href="http://www.fishbrowser.org/software/PEP_scaffolder/">PEP_scaffolder&nbsp;</a><span>) for scaffolding genome sequences. The most important feature of this method is to improve the completeness of gene regions and long-coding gene regions (for instance,&nbsp;</span><a href="http://circrna.org/">circRNA</a><span>).</span></p><p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/#" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/#</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</guid>
	<pubDate>Thu, 04 Oct 2018 16:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37835/variantbam-filtering-and-profiling-of-next-generational-sequencing-data-using-region-specific-rules</link>
	<title><![CDATA[VariantBam: Filtering and profiling of next-generational sequencing data using region-specific rules]]></title>
	<description><![CDATA[<p>VariantBam is a tool to extract/count specific sets of sequencing reads from next-generational sequencing files. To save money, disk space and I/O, one may not want to store an entire BAM on disk. In many cases, it would be more efficient to store only those read-pairs or reads who intersect some region around the variant locations. Alternatively, if your scientific question is focused on only one aspect of the data (e.g. breakpoints), many reads can be removed without losing the information relevant to the problem.</p>
<h5>&nbsp;</h5><p>Address of the bookmark: <a href="https://github.com/broadinstitute/VariantBam" rel="nofollow">https://github.com/broadinstitute/VariantBam</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21472/asst-professor-at-central-university-of-jharkhand-cuj</guid>
  <pubDate>Sun, 01 Mar 2015 01:17:52 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor at Central University of Jharkhand (CUJ)]]></title>
  <description><![CDATA[
<p>Central University of Jharkhand (CUJ) has issued a recruitment notification for the recruitment of Assistant Professor through recruitment notification – Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015. Candidates who have completed M.Sc, Ph.D can apply for the new recruitment notification from Central University of Jharkhand (CUJ)</p>

<p>Central University of Jharkhand has been granted funds by the Department of Biotechnology (DBT), Govt. of India to establish “DBT-Boost to CUJ Interdisciplinary Life Sciences Departments for Education and Research” Applications are invited for the Assistant Professor on purely temporary basis. The appointments shall be initially for a period of one year, renewable every year depending on the satisfactory performance, till the end of project.</p>

<p>Position: ASSISTANT PROFESSOR (Total 03)<br />Salary: 45,000/- (fixed) per month<br />Essential Qualifications: i. Good academic record with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the master’s degree level with specialization in Biodiversity and Systematic/ Systems Biology/ Biophysics/ Bioinformatics from an Indian  University, or an equivalent degree from an accredited foreign university. ii. Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET. iii. Notwithstanding anything contained in i. and ii. candidates, who are or have been awarded Ph.D Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulation, 2009, shall be exempted from therequirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor. iv. NET/SLET/SET shall also not be required for such disciplines for which NET/SLET/SET in not conducted.<br />Desirable: Preference will be given to candidates having Ph.D in any of the above mentioned areas with NET</p>

<p>IMPORTANT DATES TO REMEMBER  :</p>

<p>Last Date to Apply for this job 24/3/2015</p>

<p>REFERENCE:</p>

<p>Central University of Jharkhand (CUJ) Recruitment 2015 –  Advt. No.: CUJ/Advt./14-15/15 Date: 26th Feb. 2015.</p>

<p>More at http://cuj.ac.in/careers.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38535/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Tue, 25 Dec 2018 21:20:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38535/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at https://github.com/wdecoster/nanopack, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at http://nanoplot.bioinf.be and command line tools.<p>Address of the bookmark: <a href="https://github.com/wdecoster/nanopack" rel="nofollow">https://github.com/wdecoster/nanopack</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>