<?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/14036?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/14036?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</guid>
	<pubDate>Mon, 11 Jun 2018 04:52:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</link>
	<title><![CDATA[BEAP: Blast Extension and Assembly Program]]></title>
	<description><![CDATA[The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the "primer" therefore help to "extend" the length of the original sequence for constructing a "full length" sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium analysis. The confidence of assembling the resulting sequences is achieved by using a known genome, such as human genome, as a reference.
 
https://www.animalgenome.org/tools/beap/<p>Address of the bookmark: <a href="https://www.animalgenome.org/tools/beap/" rel="nofollow">https://www.animalgenome.org/tools/beap/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/44408/charpak-exchange-program</guid>
  <pubDate>Fri, 10 Nov 2023 02:33:38 -0600</pubDate>
  <link></link>
  <title><![CDATA[Charpak exchange program]]></title>
  <description><![CDATA[
<p>The scholarship is designed for Indian students from all fields and streams of study, enrolled in an Indian institution at the Bachelors or Master’s degree level, who wish to undertake a study exchange semester programme in France (for a period of one to six months).</p>

<p>BENEFITS <br />The Charpak exchange program offers the following benefits to the awardees based on merit: monthly stipend of 860 euros social security student visa and Campus France fee waiver assistance in finding an affordable student accommodation (subject to availability)</p>

<p>https://www.inde.campusfrance.org/charpak-exchange-scholarship-spring-session-jan-june</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</guid>
	<pubDate>Fri, 21 Sep 2018 10:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37759/pandaseq-is-a-program-to-align-illumina-reads-optionally-with-pcr-primers-embedded-in-the-sequence-and-reconstruct-an-overlapping-sequence</link>
	<title><![CDATA[PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.]]></title>
	<description><![CDATA[<p>Development packages for zlib and libbz2 are needed, as well as a standard compiler environment. On Ubuntu, this can be installed via:</p>
<pre><code>sudo apt-get install build-essential libtool automake zlib1g-dev libbz2-dev pkg-config
</code></pre>
<p>On MacOS, the Apple Developer tools and Fink (or MacPorts or Brew) must be installed, then:</p>
<pre><code>sudo fink install bzip2-dev pkgconfig</code></pre><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:05:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</link>
	<title><![CDATA[LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.]]></title>
	<description><![CDATA[<p>LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.</p>
<p>The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE,&nbsp;<a href="http://www.expasy.org/prosite/">http://www.expasy.org/prosite/</a>) to locate cores of important enzymes if they occur.</p><p>Address of the bookmark: <a href="https://github.com/xzhub/LTR_Finder" rel="nofollow">https://github.com/xzhub/LTR_Finder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40214/gooey-turn-almost-any-python-command-line-program-into-a-full-gui-application-with-one-line</guid>
	<pubDate>Fri, 01 Nov 2019 00:29:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40214/gooey-turn-almost-any-python-command-line-program-into-a-full-gui-application-with-one-line</link>
	<title><![CDATA[Gooey: Turn (almost) any Python command line program into a full GUI application with one line]]></title>
	<description><![CDATA[<p><span>Turn (almost) any Python command line program into a full GUI application with one line</span></p>
<p>The easiest way to install Gooey is via&nbsp;<code>pip</code></p>
<pre><code>pip install Gooey 
</code></pre>
<p>Alternatively, you can install Gooey by cloning the project to your local directory</p>
<pre><code>git clone https://github.com/chriskiehl/Gooey.git
</code></pre>
<p>run&nbsp;<code>setup.py</code></p>
<pre><code>python setup.py install</code></pre><p>Address of the bookmark: <a href="https://github.com/chriskiehl/Gooey" rel="nofollow">https://github.com/chriskiehl/Gooey</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43722/crossmap-program-for-genome-coordinates-conversion-between-different-assemblies</guid>
	<pubDate>Tue, 25 Jan 2022 17:59:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43722/crossmap-program-for-genome-coordinates-conversion-between-different-assemblies</link>
	<title><![CDATA[CrossMap: program for genome coordinates conversion between different assemblies]]></title>
	<description><![CDATA[<p><span>CrossMap is a program for genome coordinates conversion between&nbsp;</span><em>different assemblies</em><span>&nbsp;(such as&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a><span>&nbsp;&lt;=&gt;&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a><span>). It supports commonly used file formats including&nbsp;</span><a href="https://samtools.github.io/hts-specs/SAMv1.pdf">BAM</a><span>,&nbsp;</span><a href="https://en.wikipedia.org/wiki/CRAM_(file_format)">CRAM</a><span>,&nbsp;</span><a href="https://en.wikipedia.org/wiki/SAM_(file_format)">SAM</a><span>,&nbsp;</span><a href="https://genome.ucsc.edu/goldenPath/help/wiggle.html">Wiggle</a><span>,&nbsp;</span><a href="https://genome.ucsc.edu/goldenPath/help/bigWig.html">BigWig</a><span>,&nbsp;</span><a href="https://genome.ucsc.edu/FAQ/FAQformat.html#format1">BED</a><span>,&nbsp;</span><a href="https://genome.ucsc.edu/FAQ/FAQformat.html#format3">GFF</a><span>,&nbsp;</span><a href="https://genome.ucsc.edu/FAQ/FAQformat.html#format4">GTF</a><span>,&nbsp;</span><a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">MAF</a><span>&nbsp;</span><a href="https://samtools.github.io/hts-specs/VCFv4.2.pdf">VCF</a><span>, and&nbsp;</span><a href="https://sites.google.com/site/gvcftools/home/about-gvcf">gVCF</a><span>.</span></p><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</guid>
	<pubDate>Thu, 18 Feb 2016 04:50:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26414/advanced-bash-scripting-guide</link>
	<title><![CDATA[Advanced Bash-Scripting Guide]]></title>
	<description><![CDATA[<p>This tutorial assumes no previous knowledge of scripting or programming, yet progresses rapidly toward an intermediate/advanced level of instruction <em>. . . all the while sneaking in little nuggets of <span>UNIX</span>&reg; wisdom and lore</em>. It serves as a textbook, a manual for self-study, and as a reference and source of knowledge on shell scripting techniques. The exercises and heavily-commented examples invite active reader participation, under the premise that <tt><strong>the only way to really learn scripting is to write scripts</strong></tt>.</p>
<p>This book is suitable for classroom use as a general introduction to programming concepts.</p>
<p>More at http://tldp.org/LDP/abs/html/</p><p>Address of the bookmark: <a href="http://tldp.org/LDP/abs/html/" rel="nofollow">http://tldp.org/LDP/abs/html/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>