<?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/30701?offset=1520</link>
	<atom:link href="https://bioinformaticsonline.com/related/30701?offset=1520" 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/opportunity/view/25815/jrf-bioinformatics-job-position-in-university-of-hyderabad</guid>
  <pubDate>Tue, 29 Dec 2015 01:00:18 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics job position in University of Hyderabad]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics</p>

<p>Eligibility : ME/M.Tech(Bio-Informatics/Bio-Chemistry Engg), MSc(Bio-Informatics)</p>

<p>Location : Hyderabad</p>

<p>Last Date : 30 Dec 2015</p>

<p>Hiring Process : Written-test<br />University of Hyderabad</p>

<p>JRF Bioinformatics job position in University of Hyderabad </p>

<p>Project Entitled : Programming protective humoral responses with novel vaccine formulations against Dengue Virus</p>

<p>Essential Qualifications : M. Sc. in Life Sciences/Bioinformatics/ or M. Tech in Bioinformatics with a minimum of 60% marks and with CSIR-UGC JRF/NET or valid GATE score are preferred. Desirable : Candidates should have six months to one year hands on experience in molecular biology techniques like gene cloning, protein expression and purification, hands on various nano-formulations for drug/vaccine delivery, immunological assays including animal handling, immunizations, T cells and B cell assays or Candidate should have strong background in Bioinformatics and computational Biology, good programming skill particularly proficiency in R/PERL/PYTHON. Candidates interested in above position should send a one page statement clearly explaining how their skills are relevant to the above said position. The candidates should also enclose detailed CV and the name/Email IDs of three references</p>

<p>Fellowship : Rs. 16,000 p.m. + 30% H.R.A. for the first two years (Revised DBT fellowship guidelines maybe applicable)</p>

<p>Duration : The appointment will be on temporary basis for a period of one year. Based on performance, the appointment could be extended till the end of project<br /> <br />How to apply</p>

<p>Submit your application (hardcopy) in a closed envelope to Dr.Nooruddin<br />Khan, Room S-66B,Department of Biotechnology and Bioinfromatics, School of Life Sciences, University of Hyderabad, Gachibowli, Hyderabad 500 046 or E mail: nklabsls@gmail.com. Last date for receipt of applications is on or before 30.12.2015</p>

<p>More at http://uohyd.ac.in/index.php/component/content/article/87-administration/recruitments/129</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/25993/hoffman-lab</guid>
  <pubDate>Tue, 12 Jan 2016 02:47:41 -0600</pubDate>
  <link></link>
  <title><![CDATA[Hoffman Lab]]></title>
  <description><![CDATA[
<p>They develop machine learning techniques to better understand chromatin biology. These models and algorithms transform high-dimensional functional genomics data into interpretable patterns and lead to new biological insight.</p>

<p>https://www.pmgenomics.ca/hoffmanlab/</p>
]]></description>
</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/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/opportunity/view/26335/ra-at-central-university-of-rajasthan</guid>
  <pubDate>Tue, 09 Feb 2016 03:53:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA at Central University of Rajasthan]]></title>
  <description><![CDATA[
<p>Research Fellow Bioinformatics</p>

<p>Eligibility : MSc(Bio-Chemistry, Bio-Informatics, Bio-Tech)</p>

<p>Location : Ajmer</p>

<p>Last Date : 13 Feb 2016</p>

<p>Hiring Process : Face to Face Interview<br />Central University of Rajasthan</p>

<p>Research Fellow Job vacancies in Central University of Rajasthan</p>

<p>Project Title : “Development of natural product derived febrifugine ananlogues as a novel therapeutics against visceral leishmaniasis”</p>

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

<p>Qualification : Master of Biochemistry, Biotechnology, Bioinformatics and related biological sciences with minimum 55%, Age limit as per government rule.</p>

<p>Desirable Experience : Candidates with experience in cell culture, Chemoinformatics, and Parasitology will be preferred.    </p>

<p>Fellowship : Rs. 25,000/- p.m. consolidated for NET qualified (14,000/- p.m. consolidated for Non-NET)<br />How to apply</p>

<p>The candidates may apply on a plain paper, along with their curriculum vitae (including name, date of birth, academic qualification starting from 10th class, summary of research experience, email id, phone number and passport size photograph) and email to vkprajapati@curaj.ac.in or post the hard copy to the Dr. Vijay Kumar Prajapati PI, DST-SERB Project (YSS/2015/000716), Department of Biochemistry, School of Life Sciences, Central University of Rajasthan, Bandarsindri, Dist- Ajmer, Rajasthan, 305 817 on or before 13th February 2016.</p>

<p>More at http://www.curaj.ac.in/Default.aspx?PageId=241</p>
]]></description>
</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/bookmarks/view/26375/ncbi-remap</guid>
	<pubDate>Thu, 11 Feb 2016 11:02:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26375/ncbi-remap</link>
	<title><![CDATA[NCBI Remap]]></title>
	<description><![CDATA[<p><span><span><strong>NCBI Remap</strong>. This tool is conceptually similar to liftOver in that in manages conversions between a pair of genome assemblies but it uses different methods to achieve these mappings. It is also available through a simple <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap">web interface</a> or you can use the <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap/docs/api">API for NCBI Remap</a>.</span></span></p>
<p><span><span>More at http://www.ncbi.nlm.nih.gov/genome/tools/remap</span></span></p>
<p><span><span>API http://www.ncbi.nlm.nih.gov/genome/tools/remap/docs/api</span></span></p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap" rel="nofollow">http://www.ncbi.nlm.nih.gov/genome/tools/remap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26391/radka-reifova-lab</guid>
  <pubDate>Mon, 15 Feb 2016 06:00:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[Radka Reifová Lab]]></title>
  <description><![CDATA[
<p>We are generally interested in the mechanisms of species origin from a molecular and ecological perspective. Particularly, we are interested in the role of sex chromosomes in speciation. Most of our research is done on birds and mammals. Currently, we focus our research on two hybridizing song birds, the Common nightingale (Luscinia megarhynchos) and the Thrush Nightingale (L. luscinia). Combining population genomic and ecological approaches we try to elucidate the genetic architecture of reproductive isolation and understand the role of interspecific competition and song convergence in the evolution of reproductive isolation between the species. </p>

<p>More at http://web.natur.cuni.cz/~radkas/index.php?page=research</p>
]]></description>
</item>

</channel>
</rss>