<?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/26573?offset=460</link>
	<atom:link href="https://bioinformaticsonline.com/related/26573?offset=460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</guid>
	<pubDate>Tue, 28 Jan 2020 03:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</link>
	<title><![CDATA[Π-cyc: A Reference-free SNP Discovery Application using Parallel Graph Search]]></title>
	<description><![CDATA[<p>Reference free SNP search for comparative population genomics: multiple samples run simultanously. **experimental phase, compiles and runs with OpenMPI-1.8.8 with Intel Compiler only</p>
<p><span>Cycles enumeration (aka Bubbles) as part of de novo de bruijn graphs assembly using colours can be unpractical for large error prone genomes which makes the assembly process produce an excessive number of false positive cycles.&nbsp; Our solution is to search the graph in multicores shared memory parallel mode using graph decomposition then use filtering method to generate good quality SNPs.</span></p>
<p><a href="https://arxiv.org/abs/1809.06700">https://arxiv.org/abs/1809.06700</a></p>
<p><a href="https://github.com/redayounsi/2KP2P">https://github.com/redayounsi/2KP2P</a></p>
<blockquote>
<p>/2kp2omp/bin/main_2kp2_K63_C2 -i fastq_files.txt -o fungus_bub.fasta -r stat_fungus.txt -c cov_fungus_hash.txt -k 63 -h 20 -b 100 -g 600 -l 100 -f 16 -t 5.0 -x 1 -v 0 -p 1 -y 1 -u 1</p>
<p>&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="https://github.com/redayounsi/2KP2P" rel="nofollow">https://github.com/redayounsi/2KP2P</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/23959/bioinformatics-jokes</guid>
	<pubDate>Fri, 21 Aug 2015 01:26:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/23959/bioinformatics-jokes</link>
	<title><![CDATA[Bioinformatics Jokes !!]]></title>
	<description><![CDATA[<p>Why was the Bioinformatics fired from his job?</p><p>A: He was getting too Sassy.</p><p>&nbsp;</p><p>What did the bioinformatician say when he found out his team stopped using version control?</p><p>A: Y&rsquo;all better Git!</p><p>&nbsp;</p><p>Why did the computational biologist stay home from work?</p><p>A: He had a code!</p><p>&nbsp;</p><p>Why was the bioinformatician's paper was rejected?</p><p>A: Journal thought it seemed scripted.</p><p>&nbsp;</p><p>How can you tell that a Bioinformatics is working?</p><p>A: You can hear him Grunting!</p><p>&nbsp;</p><p>Why bioinformatician always silence?</p><p>A: Because bioinformatician calmly whisper, &ldquo;SSH&rdquo;</p><p>&nbsp;</p><p>Why was the bioinformatician always so sleepy?</p><p>A: He/She wasn&rsquo;t given any Java.</p><p>&nbsp;</p><p>Why did the program/software hanged?</p><p>A: Because genome float.</p><p>&nbsp;</p><p>Why was the class upset that its parent died?</p><p>A: Because it wouldn&rsquo;t be getting the inheritance!</p><p>&nbsp;</p><p>Why did bioinformatician always works on the command line?</p><p>A: Because they don't want to scare you with huge amount of data!</p><p>&nbsp;</p><p>Why did the bioinformatician attend the gay pride parade?</p><p>A: They supported polymorphism.</p><p>&nbsp;</p><p>Why did bioinformatician prefer awk, PerlOneliner?</p><p>A: Because even computer can't handle to load the data.</p><p>&nbsp;</p><p>Why don&rsquo;t bioinformatician get along with others?</p><p>A: They&rsquo;re too MEAN.</p><p>&nbsp;</p><p>Why computational biologist are cool?</p><p>A: Because they are scripted!!</p><p>&nbsp;</p><p>Why they talk $ unzip; strip; touch; finger; grep; mount; fsck; more; yes; fsck; fsck; umount; clean; sleep;</p><p>A: Ah, Ohhh, dude, these are *NIX commands</p><p>&nbsp;</p><p>Did they really hack genome?</p><p>A: Yes, I guess so.</p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Mon, 18 Jan 2021 10:47:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24298/staff-scientists-at-national-institute-of-plant-genome-research-new-delhi</guid>
  <pubDate>Fri, 04 Sep 2015 22:06:59 -0500</pubDate>
  <link></link>
  <title><![CDATA[Staff Scientists at National Institute of Plant Genome Research, New Delhi]]></title>
  <description><![CDATA[
<p>National Institute of Plant Genome Research, New Delhi is an Autonomous Research Institution funded by Department of Biotechnology, Ministry of Science &amp; Technology, Govt. of India, to pursue research on various aspects of plant genomics. The Institute is also in the process of establishing a NIPGR Translational Centre at Biotech Science Cluster, NCR, Faridabad. NIPGR invites applications from Indian Citizens for filling up the vacant posts on Direct Recruitment basis, as detailed below. The posts are temporary but likely to continue.</p>

<p>Staff Scientists</p>

<p>Specialization: Applicant should have a Ph.D. with excellent academic credentials along with the track record of scientific productivity evidenced by publications/patents/products in the frontier areas of Plant Biology such as, Computational Biology, Genome Analysis and Molecular Mapping, Molecular Mechanism of Abiotic Stress Responses, Nutritional Genomics, Plant Development and Architecture, Plant Immunity, Molecular Breeding, Transgenics for crop improvement and other emerging areas based on plant genomics.</p>

<p>Remuneration: The length of experience and scientific accomplishments/quality of scientific productivity record will be major factors in deciding the level of appointment as Staff Scientist as well as starting salary in the Pay Bands of Rs 15,600-39,100 (with grade pay of  5400), and Rs 37,400-67,000 (with grade pay of  8,700 and  8,900) plus usual allowances admissible to the Central Government employees. However, NIPGR reserves the right to select candidates in the lower grade against the foregoing posts depending upon the qualifications and experience of the candidate. Reservation of posts shall be as per Govt. of India norms. Five posts (SC-2, ST-1, OBC-2) in the Pay Band of Rs 15,600-39,100 with Grade Pay of  Rs 5400, are reserved.</p>

<p>More at http://www.nipgr.res.in/careers/vacancies_latest.php#</p>

<p>Apply online at http://www.nipgr.res.in/nipgr_recu/nipgr_recu.php</p>

<p>Form http://www.nipgr.res.in/files/careers/Application_Performa_2015.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44589/sourmash-quickly-search-compare-and-analyze-genomic-and-metagenomic-data-sets</guid>
	<pubDate>Sat, 06 Jul 2024 04:24:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44589/sourmash-quickly-search-compare-and-analyze-genomic-and-metagenomic-data-sets</link>
	<title><![CDATA[sourmash: Quickly search, compare, and analyze genomic and metagenomic data sets.]]></title>
	<description><![CDATA[<p dir="auto">sourmash is a k-mer analysis multitool, and we aim to provide stable, robust programmatic and command-line APIs for a variety of sequence comparisons. Some of our special sauce includes:</p>
<ul dir="auto">
<li><code>FracMinHash</code>&nbsp;sketching, which enables accurate comparisons (including ANI) between data sets of different sizes</li>
<li><code>sourmash gather</code>, a combinatorial k-mer approach for more accurate metagenomic profiling</li>
</ul>
<p dir="auto">Please see the&nbsp;<a href="https://sourmash.readthedocs.io/en/latest/publications.html#sourmash-fundamentals">sourmash publications</a>&nbsp;for details.</p>
<p dir="auto">The name is a riff off of&nbsp;<a href="https://github.com/marbl/Mash">Mash</a>, combined with @ctb's love of whiskey. (<a href="https://en.wikipedia.org/wiki/Sour_mash">Sour mash</a>&nbsp;is used in making whiskey.)</p>
<p dir="auto">Maintainers:&nbsp;<a href="mailto:titus@idyll.org">C. Titus Brown</a>&nbsp;(<a href="http://github.com/ctb">@ctb</a>),&nbsp;<a href="mailto:luiz@sourmash.bio">Luiz C. Irber, Jr</a>&nbsp;(<a href="http://github.com/luizirber">@luizirber</a>), and&nbsp;<a href="mailto:tessa@sourmash.bio">N. Tessa Pierce-Ward</a>&nbsp;(<a href="http://github.com/bluegenes">@bluegenes</a>).</p>
<p dir="auto">sourmash was initially developed by the&nbsp;<a href="http://ivory.idyll.org/lab/">Lab for Data-Intensive Biology</a>&nbsp;at the&nbsp;<a href="http://www.vetmed.ucdavis.edu/">UC Davis School of Veterinary Medicine</a>, and now includes contributions from the global research and developer community.</p><p>Address of the bookmark: <a href="https://github.com/sourmash-bio/sourmash" rel="nofollow">https://github.com/sourmash-bio/sourmash</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</guid>
	<pubDate>Fri, 03 Mar 2017 05:15:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</link>
	<title><![CDATA[MetaPred2CS]]></title>
	<description><![CDATA[<p style="text-align: justify;"><strong>MetaPred2CS Web server&nbsp;</strong>is a meta-predictor based on&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17160063">Support Vector Machine (SVM)</a>&nbsp;that combines 6 individual sequence based protein-protein interaction prediction methods to predict&nbsp;<strong>prokaryotic two-component system&nbsp;</strong>protein-protein interactions (PPIs). The methods implemented in MetaPred2CS are 2 co-evolutionary methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11933068">in-silico two hybrid (i2h)</a>&nbsp;and&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11707606">mirror tree (MT)</a>&nbsp;methods and 4 genomics context based methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/15947018">phylogenetic profiling (PP)</a>,&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/10573422">gene fusion (GF)</a>,&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene neighbourhood (GN)</a>&nbsp;and and&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene operon methods (GO)</a>.</p>
<p>&nbsp;http://metapred2cs.ibers.aber.ac.uk/</p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/MetaPred2CS" rel="nofollow">https://github.com/martinjvickers/MetaPred2CS</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24666/bioinformatics-faculty-at-bharathidasan-university</guid>
  <pubDate>Sat, 26 Sep 2015 20:34:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Faculty at BHARATHIDASAN UNIVERSITY]]></title>
  <description><![CDATA[
<p>BHARATHIDASAN UNIVERSITY</p>

<p>(Reaccredited by NAAC with ‘A’ grade)</p>

<p>TIRUCHIRAPPALLI - 620 024</p>

<p>I N V I T E S</p>

<p>APPLICATIONS FOR FACULTY POSITIONS UNDER UGC XII PLAN CREATED POSTS ON CONTRACTUAL BASIS TILL 31.03.2017 IN THE FOLLOWING UNIVERSITY DEPARTMENTS. (Notification No. 31300 /H2/2015, Dt.: 18.09.2015)</p>

<p>ASSISTANT PROFESSOR</p>

<p>1. Bio-Informatics ONE (MBC)</p>

<p>2. Bio-Chemistry ONE G.T.(W)DW</p>

<p>Consolidated Pay of Rs.45,000/- p.m.</p>

<p>Qualification : As per UGC/AICTE/NCTE norms</p>

<p>Application along with other details including specialization can be downloaded from the University website www.bdu.ac.in</p>

<p>LAST DATE FOR RECEIPT OF FILLED IN APPLICATION IS 07.10.2015 BY 5.00 P.M.</p>

<p>More Info : www.bdu.ac.in/adv/UGC_XII_Plan_Contract_Positions.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27253/ra-bioinformatics-at-jnu-delhi</guid>
  <pubDate>Tue, 10 May 2016 01:50:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[R.A Bioinformatics at JNU, Delhi]]></title>
  <description><![CDATA[
<p>R.A Jobs opportunity in Jawaharlal Nehru University (JNU) on purely temporary basis</p>

<p>Project Title : "Structural and functional characterization of serine biosynthetic pathway enzymes from Entamoeba histolytica"</p>

<p>No. of Post : 01</p>

<p>Qualification : Ph.D in any computational biology / bioinformatics</p>

<p>Desirable : 1. Experience with docking, simulations and structural biology with proof of publications is preferred. 2. National Eligibility Test cleared [CSIR/UGC] candidate is preferred.</p>

<p>Salary : According to CSIR rules<br />How to apply</p>

<p>The application on plain paper indicating name, date of birth/age, address, essential/technical/professional qualifications. experience, list of publications should reach The Prof. S. Gourinath, Principal Investigator, [Project Director], School of Life Sciences, Jawaharlal Nehru University, New Delhi-110067, on or before 23rd May 2016.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25306/research-trainees-recruitment-in-national-agri-food-biotechnology-institute-nabi</guid>
  <pubDate>Sun, 29 Nov 2015 02:47:28 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Trainees recruitment in National Agri-Food Biotechnology Institute (NABI)]]></title>
  <description><![CDATA[
<p>Research Trainees recruitment in National Agri-Food Biotechnology Institute (NABI)</p>

<p>Eligibility : Pursuing final year of M.Sc./M.Tech.</p>

<p>Subject category for training : I. Agricultural biotechnology II. Computational biology and bioinformatics III. Food Science &amp; Technology IV. Nutrition Science &amp; Technology</p>

<p>Duration of Training : 6 months (January to June 2016)</p>

<p>Selection Procedure : Through screening and selection based on merit, experience, and expression of interest submitted by candidates <br />How to apply</p>

<p>The last date of application to reach NABI latest by November 30, 2015 by 5:30 PM </p>

<p>More at http://www.nabi.res.in/Training.aspx</p>
]]></description>
</item>

</channel>
</rss>