<?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/32633?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/32633?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</guid>
	<pubDate>Tue, 19 Jul 2016 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</link>
	<title><![CDATA[Aravind J Shankar gets all India rank 1 in BINC, 2016]]></title>
	<description><![CDATA[<p>Aravind J Shankar, a bioinformatics graduate of SASTRA University, has secured the all India rank 1 in the Bioinformatics National Certification (BINC) 2016, organised by the Department of Biotechnology, Government of India.</p><p>The BINC is a nationwide examination aimed at certifying professionals in bioinformatics and tests their theoretical and practical knowledge across three phases of examination. He is entitled to receive a DBT research fellowship leading to a Ph.D. from any premier research institute in India.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28563/find-predicted-crispr-sites-using-ensembl</guid>
	<pubDate>Wed, 27 Jul 2016 03:15:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28563/find-predicted-crispr-sites-using-ensembl</link>
	<title><![CDATA[Find predicted CRISPR sites using Ensembl]]></title>
	<description><![CDATA[<p>Did you know that you can now use Ensembl to help design your CRISPR experiments? Just turn on the brand new track that shows you the CRISPR sites that have been predicted by the WGE group (<a href="http://www.sanger.ac.uk/science/tools/wge" target="_blank">http://www.sanger.ac.uk/science/tools/wge</a>)</p><p><img src="http://www.ensembl.info/wp-content/uploads/2016/07/Screen-Shot-2016-07-22-at-13.04.33.png" width="1400" height="544" alt="image" style="border: 0px;"></p><p>Find out more on our blog:<br /><a href="http://www.ensembl.info/blog/2016/07/26/find-predicted-crispr-sites-using-ensembl/" target="_blank">http://www.ensembl.info/&hellip;/find-predicted-crispr-sites-usin&hellip;/</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:44:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</link>
	<title><![CDATA[Qualimap2: Evaluating next generation sequencing alignment data]]></title>
	<description><![CDATA[<p><strong>Qualimap 2</strong><span>&nbsp;is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.&nbsp;</span><br><br><span>Supported types of experiments include:</span></p>
<ul>
<li>Whole-genome sequencing</li>
<li>Whole-exome sequencing</li>
<li>RNA-seq (speical mode available)</li>
<li>ChIP-seq</li>
</ul><p>Address of the bookmark: <a href="http://qualimap.bioinfo.cipf.es/" rel="nofollow">http://qualimap.bioinfo.cipf.es/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28818/senior-manager-bioinformatics-operations-at-rgcb-india</guid>
  <pubDate>Wed, 17 Aug 2016 03:19:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Manager (Bioinformatics Operations) at RGCB, India]]></title>
  <description><![CDATA[
<p>No. RGCB/ADVT/ADMN&amp;TECH/01/2016</p>

<p>August 17, 2016</p>

<p>RGCB invites applications for the following positions from Indian citizens with prescribed qualifications. Full details including job description, additional desirable qualifications, etc. are described below.</p>

<p>Code No. 1</p>

<p>Senior Manager (Bioinformatics Operations)</p>

<p>(To download application format, click here )</p>

<p>Scale of Pay</p>

<p>PB-3 Rs.15600-39100 + Grade Pay Rs.6600/-</p>

<p>Number of Positions</p>

<p>1 (General)</p>

<p>Minimum Qualifications</p>

<p>PhD in Bioinformatics, Biotechnology, Life Sciences or Computer Science applied to biological questions.<br />A minimum of 5 years documented experience in national or state government R&amp;D centers or state and central universities.<br />Track record of research funding and peer reviewed publications.<br />Proficiency using statistical analysis software or libraries such as R or Matlab.<br />Experience with a general scripting language such as Python, Ruby, or Pearl<br />Experience working with Next Generation Sequencing data<br />Proficiency with data visualization tools (Spotfire, Tableau, R, Python, etc.)<br />Experience with an object-oriented language such as Java, C++ or C# and familiarity with standard software development best practices: source code control, unit testing, in-code documentation and automated build environments.<br />Excellent listening, time management, organizational and interpersonal skills<br />Excellent communication skills, including the ability to illustrate problems and generate solutions<br />Management skills – demonstrated through the successful management of a team or large projects.<br />Broad and deep knowledge of computational methods for high-throughput sequence analysis and interpretation.<br />Extensive experience in delivering bioinformatics as a service and conducting training programs.<br />Experience of working with a production, customer-focused environment and business development projects.<br />Experience with management of funding and financial sustainability.<br />Demonstrated ability to work in a team environment and ability to lead and motivate an effective team, and also work as a good team player.<br />Good problem solver, able to logically identify solutions to technical problems.<br />Able to see the bigger picture and contribute towards strategic direction of Platforms and Pipelines teams.<br />Responsibilities</p>

<p>This position will involve cross-functional teamwork to build and develop bioinformatics tools and provide analysis for ongoing clinical trials.<br />Collaborate with biomarker scientists, clinical investigators and pipeline teams to build analytical tools.<br />Implement and evaluate new algorithms for R&amp;D.<br />Support Research and Development teams by analyzing NGS data to identify predictive response markers<br />Lead training programs in Computational Biology and Bioinformatics.</p>

<p>More at http://rgcb.res.in/positions.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</guid>
	<pubDate>Mon, 12 Aug 2019 07:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</link>
	<title><![CDATA[Cactus: a reference-free whole-genome multiple alignment program]]></title>
	<description><![CDATA[<p>Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here:&nbsp;<a href="https://doi.org/10.1101/gr.123356.111">https://doi.org/10.1101/gr.123356.111</a></p>
<p><span>Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.</span>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/ComparativeGenomicsToolkit/cactus" rel="nofollow">https://github.com/ComparativeGenomicsToolkit/cactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</guid>
	<pubDate>Tue, 06 Sep 2016 03:58:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</link>
	<title><![CDATA[Genome STRiP]]></title>
	<description><![CDATA[<p><strong>Genome STRiP</strong><span>&nbsp;(Genome STRucture In Populations) is a suite of tools for discovering and genotyping structural variations using sequencing data. The methods are designed to detect shared variation using data from multiple individuals.</span><br><br><span>Genome STRiP looks both across and within a set of sequenced genomes to detect variation. The methods are adaptive and support heterogeneous data sets, including variations in sequencing depth, read lengths and mixtures of paired and single-end reads. A minimum of 20 to 30 genomes are required to get acceptable results, but the method gains power across genomes and processing more genomes provide better results.</span><br><br><span>To run discovery or genotyping on a single sequenced genome or a small set of genomes, you need to call your data against a background population, such as a set of genomes from the 1000 Genomes Project.&nbsp; The background population does not need to be matched to the target individuals.</span></p><p>Address of the bookmark: <a href="http://software.broadinstitute.org/software/genomestrip/" rel="nofollow">http://software.broadinstitute.org/software/genomestrip/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</guid>
	<pubDate>Sun, 28 Jun 2020 10:17:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</link>
	<title><![CDATA[The wavefront alignment (WFA) algorithm]]></title>
	<description><![CDATA[<p><span>The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of</span><br><span>homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.</span></p><p>Address of the bookmark: <a href="https://github.com/smarco/WFA" rel="nofollow">https://github.com/smarco/WFA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29017/walk-in-interview-jipmer</guid>
  <pubDate>Mon, 05 Sep 2016 04:01:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[WALK-IN INTERVIEW @ JIPMER]]></title>
  <description><![CDATA[
<p>Department of Preventive and Social Medicine<br />, JIPMER, Puducherry –605006</p>

<p>WALK-IN INTERVIEW</p>

<p>JIP/PSM/INDO-US TB/ 2016/</p>

<p>Walk-in-interview for the following vacant posts funded by Department of Biotechnology, Govt.of India for the project entitled “Biomarkers for Risk of Tuberculosis and for Tuberculosis Treatment Failure and Relapse” in the Department of Preventive &amp; Social Medicine, JIPMER, Puducherry.</p>

<p>3. Technical Assistant</p>

<p>MCA/ MSc in Biostatistics/ MSc in Computational Biology from any recognized University @ Rs.23,220 1</p>

<p>Interested candidates may attend the walk-in interview with written screening test on 07, September 2016 at 9.30 A.M in the Dept. of Preventive and Social Medicine, IV Floor, Administrative Block, JIPMER.</p>

<p>The applicants are requested to bring the filled in application form and bio-data with original certificates for verification.</p>

<p>More Info: http://jipmer.edu.in/wp-content/uploads/2016/09/RECRUITEMENTsite-protocol-7.9.2016.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</guid>
	<pubDate>Thu, 04 Apr 2024 01:44:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</link>
	<title><![CDATA[A web-based tool for sequence alignment statistics and innovative visualization]]></title>
	<description><![CDATA[<p>AlignStatPlot, a new R package and online tool that is well-documented and easy-to usefor MSA and post-MSA analysis. This tool performs both traditional and cutting-edge analy-ses on sequencing data and generates new visualisation methods for MSA results. Whencompared to currently available tools, AlignStatPlot provides a robust ability to handle andvisualise diversity data, while the online version will save time and encourage researchersto focus on explaining their findings. It is a simple tool that can be used in conjunction withpopulation genetics software (PDF) AlignStatPlot: An R package and online tool for robust sequence alignment statistics and innovative visualization of big data.</p><p>Address of the bookmark: <a href="https://bioinformatics.um6p.ma/AlignStatPlot/" rel="nofollow">https://bioinformatics.um6p.ma/AlignStatPlot/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>