<?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/39200?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/39200?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/21241/pacman</guid>
	<pubDate>Mon, 16 Feb 2015 12:15:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/21241/pacman</link>
	<title><![CDATA[Pacman]]></title>
	<description><![CDATA[<p><span>The pacman package is an R package management tool that combines the functionality of base library related functions into intuitively named functions. This package is ideally added to .Rprofile to increase workflow by reducing time recalling obscurely named functions, reducing code and integrating functionality of base functions to simultaneously perform multiple actions.<br /><br />Function names in the pacman package follow the format of p_xxx where &lsquo;xxx&rsquo; is the task the function performs. For instance the p_load function allows the user to load one or more packages as a more generic substitute for the library or require functions and if the package isn&rsquo;t available locally it will install it for you.<br /><br /></span></p><p><strong>Installation</strong></p><p><span>To download the development version of pacman:</span></p><p><span>Download the </span><a href="https://github.com/trinker/pacman/zipball/master">zip ball</a><span> or </span><a href="https://github.com/trinker/pacman/tarball/master">tar ball</a><span>, decompress and run </span><code>R CMD INSTALL</code><span> on it, or use th</span><span>e </span><strong>devtools</strong><span> package to install the development version:</span></p><pre title="">## Make sure your current packages are up to date
update.packages()
## devtools is required
devtools::install_github("trinker/pacman")
</pre><p>Note: Windows users need <a href="http://www.murdoch-sutherland.com/Rtools/">Rtools</a> and <a href="http://CRAN.R-project.org/package=devtools">devtools</a> to install this way.</p><p>More at https://github.com/trinker/pacman</p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</guid>
	<pubDate>Thu, 16 Jun 2016 18:57:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</link>
	<title><![CDATA[clusterProfiler]]></title>
	<description><![CDATA[<p>statistical analysis and visulization of functional profiles for genes and gene clusters<br><br>Bioconductor version: Release (3.3)<br><br>This package implements methods to analyze and visualize functional profiles (GO and KEGG) of gene and gene clusters.<br><br>Author: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt; with contributions from Li-Gen Wang and Giovanni Dall'Olio.<br><br>Maintainer: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt;<br><br>Citation (from within R, enter citation("clusterProfiler")):<br><br>Yu G, Wang L, Han Y and He Q (2012). &ldquo;clusterProfiler: an R package for comparing biological themes among gene clusters.&rdquo; OMICS: A Journal of Integrative Biology, 16(5), pp. 284-287.<br>Installation<br><br>To install this package, start R and enter:<br><br>## try http:// if https:// URLs are not supported<br>source("https://bioconductor.org/biocLite.R")<br>biocLite("clusterProfiler")</p>
<p>https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</guid>
	<pubDate>Fri, 07 Feb 2020 07:16:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</link>
	<title><![CDATA[Consed--A Finishing Package (BAM File Viewer, Assembly Editor, Autofinish, Autoreport, Autoedit, and Align Reads To Reference Sequence)]]></title>
	<description><![CDATA[<ul>
<li>Supports Illumina, 454, other Next-Gen and Sanger Reads and allows mixtures of these read types</li>
<li>Consed includes BamScape which can view bam files with unlimited numbers of reads. BamScape can bring up consed to edit reads and the reference sequence in targeted regions.</li>
<li>Consed is compatible with Newbler, Cross_match, Phrap, MIRA, Velvet and PCAP output.</li>
<li>Quickly takes the user to each variant site for viewing (also available as an automated report)</li>
<li>Overview of assembly can help detect and fix misassemblies</li>
<li>Editing time reduced by the program's ability to pin-point problem areas</li>
<li>Editing is guided by error probabilities</li>
</ul><p>Address of the bookmark: <a href="http://www.phrap.org/consed/consed.html" rel="nofollow">http://www.phrap.org/consed/consed.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</guid>
	<pubDate>Tue, 17 Sep 2024 02:34:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</link>
	<title><![CDATA[SVbyEye: R Package to visualize alignments between two or multiple DNA sequences]]></title>
	<description><![CDATA[<p dir="auto">R Package to visualize alignments between two or multiple DNA sequences including<br>a number of functionalities to facilitate processing of alignments in PAF format.</p>
<p dir="auto"><span>SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence alignments along with various functionalities to process alignments in PAF format. The tool facilitates the characterization of complex SVs in the context of sequence homology helping resolve the mechanisms underlying their formation. Availability and implementation SVbyEye is available at https://github.com/daewoooo/SVbyEye.</span></p>
<p dir="auto">Author: David Porubsky</p><p>Address of the bookmark: <a href="https://github.com/daewoooo/SVbyEye" rel="nofollow">https://github.com/daewoooo/SVbyEye</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39244/chromomap-an-r-package-for-interactive-visualization-and-annotation-of-chromosomes</guid>
	<pubDate>Fri, 12 Apr 2019 05:30:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39244/chromomap-an-r-package-for-interactive-visualization-and-annotation-of-chromosomes</link>
	<title><![CDATA[chromoMap-An R package for Interactive Visualization and Annotation of Chromosomes]]></title>
	<description><![CDATA[<p>Provides interactive, configurable and elegant graphics visualization of the chromosomes or chromosome regions of any living organism allowing users to map chromosome elements (like genes, SNPs etc.) on the chromosome plot. It introduces a special plot viz. the "chromosome heatmap" that, in addition to mapping elements, can visualize the data associated with chromosome elements (like gene expression) in the form of heat colors which can be highly advantageous in the scientific interpretations and research work. The package provide multiple features like visualizing multiple sets, chromosome heat-maps, group annotations, adding hyperlinks, and labelling. The plots can be saved as HTML documents that can be customized and shared easily. In addition, you can include them in R Markdown or in R 'Shiny' applications.</p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/chromoMap/vignettes/chromoMap.html" rel="nofollow">https://cran.r-project.org/web/packages/chromoMap/vignettes/chromoMap.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</guid>
	<pubDate>Wed, 12 Feb 2020 12:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</link>
	<title><![CDATA[netGO: R-Shiny package for network-integrated pathway enrichment analysis]]></title>
	<description><![CDATA[<p>netGO is an R/Shiny package for network-integrated pathway enrichment analysis.<br>netGO provides user-interactive visualization of enrichment analysis results and related networks.</p>
<p>Currently, netGO supports analysis for four species (<em><a href="https://github.com/unistbig/netGO-Data/tree/master/Human">Human</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Mouse">Mouse</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Arabidopsis">Arabidopsis thaliana</a>,and&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Yeast">Yeast</a></em>)<br>These data are available from&nbsp;<a href="https://github.com/unistbig/netGO-Data">netGO-Data</a>&nbsp;repository.</p>
<p><a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635</a></p><p>Address of the bookmark: <a href="https://github.com/unistbig/netGO" rel="nofollow">https://github.com/unistbig/netGO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</guid>
	<pubDate>Mon, 09 Nov 2020 02:56:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</link>
	<title><![CDATA[Platypus – R package for object detection and image segmentation.]]></title>
	<description><![CDATA[<p><a href="https://github.com/maju116/platypus" target="_blank">platypus</a>&nbsp;is an R package for object detection and semantic segmentation. Currently using&nbsp;</p>
<div>platypus&nbsp;you can perform:</div>
<ul>
<li>multi-class semantic segmentation using&nbsp;U-Net&nbsp;architecture</li>
<li>multi-class object detection using&nbsp;YOLOv3&nbsp;architecture</li>
</ul>
<p>You can install the latest version of&nbsp;platypus&nbsp;with&nbsp;remotes&nbsp;package:</p>
<div>
<div>
<div>
<div>remotes::install_github("maju116/platypus")</div>
</div>
</div>
</div>
<p>Note that in order to install&nbsp;platypus&nbsp;you need to install&nbsp;keras&nbsp;and&nbsp;tensorflow&nbsp;packages and&nbsp;Tensorflow&nbsp;version&nbsp;&gt;= 2.0.0&nbsp;(&nbsp;Tensorflow 1.x&nbsp;will not be supported!)</p><p>Address of the bookmark: <a href="https://github.com/maju116/platypus" rel="nofollow">https://github.com/maju116/platypus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43815/kebabs-package-provides-functionality-for-kernel-based-analysis-of-biological-sequences-via-support-vector-machine-svm-based-methods</guid>
	<pubDate>Fri, 04 Mar 2022 00:14:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43815/kebabs-package-provides-functionality-for-kernel-based-analysis-of-biological-sequences-via-support-vector-machine-svm-based-methods</link>
	<title><![CDATA[kebabs: package provides functionality for kernel based analysis of biological sequences via Support Vector Machine (SVM) based methods]]></title>
	<description><![CDATA[<p><span>The&nbsp;</span><tt>kebabs</tt><span>&nbsp;package provides functionality for kernel based analysis of biological sequences via Support Vector Machine (SVM) based methods. Biological sequences include DNA, RNA, and amino acid (AA) sequences. Sequence kernels define similarity measures between sequences. The package implements some of the most important kernels for sequence analysis in a very flexible and efficient way and extends the standard position-independent functionality of these kernels in a novel way to take the position of patterns in the sequences into account for the similarity measure.</span></p>
<p>http://www.bioinf.jku.at/software/kebabs/</p>
<p>http://bioconductor.org/packages/release/bioc/vignettes/kebabs/inst/doc/kebabs.pdf</p><p>Address of the bookmark: <a href="http://www.bioinf.jku.at/software/kebabs/" rel="nofollow">http://www.bioinf.jku.at/software/kebabs/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</guid>
	<pubDate>Sat, 25 Aug 2018 11:32:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</link>
	<title><![CDATA[Parallel Processing with Perl !]]></title>
	<description><![CDATA[<p>Here is a small tutorial on how to make best use of multiple processors for bioinformatics analysis. One best way is using perl threads and forks. Knowing how these threads and forks work is very important before implementing them. Getting to know how these work would be really useful before reading this tutorial.</p><p>Many times in bioinformatics we need to deal with huge datasets which&nbsp; are more than 100GB size. The traditional way to analysis a file is using the while loop</p><p>while (FILE){</p><p>Do something;</p><p>}</p><p>This is very slow(since we are using only one processor) and if we have 500 million lines in the dataset it takes more than a day to iterate through the whole dataset. So how do we make best use of all our processors and get the work done quickly?</p><p>Here is a very simple and efficient technique with perl which i have been using. I am&nbsp; more inclined towards using perl fork than perl threads.</p><p>One of the oldest way to fork is</p><blockquote><p>my $fork = fork();<br />if($fork){&nbsp;&nbsp;&nbsp;<br />push (@childs,$fork);&nbsp;<br />}<br />elseif($fork==0){<br /><strong>your code here;</strong><br />exit(0);<br />}<br />else{die &ldquo;Couldnt fork : $!&rdquo;;}</p><p>## wait for the child process to finish<br />foreach(@childs){<br />my $tmp=waitid($_,0);<br />}</p></blockquote><p>what a fork does is it creates a child process and takes the variables and code with it to analyze it separately (detached from the parent process) and thus a separate process is created( which usually runs on a separate processor). Thats it!! One big disadvantage of forking is its very difficult to share variables among the different processes. I will show you how to do it easily but still it has its own drawbacks.</p><blockquote><p>Okie, now if you really do not want to use fork in your code, that&rsquo;s okie too..There are many useful modules which do it for you very efficiently. One really useful module is Parallel::ForkManager. You can use Parallel::ForkManager to manage the number of forks you want to generate (number of processors you want to use).</p><p><strong>Simple usage:</strong><br />use Parallel::ForkManager;<br />my $max_processors=8;<br />my $fork= new Parallel::ForkManager($max_processors);<br />foreach (@dna) {<br />$fork-&gt;start and next; # do the fork<br /><strong>you code here;</strong><br />$fork-&gt;finish; # do the exit in the child process<br />}<br />$pm-&gt;wait_all_children;</p></blockquote><p>so you will be generating 8 forks which do the same thing for your each element of array. when one child finishes, Parallel::ForkManager generates a new one and thus you will be using all your processors to analyze the data. Now, if you have generated 8 child processes and want to write the data to one file. You need to lock the file to do this, because you will have problems with the buffering. You can lock the file using flock command.</p><blockquote><p>open (my $QUAL, &ldquo;myfile.txt&rdquo;);<br />flock $QUAL, LOCK_EX or die &ldquo;cant lock file $!&rdquo;;<br />print $QUAL &ldquo;$output&rdquo;;<br />flock $QUAL, LOCK_UN or die &ldquo;$!&rdquo;;<br />close $QUAL;</p></blockquote><p>I would not suggest using flock when dealing with multiple processes because it will decrease the processing efficiency( each child process must wait for the lock to be released by the other child process). Instead, I would suggest each fork writing to a separate file and after the processing just concatenating them.</p><p><strong>Putting it all together, If you have 100GB data you can do this</strong></p><blockquote><p><strong>step 1</strong>&nbsp;: split the dataset equally according to number of processors you have. this may take a few hours(about 2-3 hrs for 100GB file)<br />You can use unix &ldquo;split&rdquo; command for this<br />for example:<br />my $number_split=int($number_of_entries_in_your_dataset/$max_processors);<br />my $split_Files=`split -l $number_split &ldquo;your_file.fasta&rdquo; &ldquo;file_name&rdquo;`;</p><p><strong>step2</strong>: open you directory comtaining you split files and start Parallel::ForkManager.<br /><strong>For example:</strong><br />opendir(DIRECTORY, $split_files_directory) or die $!; ### open the directory<br />my $fork= new Parallel::ForkManager($max_processors);<br />while (my $file = readdir(DIRECTORY)) { ### read the directory<br />if($file=~/^\./){next;}<br />print $file,&rdquo;\n&rdquo;;<br />########## Start fork ##########<br />my $pid= $super_fork-&gt;start and next;<br /><strong>Whatever you want to do with the split file ;</strong><br /><strong>analyze my piece of $file;</strong><br />######### end fork ###############<br />$super_fork-&gt;finish;<br />}<br />$super_fork-&gt;wait_all_children;</p></blockquote><p>So basically each processor will be active with its piece of data (split file) and thus you have created 8 processes at one time which run without interfering with the other process. I again will not suggest writing output from each child process to one file(for reasons above). Write output from each fork to a separate file and finally concatenate them. Thats it, you have just increased your program speed by 8 times!! Isnt it easy?</p><p><strong>Note:</strong><br />You may worry about concatenation of the output each child generates, since it does take some time(remember 100GB). I think now you can use a mysql database LOAD DATA LOCAL INFILE command to load all the files into a single table(Should take about 3hrs for 100Gb dataset) and then export the whole table into one file. This should be faster than just concatenating them using &ldquo;cat&rdquo; command.(correct me if I am wrong)</p><p>Or much simpler way is to use pipes</p><p>cat output_dir/* | my_pipe or my_pipe &lt;(file1) final_file;</p><p>Thats it guys!! Enjoy programming and please do comment. I am not a computer scientist so forgive me for any mistakes and if any please report them. Thank you.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</guid>
	<pubDate>Thu, 10 Oct 2013 11:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</link>
	<title><![CDATA[The anatomy of successful computational biology software]]></title>
	<description><![CDATA[<p>Creators of software widely used in computational biology discuss the factors that contributed to their success</p><p><em>Nature Biotechnology</em><span>&nbsp;spoke with Altschul and several other originators of computational biology software programs widely used today (</span><a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html#t1">Table 1</a><span>). The conversations explored what makes certain software tools successful, the unique challenges of developing them for biological research and how the field of computational biology, as a whole, can move research agendas forward. What follows is an edited compilation of interviews.</span></p><p>Detail @&nbsp;<a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html">http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html</a></p><p>News Source @ Nature</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>