<?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/26409?offset=540</link>
	<atom:link href="https://bioinformaticsonline.com/related/26409?offset=540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36960/links-scaffolder-bloomfilter-setting</guid>
	<pubDate>Fri, 15 Jun 2018 10:39:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36960/links-scaffolder-bloomfilter-setting</link>
	<title><![CDATA[LINKS scaffolder bloomfilter setting !]]></title>
	<description><![CDATA[
<p>➜  bin git:(master) ✗ ls -l<br />total 68<br />drwxrwxr-x 3 urbe urbe  4096 Jun 15 12:15 lib<br />-rwxrwxrwx 1 urbe urbe 65141 Jun 15 17:13 LINKS<br />➜  bin git:(master) ✗ pwd<br />/home/urbe/Tools/LINKS_1.8.6/bin</p>

<p>➜  bloomfilter git:(master) ✗ swig -Wall -c++ -perl5 BloomFilter.i<br />➜  bloomfilter git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3<br />BloomFilter_wrap.cxx:1892:30: fatal error: ../BloomFilter.hpp: No such file or directory<br />compilation terminated.<br />➜  bloomfilter git:(master) ✗ cd swig <br />➜  swig git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3<br />In file included from BloomFilter_wrap.cxx:1877:0:<br />../BloomFilter.hpp: In member function ‘void BloomFilter::loadHeader(FILE*)’:<br />../BloomFilter.hpp:141:59: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]<br />         fread(&amp;header, sizeof(struct FileHeader), 1, file);<br />                                                           ^<br />➜  swig git:(master) ✗ g++ -Wall -shared BloomFilter_wrap.o -o BloomFilter.so -O3<br />➜  swig git:(master) ✗ cd ..<br />➜  bloomfilter git:(master) ✗ cd ..<br />➜  lib git:(master) ✗ cd ..<br />➜  bin git:(master) ✗ ./LINKS  <br />Usage: ./LINKS [v1.8.6]<br />-f  sequences to scaffold (Multi-FASTA format, required)<br />-s  file-of-filenames, full path to long sequence reads or MPET pairs [see below] (Multi-FASTA/fastq format, required)<br />-m  MPET reads (default -m 1 = yes, default = no, optional)<br />	! DO NOT SET IF NOT USING MPET. WHEN SET, LINKS WILL EXPECT A SPECIAL FORMAT UNDER -s<br />	! Paired MPET reads in their original outward orientation &lt;- -&gt; must be separated by ":"<br />	  &gt;template_name<br />	  ACGACACTATGCATAAGCAGACGAGCAGCGACGCAGCACG:ATATATAGCGCACGACGCAGCACAGCAGCAGACGAC<br />-d  distance between k-mer pairs (ie. target distances to re-scaffold on. default -d 4000, optional)<br />	Multiple distances are separated by comma. eg. -d 500,1000,2000,3000<br />-k  k-mer value (default -k 15, optional)<br />-t  step of sliding window when extracting k-mer pairs from long reads (default -t 2, optional)<br />	Multiple steps are separated by comma. eg. -t 10,5<br />-o  offset position for extracting k-mer pairs (default -o 0, optional)<br />-e  error (%) allowed on -d distance   e.g. -e 0.1  == distance +/- 10% (default -e 0.1, optional)<br />-l  minimum number of links (k-mer pairs) to compute scaffold (default -l 5, optional)<br />-a  maximum link ratio between two best contig pairs (default -a 0.3, optional)<br />	 *higher values lead to least accurate scaffolding*<br />-z  minimum contig length to consider for scaffolding (default -z 500, optional)<br />-b  base name for your output files (optional)<br />-r  Bloom filter input file for sequences supplied in -s (optional, if none provided will output to .bloom)<br />	 NOTE: BLOOM FILTER MUST BE DERIVED FROM THE SAME FILE SUPPLIED IN -f WITH SAME -k VALUE<br />	 IF YOU DO NOT SUPPLY A BLOOM FILTER, ONE WILL BE CREATED (.bloom)<br />-p  Bloom filter false positive rate (default -p 0.001, optional; increase to prevent memory allocation errors)<br />-x  Turn off Bloom filter functionality (-x 1 = yes, default = no, optional)<br />-v  Runs in verbose mode (-v 1 = yes, default = no, optional)</p>

<p>Error: Missing mandatory options -f and -s.</p>

<p>ERROR fixed</p>

<p>perl: symbol lookup error: /home/urbe/Tools/LINKS_new/bin/./lib/bloomfilter/swig/BloomFilter.so: undefined symbol: Perl_Gthr_key_ptr</p>
]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12995/national-center-for-bioinformatics-ncb</guid>
  <pubDate>Wed, 23 Jul 2014 14:10:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[National Center for Bioinformatics (NCB)]]></title>
  <description><![CDATA[
<p>NCB is offering M.Phil and Ph.D programs in the area of Bioinformatics. The major goal of NCB is to promote quality training and research in the area of Bioinformatics. Bioinformatics originated as a cross-disciplinary field as the need for computational sections to research problem raised in biomedicine. </p>

<p>More at http://ncb.qau.edu.pk/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</guid>
	<pubDate>Fri, 20 Jul 2018 10:03:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</link>
	<title><![CDATA[Converting a VCF into a FASTA given some reference !]]></title>
	<description><![CDATA[<p>Samtools/BCFtools (Heng Li) provides a Perl script&nbsp;<a href="https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl"><code>vcfutils.pl</code></a>&nbsp;which does this, the function&nbsp;<code>vcf2fq</code>&nbsp;(lines 469-528)</p><p>This script has been modified by others to convert InDels as well, e.g.&nbsp;<a href="https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl">this</a>&nbsp;by David Eccles</p><pre><code><span>./</span><span>vcf2fq</span><span>.</span><span>pl </span><span>-</span><span>f </span><span>&lt;</span><span>input</span><span>.</span><span>fasta</span><span>&gt;</span><span> </span><span>&lt;</span><span>all</span><span>-</span><span>site</span><span>.</span><span>vcf</span><span>&gt;</span><span> </span><span>&gt;</span><span> </span><span>&lt;</span><span>output</span><span>.</span><span>fastq</span><span>&gt;</span></code></pre><p>https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl</p><p>https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13276/senior-research-fellow-at-nit-rourkela</guid>
  <pubDate>Wed, 30 Jul 2014 00:53:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow at NIT, Rourkela]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA – 769 008(ORISSA)<br />SPONSORED RESEARCH, INDUSTRIAL CONSULTANCY &amp; CONTINUING EDUCATION</p>

<p>ADVERTISEMENT NO: NITR/SR/CH-BIF/2014/30</p>

<p>Applications are invited on prescribed format for the following assignment in a purely time bound research project undertaken in the Department of Biotechnology &amp; Medical Engineering of the Institute.</p>

<p>1. Name of the Temporary Post : Senior Research Fellow-01<br />2. Name of the Research Project: “ Bioinformatics Infrastructure Facility (BIF)”<br />3. Name of the Sponsoring Agency: DBT, Government of India, 4 Tenure of the Project : 12th Five year Plan<br />5 Tenure of the Assignment : 01 year [Likely to be extended for 04 more years]<br />6 Job Description : BIF Maintenance and Active Research in Bioinformatics<br />7. Consolidated monthly compensation / Fellowship: Rs.18,000/- P.M.</p>

<p>8. Essential Qualifications and experience: B.Tech with valid GATE Score or M.Tech degree in Biotechnology/Bioinformatics/Computer Science/Computational Biology<br />9. Desirable Qualifications/ Experiences: Experience of Programming in PERL,R, Python, Unix and Visual Studio + Knowledge in NGS data analysis work flows ,WGS and statistical packages such as CRAN-R,MATLAB etc.</p>

<p>10. Accommodation : Bachelor accommodation in the Institute may be provided subject to availability.<br />11. For technical information on the project, the candidate may contact the Principal Investigator at the following address:</p>

<p>Name : Prof. Mukesh K Gupta<br />Address : Dept. of Biotechnology &amp; Medical Engineering,<br />N.I.T.Rourkela-769 008<br />Telephone No : 0661-2462294<br />E-mail : guptam@nitrkl.ac.in</p>

<p>Eligible persons may apply in the prescribed format (available in the Institute Website)affixed with coloured photographs to be submitted in duplicate along with photo copies of relevant certificates, grade/ mark sheets, publications etc., to Asst. Registrar, SRICCE,<br />National Institute of Technology, Rourkela–769 008 before 22.08.2014. The cover should be super- scribed clearly the post applied for &amp; Name of the Project.</p>

<p>Mere possession of minimum qualification does not guarantee invitation to the interview.<br />Candidates will be short listed based on merit and need of the project.</p>

<p>Advertisement:</p>

<p>http://www.nitrkl.ac.in/IntraWeb/Jobs_Tenders/Jobs/ProjectFellowship/2014/141707192838_1.pdf</p>
]]></description>
</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/opportunity/view/13510/studentship-and-traineeship-in-bioinformatics-at-barkatullah-university-bhopal</guid>
  <pubDate>Thu, 07 Aug 2014 16:57:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Studentship and Traineeship in Bioinformatics at Barkatullah University, Bhopal]]></title>
  <description><![CDATA[
<p>Department of Biotechnology &amp; Bioinformatics Center<br />Barkatullah University, Bhopal – 462 026</p>

<p>Studentship and Traineeship in Bioinformatics</p>

<p>Applications are invited on plain paper from suitable candidates for Studentship and Traineeship (One each) at Bioinformatics Sub-Center as detailed below:</p>

<p>1. Studentship: Studentship is for those who have completed M. Sc. Degrees in Life Science.</p>

<p>Number of seats : One</p>

<p>Duration : Six months</p>

<p>Eligibility : Passed M.Sc. degree in Life Sciences.</p>

<p>Fellowship : Rs. 5000/- (Five thousand only) per month</p>

<p>2. Traineeship: Traineeship is for those who have completed M. Sc. Degrees in Life Science/Registered Ph. D. student in Life Sciences.</p>

<p>Number of seats : One</p>

<p>Duration : Six months</p>

<p>Eligibility : Passed M.Sc. degree in Life Sciences/ Registered Ph. D. student in Life Sciences</p>

<p>Fellowship : Rs. 5000/- (Five thousand only) per month</p>

<p>Preferences will be given to person who has experience in Bioinformatics and Computer<br />sciences. The application along with detailed bio-data should reach the undersigned, on or before 25th August 2014. Both, the studentship and the traineeship are temporary, will be discontinued after the six months from the date of Joining. It may be discontinued in-between without any notice, if the work is not found satisfactory.</p>

<p>Advertisement www.bioinfobubpl.nic.in/Advertisement_st.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37840/long-read-assembly-workshop</guid>
	<pubDate>Thu, 04 Oct 2018 17:23:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37840/long-read-assembly-workshop</link>
	<title><![CDATA[Long read assembly workshop !]]></title>
	<description><![CDATA[<p>This is a tutorial for a workshop on long-read (PacBio) genome assembly.</p>
<p>It demonstrates how to use long PacBio sequencing reads to assemble a bacterial genome, and includes additional steps for circularising, trimming, finding plasmids, and correcting the assembly with short-read Illumina data.</p>
<p>&nbsp;Please comment if you know any other long read addembly tutorial.</p><p>Address of the bookmark: <a href="http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/" rel="nofollow">http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38041/synima-a-synteny-imaging-tool-for-annotated-genome-assemblies</guid>
	<pubDate>Tue, 30 Oct 2018 10:49:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38041/synima-a-synteny-imaging-tool-for-annotated-genome-assemblies</link>
	<title><![CDATA[Synima: a Synteny imaging tool for annotated genome assemblies]]></title>
	<description><![CDATA[<p><span>Synima written in Perl, which uses the graphical features of R. Synima takes orthologues computed from reciprocal best BLAST hits or OrthoMCL, and DAGchainer, and outputs an overview of genome-wide synteny in PDF. Each of these programs are included with the Synima package, and a pipeline for their use. Synima has a range of graphical parameters including size, colours, order, and labels, which are specified in a config file generated by the first run of Synima &ndash; and can be subsequently edited. Synima runs quickly on a command line to generate informative and publication quality figures. Synima is open source and freely available from&nbsp;</span><a href="https://github.com/rhysf/Synima" target="_blank">https://github.com/rhysf/Synima</a><span>&nbsp;under the MIT License.</span></p><p>Address of the bookmark: <a href="https://github.com/rhysf/Synima" rel="nofollow">https://github.com/rhysf/Synima</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14183/guest-faculty-at-pondicherry-university</guid>
  <pubDate>Wed, 20 Aug 2014 00:37:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Guest Faculty at Pondicherry University]]></title>
  <description><![CDATA[
<p>Pondicherry University, India</p>

<p>Walk in interview for guest faculty in Pondicherry University, India. For more information please visit http://www.bicpu.edu.in/bioinfor140814.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</guid>
	<pubDate>Thu, 15 Nov 2018 12:48:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</link>
	<title><![CDATA[NovoGraph: building whole genome graphs from long-read-based de novo assemblies]]></title>
	<description><![CDATA[<p><span>NovoGraph: building whole genome graphs from long-read-based de novo assemblies</span></p>
<p><span><span>An algorithmically novel approach to construct a genome graph representation of long-read-based&nbsp;</span><em>de novo</em><span>&nbsp;sequence assemblies. We then provide a proof of principle by creating a genome graph of seven ethnically-diverse human genomes.</span></span></p>
<p>&nbsp;</p>
<p>https://f1000research.com/articles/7-1391/v1</p><p>Address of the bookmark: <a href="https://github.com/NCBI-Hackathons/NovoGraph" rel="nofollow">https://github.com/NCBI-Hackathons/NovoGraph</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>