<?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/30111?offset=600</link>
	<atom:link href="https://bioinformaticsonline.com/related/30111?offset=600" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22287/research-fellows-at-aimscs-hyderabad</guid>
  <pubDate>Wed, 06 May 2015 06:23:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Fellows at AIMSCS, Hyderabad]]></title>
  <description><![CDATA[
<p>C.R.Rao Advanced Institute of Mathematics, Statistics and Computer Science (AIMSCS) - Hyderabad, Andhra Pradesh<br />Advertisement No.: 5/2015</p>

<p>Research Fellows Systems Biology job vacancy in C.R.Rao Advanced Institute of Mathematics, Statistics and Computer Science (AIMSCS)</p>

<p>JRF : Qualification - M. Sc in Bioinformatics, Systems Biology, M. Sc statistics, or M. Tech in Bioinformatics,</p>

<p>Pay Scale : Rs. 25,000</p>

<p>SRF : Qualification- Qualification prescribed for JRF with 2 years of research experience.</p>

<p>Pay Scale : Rs. 28,000*</p>

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

<p>Desirable: Candidates should have strong background in Computational biology, bioinformatics, statistics and algorithmic development. In addition to that previous experience of working on Linux, bio-informatics, NGS data analysis and Basic knowledge of biology is desirable. Programming on any one of the programming languages (C, C++, perl, python) and statistical framework (e.g. R, matlab, etc.) is highly desirable.</p>

<p>More at http://www.crraoaimscs.org/jrf_application_form_2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</guid>
	<pubDate>Sun, 20 Dec 2020 01:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</link>
	<title><![CDATA[SneakySnake: A Fast and Accurate Universal Genome Pre-Alignment Filter for CPUs, GPUs, and FPGAs]]></title>
	<description><![CDATA[<p><span>The first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU architectures. SneakySnake greatly (by more than two orders of magnitude) expedites sequence alignment calculation for both short (Illumina) and long (ONT and PacBio) reads. Described by Alser et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/abs/1910.09020">https://arxiv.org/abs/1910.09020</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/SneakySnake" rel="nofollow">https://github.com/CMU-SAFARI/SneakySnake</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22388/perl-one-liner-basics</guid>
	<pubDate>Sun, 24 May 2015 09:28:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22388/perl-one-liner-basics</link>
	<title><![CDATA[Perl One liner basics !!]]></title>
	<description><![CDATA[<p>Perl has a ton of command line switches (see perldoc perlrun), but I'm just going to cover the ones you'll commonly need to debug code. The most important switch is -e, for execute (or maybe "engage" :) ). The -e switch takes a quoted string of Perl code and executes it. For example:<br /><br />$ perl -e 'print "Hello, World!\n"'<br />Hello, World!<br /><br />It's important that you use single-quotes to quote the code for -e. This usually means you can't use single-quotes within the one liner code. If you're using Windows cmd.exe or PowerShell, you must use double-quotes instead.<br /><br />I'm always forgetting what Perl's predefined special variables do, and often test them at the command line with a one liner to see what they contain. For instance do you remember what $^O is?<br /><br />$ perl -e 'print "$^O\n"'<br />linux<br /><br />It's the operating system name. With that cleared up, let's see what else we can do. If you're using a relatively new Perl (5.10.0 or higher) you can use the -E switch instead of -e. This turns on some of Perl's newer features, like say, which prints a string and appends a newline to it. This saves typing and makes the code cleaner:<br /><br />$ perl -E 'say "$^O"'<br />linux<br /><br />Pretty handy! say is a nifty feature that you'll use again and again.</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43060/simons-genome-diversity-project</guid>
	<pubDate>Sat, 08 May 2021 21:55:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43060/simons-genome-diversity-project</link>
	<title><![CDATA[Simons Genome Diversity Project]]></title>
	<description><![CDATA[<p><em>Complete genome sequences from more than one hundred diverse human populations</em></p>
<p>All genomes in the dataset were sequenced to at least 30x coverage using Illumina technology. The sequencing reads were mapped and genotyped using a customized procedure that was optimized for population genetic analysis. The researchers eliminated bias of alleles toward matching the human genome reference sequence, and determined genotypes on a single-sample basis to avoid preferential calling of genotypes from populations that had more individuals represented.</p><p>Address of the bookmark: <a href="https://www.simonsfoundation.org/simons-genome-diversity-project/" rel="nofollow">https://www.simonsfoundation.org/simons-genome-diversity-project/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</guid>
	<pubDate>Wed, 15 Sep 2021 22:17:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</link>
	<title><![CDATA[HISAT2 Index Files Download !]]></title>
	<description><![CDATA[<p>Resource for downloading all the HISAT2 related files&nbsp;</p>
<p>Please cite:</p>
<blockquote>
<p>Kim, D., Paggi, J.M., Park, C.&nbsp;<em>et al.</em>&nbsp;Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype.&nbsp;<em>Nat Biotechnol</em>&nbsp;<strong>37</strong>, 907&ndash;915 (2019).&nbsp;<a href="https://doi.org/10.1038/s41587-019-0201-4" target="_blank">https://doi.org/10.1038/s41587-019-0201-4</a></p>
</blockquote><p>Address of the bookmark: <a href="http://daehwankimlab.github.io/hisat2/download/#h-sapiens" rel="nofollow">http://daehwankimlab.github.io/hisat2/download/#h-sapiens</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22416/rosenberg-lab</guid>
  <pubDate>Wed, 27 May 2015 17:52:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Rosenberg lab]]></title>
  <description><![CDATA[
<p>Research. Research in the lab focuses on mathematical, statistical, and computational problems in evolutionary biology and human genetics. Long-term interests of the lab include topics such as:</p>

<p>    Human genetic variation<br />    Inference of human evolutionary history from genetic markers<br />    Statistical analysis of population-genetic data<br />    Mathematical models of gene genealogies<br />    Theoretical population genetics<br />    Combinatorics of evolutionary trees<br />    The relationship between gene trees and species trees<br />    The role of human evolutionary genetics in the search for genes that contribute to disease-susceptibility <br />More at https://web.stanford.edu/group/rosenberglab/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</guid>
	<pubDate>Fri, 17 Dec 2021 00:08:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</link>
	<title><![CDATA[UniqueKmer: Generate unique KMERs for every contig in a FASTA file]]></title>
	<description><![CDATA[<p dir="auto">Generate unique k-mers for every contig in a FASTA file.</p>
<p dir="auto">Unique k-mer is consisted of k-mer keys (i.e. ATCGATCCTTAAGG) that are only presented in one contig, but not presented in any other contigs (for both forward and reverse strands).</p>
<p dir="auto">This tool accepts the input of a FASTA file consisting of many contigs, and extract unique k-mers for each contig.</p>
<p dir="auto">The output unique k-mer file and Genome file can be used for fastv:&nbsp;<a href="https://github.com/OpenGene/fastv">https://github.com/OpenGene/fastv</a>, which is an ultra-fast tool to identify and visualize microbial sequences from sequencing data.</p>
<p>https://github.com/OpenGene/UniqueKMER</p><p>Address of the bookmark: <a href="https://github.com/OpenGene/UniqueKMER" rel="nofollow">https://github.com/OpenGene/UniqueKMER</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22437/jrf-bioinformatics-icar-national-research-centre-for-orchids-pakyong</guid>
  <pubDate>Thu, 28 May 2015 19:33:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ ICAR - National Research Centre for Orchids  Pakyong]]></title>
  <description><![CDATA[
<p>ICAR - National Research Centre for Orchids</p>

<p>Pakyong</p>

<p>F.No:NRCO/Admn/DBT /136 /</p>

<p>Walk-in-Interviews will be held at 737106, Sikkim for the post of 01 (One Project ‘DBT’s Twinning programme for the NE’ titled “Assessment of some fragrant orchids of north-east India for sustainable improvement of community livelihood”, indicated below. The appointment will be on contractual basis and the incumbents shall not have any regular appointment in ICAR.</p>

<p>‘DBT’s Twinning programme for the NE’ titled “Assessment of chemical and genetic divergence of some fragrant orchids of north-east India for sustainable improvement of community livelihood”</p>

<p>Junior Research Fellow (One post)</p>

<p>Essential Qualification : a. MSc (with NET qualification) / M.Tech degree (with or without NET) with minimum 55% marks in Biotechnology/ Bioinformatics/ Molecular Biology or any other related field.</p>

<p>Desirable Qualification: Computer Skills (Linux, Perl, Java, MySQL) with experience in advanced molecular Biology techniques</p>

<p>2nd June 2015</p>

<p>Advertisement: www.nrcorchids.nic.in/Employments/Vacancy%20-%20JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:38:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22570/frequent-words-problem-solution-by-perl</link>
	<title><![CDATA[Frequent words problem solution by Perl]]></title>
	<description><![CDATA[<div><p>Solved with perl <a href="http://rosalind.info/problems/1a/">http://rosalind.info/problems/1a/</a></p><p>#Find the most frequent k-mers in a string.<br />#Given: A DNA string Text and an integer k.<br />#Return: All most frequent k-mers in Text (in any order).<br /><br />use strict;<br />use warnings;<br /><br />my $string="ACGTTGCATGTCGCATGATGCATGAGAGCT";<br />my $kmer=4; <br />my %myHash;<br />my $max=0;<br /><br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myStr=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;#print "$myStr\n";<br />&nbsp;&nbsp; &nbsp;my $km=kmerMatch ($string, $myStr, $kmer);<br />&nbsp;&nbsp; &nbsp;if ($km &gt; $max) { $max = $km;}<br />&nbsp;&nbsp; &nbsp;#print "$km\t$myStr\n";<br />&nbsp;&nbsp; &nbsp;$myHash{$myStr}=$km;<br />&nbsp;&nbsp; &nbsp;<br />}<br /><br />#Print all key which have matching values<br />foreach my $name (keys %myHash){<br />&nbsp;&nbsp;&nbsp; print "$name " if $myHash{$name} == $max;<br />}<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />my $count=0;<br />for (my $aa=0; $aa&lt;=(length($string)-4); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp; &nbsp;if ($myWin eq $myStr) {<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;#print "$myWin eq $myStr\n";<br />&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;$count++;<br />&nbsp;&nbsp; &nbsp;}<br />}<br />return $count;<br />}</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>