<?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/31881?offset=590</link>
	<atom:link href="https://bioinformaticsonline.com/related/31881?offset=590" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/22787/senior-technical-assistant-at-pondicherry-university</guid>
  <pubDate>Wed, 17 Jun 2015 20:46:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Technical Assistant at Pondicherry University]]></title>
  <description><![CDATA[
<p>Senior Technical Assistant</p>

<p>Eligibility : BE/B.Tech(CSE, ECE, IT)</p>

<p>Location : Pondicherry</p>

<p>Last Date : 26 Jun 2015</p>

<p>Hiring Process : Face to Face Interview<br />Pondicherry University - Job DetailsDate of posting:19 May 15</p>

<p>Senior Technical Assistant Job position in Pondicherry University on temporary basis  </p>

<p>Project Title : "Bioinformatics National Certification (BINC) for certifying quality human resource in Bioinformatics"</p>

<p>Qualification : i) B.E/ B.Tech Computer Science/ Electronics &amp; Communication Engineering/ Information Technology with 55% or equivalent marks. ii) One year Experience in relevant field in Government/ Public Sector or reputed Private Organizations. Desirable : Working experience in JSP and ASP/PHP</p>

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

<p>Department : Biotechnology</p>

<p>Pay : Rs. 27,800/- </p>

<p>Age Limit : 30 Yrs<br />How to apply</p>

<p>Both above-mentioned posts are purely on temporary basis, extended by one year based on performance and will be terminated with the completion of BINC Program at Pondicherry University. Interested Candidates may send their application in the prescribed format with self-attested copies of all mark sheets and certificates to Dr. Basant K. Tiwary, Coordinator (BINC), Centre for Bioinformatics, Pondicherry University, Puducherry-605 014 before June 26, 2015.</p>

<p>Click Here http://www.pondiuni.edu.in/news/requirement-post-one-senior-technical-assistant-one-computer-assistant-–-dept-biotechnologygove</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/22920/how-long-have-you-been-a-bioinformatics-scientist-for</guid>
	<pubDate>Tue, 23 Jun 2015 10:55:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/22920/how-long-have-you-been-a-bioinformatics-scientist-for</link>
	<title><![CDATA[How long have you been a bioinformatics scientist for?]]></title>
	<description><![CDATA[<p>Most of the researcher have been a scientist whole life, but infact they actually started paying&nbsp; it with at certain time.So, how long have you been in bioinformatics domain now?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22966/ra-bioinformatics-at-icged</guid>
  <pubDate>Sun, 28 Jun 2015 12:24:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at ICGED]]></title>
  <description><![CDATA[
<p>Research Associate Position at ICGEB, New Delhi with Dr. Amit Sharma</p>

<p>Starting 15th July 2015, the position relates to a project specifically for in silico drug docking, screening, design, optimisation and linkage with active chemists. </p>

<p>Experience in many docking softwares and operating systems is essential. </p>

<p>Additional experience in bioinformatics and computational biology tools will be useful. </p>

<p>Submit curriculum vitae to: sb.icgeb@gmail.com</p>

<p>Closing date: 5 July 2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/23160/opencpu</guid>
	<pubDate>Sun, 05 Jul 2015 18:34:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/23160/opencpu</link>
	<title><![CDATA[OpenCPU]]></title>
	<description><![CDATA[<p>OpenCPU is a system for embedded scientific computing and reproducible research. The OpenCPU server provides a reliable and interoperable <a href="https://www.opencpu.org/api.html">HTTP API</a> for data analysis based on R.</p><p>The OpenCPU <a href="https://www.opencpu.org/jslib.html">JavaScript client library</a> provides the most seamless integration of R and JavaScript available today.</p><p>OpenCPU uses standard R packaging to develop, ship and deploy web applications. Several open source <a href="https://www.opencpu.org/apps.html">example apps</a> are available from Github.</p><p>Installing your own OpenCPU server is <a href="https://www.opencpu.org/download.html">super easy</a> and only takes a few minutes.</p><p>More at https://www.opencpu.org/</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</guid>
	<pubDate>Mon, 09 Jul 2018 05:27:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</link>
	<title><![CDATA[Epiviz: an interactive visualization tool for functional genomics data.]]></title>
	<description><![CDATA[<p><span>Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other user-supplied visualizations. It also includes data from the&nbsp;</span><a href="http://barcode.luhs.org/" target="_blank">Gene Expression Barcode project</a><span>&nbsp;for transcriptome visualization. It has a flexible plugin framework so users can add</span><a href="http://d3js.org/" target="_blank">d3</a><span>&nbsp;visualizations. You can see a video tour&nbsp;</span><a href="http://youtu.be/099c4wUxozA" target="_blank">here</a><span>.</span></p>
<p><span>https://bioconductor.org/packages/release/bioc/html/epivizr.html</span></p>
<p><span>https://github.com/epiviz</span></p>
<p><span>https://github.com/epiviz/epiviz</span></p><p>Address of the bookmark: <a href="https://epiviz.github.io/" rel="nofollow">https://epiviz.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24042/research-associate-bioinformatician-university-of-bristol</guid>
  <pubDate>Wed, 26 Aug 2015 05:46:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatician @ University of Bristol]]></title>
  <description><![CDATA[
<p>This 0.5 fte role will have specific responsibility for the bioinformatic side of a Health Innovation Challenged Fund (HICF) research project investigating the application of Next Generation Sequencing (NGS) technologies to the analysis of Minimal Residual Disease (MRD) in childhood Acute Lymphoblastic Leukaemia (ALL). The successful candidate will be responsible for designing and implementing an analysis pipeline primarily to fit with the clinical need, but with the capacity to answer innovative research questions.</p>

<p>For informal enquiries please contact Anne Walsh via email: anne.walsh@bristol.ac.uk.</p>

<p>Apply at http://www.bris.ac.uk/jobs/find/details.html?nPostingID=3639&amp;nPostingTargetID=13346&amp;option=28&amp;sort=DESC&amp;respnr=1&amp;ID=Q50FK026203F3VBQBV7V77V83&amp;JobNum=ACAD101624&amp;Resultsperpage=10&amp;lg=UK&amp;mask=uobext</p>
]]></description>
</item>

</channel>
</rss>