<?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/44487?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/44487?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39917/chromomap-an-r-package-for-interactive-visualization-and-annotation-of-chromosomes</guid>
	<pubDate>Sat, 07 Sep 2019 10:45:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39917/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><code>chromoMap</code>&nbsp;provides interactive, configurable and elegant graphics visualization of chromosomes or chromosomal regions allowing users to map chromosome elements (like genes,SNPs etc.) on the chromosome plot.Each chromosome is composed of loci(representing a specific range determined based on chromosome length) that, on hover, shows details about the annotations in that locus range. The plots can be saved as HTML documents that can be shared easily. In addition, you can include them in R Markdown or in R Shiny applications.</p>
<p>Some of the prominent features of the package are:</p>
<ul>
<li>visualizing polyploidy simultaneously on the same plot.</li>
<li>annotating groups of elements as distinct colors.</li>
<li>creating chromosome heatmaps.</li>
<li>adjusting chromosome range or visualizing chromosome regions such as genes</li>
<li>adding labels to the plot</li>
<li>adding hyperlinks to each element</li>
</ul><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>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40085/github-replacement</guid>
	<pubDate>Thu, 26 Sep 2019 03:42:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40085/github-replacement</link>
	<title><![CDATA[Github replacement !]]></title>
	<description><![CDATA[<p><span>For a number of reasons researchers have been trying out&nbsp;</span><a href="https://www.noamross.net/2019/09/24/drake-docker-and-gitlab-ci/gitlab.com" target="_blank">GitLab</a><span>&nbsp;as a replacement&nbsp;</span><span>for for both GitHub and various continuous integration systems, and have&nbsp;</span><span>been exploring configurations useful for model-fitting pipelines. Researchers turned&nbsp;</span><span>one of these into an&nbsp;</span><a href="https://gitlab.com/ecohealthalliance/drake-gitlab-docker-example" target="_blank">example repository</a><span>&nbsp;that shows how to use GitLab together&nbsp;</span><span>with the&nbsp;</span><a href="https://www.rocker-project.org/" target="_blank">Rocker</a><span>&nbsp;Docker images and the&nbsp;</span><a href="https://docs.ropensci.org/drake/" target="_blank"><strong>drake</strong></a><span>&nbsp;build system to reproducibly run a project pipeline, using the cacheing functionality across all three tools to&nbsp;</span><span>make things reasonably speedy and enable both local and remote builds. </span></p><p><span>Check it out&nbsp;</span><span>at&nbsp;</span><a href="https://gitlab.com/ecohealthalliance/drake-gitlab-docker-example" target="_blank">https://gitlab.com/ecohealthalliance/drake-gitlab-docker-example</a><span>.</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/40770/scientist-bioinformatics-positions</guid>
  <pubDate>Thu, 30 Jan 2020 06:53:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist Bioinformatics Positions]]></title>
  <description><![CDATA[
<p>Bioinformatics-Multi_Omics_Integration</p>

<p>https://www.researchgate.net/job/939073_Senior_Scientist_Bioinformatics-Multi_Omics_Integration</p>

<p> <br />Senior_Scientist_Bioinformatics-Transcriptomics_Analysis     </p>

<p>https://www.researchgate.net/job/939075_Senior_Scientist_Bioinformatics-Transcriptomics_Analysis-Belgium_France_Switzerland_The_Netherlands</p>

<p>Senior Scientist Bioinformatics - Network Analytics</p>

<p>https://www.researchgate.net/job/939070_Senior_Scientist_Bioinformatics-Network_Analytics_Belgium_France_Switzerland_the_Netherlands</p>

<p>Team Leader Bioinformatics Data Sciences - Mechelen, Belgium</p>

<p>https://www.researchgate.net/job/938787_Team_Leader_Bioinformatics_Data_Sciences-Mechelen_Belgium</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</guid>
	<pubDate>Fri, 27 Mar 2020 12:11:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/41496/new-machine-learning-packages-in-r</link>
	<title><![CDATA[New Machine Learning Packages in R]]></title>
	<description><![CDATA[<h3 id="machine-learning">Machine Learning</h3><p><a href="https://cran.r-project.org/package=autokeras">autokeras</a>&nbsp;v1.0.1: Implements an interface to&nbsp;<a href="https://autokeras.com/">AutoKeras</a>, an open source software library for automated machine learning. See&nbsp;<a href="https://cran.r-project.org/web/packages/autokeras/readme/README.html">README</a>&nbsp;for an example.</p><p><a href="https://cran.r-project.org/package=MTPS">MTPS</a>&nbsp;v0.1.9: Implements functions to predict simultaneous multiple outcomes based on revised stacking algorithms as described in&nbsp;<a href="denied:doi:10.1093/bioinformatics/btz531">Xing et al. (2019)</a>. See the&nbsp;<a href="https://cran.r-project.org/web/packages/MTPS/vignettes/Guide.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=quanteda.textmodels">quanteda.textmodels</a>&nbsp;v0.9.1: Implements methods for scaling models and classifiers based on sparse matrix objects representing textual data. It includes implementations of the&nbsp;<a href="denied:doi:10.1017/S0003055403000698">Laver et al. (2003)</a>&nbsp;wordscores model, the&nbsp;<a href="denied:arxiv:1710.08963">Perry &amp; Benoit&rsquo;s (2017)</a>&nbsp;class affinity scaling model, and the&nbsp;<a href="denied:doi:10.1111/j.1540-5907.2008.00338.x">Slapin &amp; Proksch (2008)</a>&nbsp;wordfish model. See the&nbsp;<a href="https://cran.r-project.org/web/packages/quanteda.textmodels/vignettes/textmodel_performance.html">vignette</a>&nbsp;to get started.</p><p><a href="https://cran.r-project.org/package=SeqDetect">SeqDetect</a>&nbsp;v1.0.7: Implements the automaton model found in&nbsp;<a href="https://ieeexplore.ieee.org/document/8910574">Krleža, Vrdoljak &amp; Brčić (2019)</a>&nbsp;to detect and process sequences. See the&nbsp;<a href="https://cran.r-project.org/web/packages/SeqDetect/vignettes/SequentialDetector.pdf">vignette</a>&nbsp;for examples and theory.</p><p><a href="https://cran.r-project.org/package=studyStrap">studyStrap</a>&nbsp;v1.0.0: Implements multi-Study Learning algorithms such as Merging, Study-Specific Ensembling (Trained-on-Observed-Studies Ensemble), the Study Strap, and the Covariate-Matched Study Strap. and offers over 20 similarity measures. See&nbsp;<a href="denied:doi:10.1101/856385">Kishida, et al. (2019)</a>&nbsp;for background and the&nbsp;<a href="https://cran.r-project.org/web/packages/studyStrap/vignettes/vignette.html">vignette</a>&nbsp;for how to use the package.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</guid>
	<pubDate>Fri, 01 Apr 2022 19:05:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</link>
	<title><![CDATA[R Shiny in Life Sciences – Top 7 Dashboard Examples]]></title>
	<description><![CDATA[<p><span>&nbsp;R Shiny is one of the easiest ways for developers to make production-ready dashboards when speed and functionality are crucial. Shiny is approachable with a lot of documentation available, and because of this, a lot of developers/researchers with non-coding backgrounds are able to produce some impressive results. The whole ecosystem is easy to get your head around and pretty much limitless with regard to what you can do.</span></p><p>Address of the bookmark: <a href="https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/" rel="nofollow">https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27344/orffinder-with-smart-blast</guid>
	<pubDate>Tue, 17 May 2016 01:43:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27344/orffinder-with-smart-blast</link>
	<title><![CDATA[ORFfinder with smart BLAST]]></title>
	<description><![CDATA[<p><span>ORF Finder</span></p><p><span><a href="http://www.ncbi.nlm.nih.gov/orffinder">ORFfinder</a><span>&nbsp;is a graphical analysis tool for finding open reading frames (ORFs). We&rsquo;ve been working on a few updates, and we&rsquo;d like to find out what you think about them. Read on to find out what you can do with the new ORFfinder.</span></span></p><p>Smart BLAST (https://ncbiinsights.ncbi.nlm.nih.gov/2015/07/29/smartblast/)</p><p>Select one or a group of ORFs and BLAST several databases at once, and use the newly developed&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/smartblast/">SmartBLAST</a>&nbsp;to verify protein names.&nbsp;Looking for the traditional results from&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/Blast.cgi">BLAST</a>? They&rsquo;re there too.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</guid>
	<pubDate>Mon, 13 Jun 2016 05:47:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</link>
	<title><![CDATA[BBMap/BBTools package: Multipurpose tool designed for converting reads or other nucleotide data between different formats.]]></title>
	<description><![CDATA[<div id="post_message_148585"><a href="https://sourceforge.net/projects/bbmap/" target="_blank">Reformat</a>is a member of the <a href="https://sourceforge.net/projects/bbmap/" target="_blank">BBMap/BBTools package</a>. It is a multipurpose tool designed for converting reads or other nucleotide data between different formats. It supports, and can inter-convert:<br /> <br /> fastq<br /> fasta<br /> fasta+qual<br /> sam<br /> scarf (an old Illumina format)<br /> bam (if samtools is installed)<br /> gzip<br /> zip<br /> ascii-33 (sanger)<br /> ascii-64 (old Illumina)<br /> paired files<br /> interleaved files<br /> <br /> It is multithreaded and can process data at over 500 megabytes per second, and can accept streams from standard in and write to standard out, allowing it to be easily dropped into the middle of a pipeline for format conversion. Reformat autodetects formats based on file extensions and content, making it very easy to use; and the autodetection can be overridden, allowing flexibility for people who don't like to follow naming conventions, or out-of-spec fastq files with qualities values like -17 or 120.<br /> <br /> The program has been gradually expanded, and can now perform various other functions. None of these will break pairing, if the input is paired.<br /> <br /> Quality trimming (either or both ends)<br /> Quality filtering<br /> Fixed-length trimming<br /> Generation of histograms (base composition, quality, etc)<br /> Subsampling (to a fraction of input reads, or an exact number of reads or bases)<br /> Changing fasta line-wrapping length<br /> Reverse-complementing (all reads or only read 2)<br /> Adding /1 and /2 suffix to read names<br /> GC-content filtering<br /> Length-filtering<br /> Testing for corrupted interleaved files<br /> <br /> Reformat is compatible with any platform that supports Java 1.7 or higher. It also has a bash shellscript for simpler invocation. Typical usage examples:<br /> <br /> Reformat fastq into fasta:<br /> <strong>reformat.sh in=x.fq out=y.fa</strong><br /> <br /> Interleave paired reads:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out=y.fq</strong><br /> <br /> Note - you can actually use a shortcut if paired read files have the same name with a 1 and a 2. This is equivalent to the above command:<br /> <strong>reformat.sh in=x#.fq out=y.fq</strong><br /> <br /> De-interleave reads:<br /> <strong>reformat.sh in=x.fq out1=y1.fq out2=y2.fq</strong><br /> <br /> Verify that interleaving appears correct, assuming Illumina namimg conventions:<br /> <strong>reformat.sh in=x.fq vint</strong><br /> <br /> Convert ASCII-33 to ASCII-64:<br /> <strong>reformat.sh in=x.fq out=y.fq qin=33 qout=64</strong><br /> <br /> Quality-trim paired reads to Q10 on the left and right ends and discard reads shorter than 50bp after trimming:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out1=y1.fq out2=y2.fq outsingle=singletons.fq qtrim=rl trimq=10 minlength=50</strong><br /> <br /> Subsample 10% of the first 20000 pairs in an interleaved file:<br /> <strong>reformat.sh in=x.fq out=y.fq reads=20000 samplerate=0.1 int=t</strong><br /> (in this case "int=t" overrides interleaving autodetection, to ensure reads are treated as pairs)<br /> <br /> Pipe in a gzipped sam file and pipe out fasta:<br /> <strong>reformat.sh in=stdin.sam.gz out=stdout.fa</strong><br /> <br /> Reverse-complement reads:<br /> <strong>reformat.sh in=x.fq out=y.fq rcomp</strong><br /> <br /> For reformatting a file with very long sequences, Reformat will need more memory; just add the additional flag "-Xmx2g". For example, to change the line-wrapping length on the human genome (which has individual sequences over 200Mbp long) to 70 characters:<br /> <strong>reformat.sh -Xmx2g in=HG19.fa.gz out=HG19_wrapped.fa.gz fastawrap=70</strong><br /> <br /> For additional functions, please run the shellscript with no arguments, or just read it with a text editor. If you have any questions, please post them in this thread.<br /> <br /> For people using a non-bash terminal, you may need to type "bash reformat.sh" instead of just "reformat.sh".<br /> For users of Windows or other platforms that do not support bash shellscripts, replace "reformat.sh" with "java -ea -Xmx200m /path/to/bbmap/current/ jgi.ReformatReads"<br /> for example,<br /> <strong>java -ea -Xmx200m C:\bbmap\current\ jgi.ReformatReads in=x.fq out=y.fa</strong><br /> <br /> Reformat can be downloaded with BBTools here:<br /> <a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>