<?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=1250</link>
	<atom:link href="https://bioinformaticsonline.com/related/32633?offset=1250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28547/jrf-bioinformatics-at-iit-delhi</guid>
  <pubDate>Mon, 25 Jul 2016 03:26:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at IIT, Delhi]]></title>
  <description><![CDATA[
<p>No. IITD/IRD/RP03017/4254/Advertisement No.: IITD/IRD/093/2016<br />JRF Bioinformatics  job vacancies in Indian Institute of Technology Delhi (IIT Delhi)<br />Title : Elucidation of Pathologically Relevant miRNAs Responsible for Disease Progression and Resistance to Chemotherapy in Chronic Lymphocytic Leukemia (CLL) (RP03017)<br />Qualification : Candidates having first class B. Tech. / M.Sc. Degree or equivalent in Bioinformatics or Biotechnology with NET qualification. Desirable: Candidates having computer programming skills (C++, Python, Java, Web designing using Materialize frameworks, database management, offline software GUI development) with knowledge of Linux server environment and / or experience in next generation sequencing (NGS) data analysis, MD simulations will be preferred.<br />No. of Post : 01<br />Pay Scale : Rs.25,000/-<br />How to apply<br />Walk-in test / interview will be held on 04/08/2016, 03.00 p.m. at Committee Room No. 230, Block-I, Department of Biochemical Engineering &amp; Biotechnology, Indian Institute of Technology Delhi, Hauz Khas, New Delhi-110016.</p>

<p>More at http://ird.iitd.ac.in/sites/default/files/jobs/project/IITD-IRD-093-2016.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</guid>
	<pubDate>Fri, 24 Aug 2018 09:50:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</link>
	<title><![CDATA[Mulan: Multiple-sequence local alignment and visualization for studying function and evolution]]></title>
	<description><![CDATA[<p>Mulan: Multiple-sequence local alignment and visualization for studying function and evolution</p>
<p><span>Mulan (</span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/#ref44">http://mulan.dcode.org/</a><span>), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28566/emboss-apps</guid>
	<pubDate>Wed, 27 Jul 2016 06:00:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28566/emboss-apps</link>
	<title><![CDATA[EMBOSS Apps]]></title>
	<description><![CDATA[<p>The programs are listed in alphabetical order, Look at the individual applications or go to the&nbsp;<a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/groups.html">GROUPS</a>&nbsp;page to search by category.</p>
<p><a href="http://emboss.sourceforge.net/apps/release/6.6/embassy/index.html">EMBASSY applications</a>&nbsp;are described in separate documentation for each package.</p>
<h3><a name="current" id="current"></a>Applications&nbsp;in the&nbsp;<a href="ftp://emboss.open-bio.org/pub/EMBOSS/">current release</a></h3><p>Address of the bookmark: <a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/" rel="nofollow">http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28602/srf-and-jrf-bioinformatics-at-tezpur-university-napaam</guid>
  <pubDate>Wed, 03 Aug 2016 03:47:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF and JRF Bioinformatics at Tezpur University, Napaam]]></title>
  <description><![CDATA[
<p>Applications are invited for the following temporary positions unde MHRD sponsored Centre of Excellence<br />in the Department of Computer Science and Engineering (CSE), Tezpur University<br /> <br />Qualification<br />and Experience : Senior Research Fellow (SRF) and JRF : First Class in M.E/M.Tech in CSE/IT/ECE with research<br />experience in relevant fields of research (Candidates having valid GATE/NET Score would be preferred).</p>

<p> <br />Fellowship: Rs. 18,000/- per month (fixed)<br /> <br />Duration : 2 (Two) years and may be extended<br />depending on status of the project<br /> <br />Age Limit: Candidates should not be more than 32 years of<br />age in case of SRF and 28 years of age in case of JRF and TA. Upper age limit may be relaxed up to 5<br />years in the case of candidate belonging to SC/ ST/ OBC/ Women/ Differently abled.<br /> <br />How to Apply:<br />Interested candidates may send their application on plain paper by post along with his/her educational<br />qualifications, research experience certificates (for SRF), 02 copies of recent passport/stamp size photographs<br />and contact phone number to Professor D.K Bhattacharyya, Principal Investigator, Department of Computer<br />Science &amp; Engineering, Tezpur University, Napaam – 784 028, or mail it to dkb@tezu.ernet.in<br />(or to smh@tezu.ernet.in) within 15 days of publication of this advertisement.<br /> <br />No TA/DA shall<br />be paid for attending the interview.<br /> <br />For more details: http://www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-DKB-20-225-6779-A.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42490/bioinformatics-scientist-%E2%80%93-icmr-computational-genomics-centre</guid>
  <pubDate>Sat, 26 Dec 2020 10:18:29 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist – ICMR Computational Genomics Centre]]></title>
  <description><![CDATA[
<p>ICMR invites online applications, from Indian Citizens, up to 8th January 2020 till 5:30 PM to fill up the following post to be filled purely on a temporary basis under “ICMR Computational Genomics Centre” under Dr. Harpreet Singh, Head, Division of Biomedical Informatics (BMI), ICMR HQRS, New Delhi 110029.<br />The Terms &amp; Conditions for the post are as follows:</p>

<p>a) Scientist-B – UR (2 posts-Bioinformatics) on consolidated salary of Rs.48,000/- pm + HRA</p>

<p>b) Scientist C – UR (1 post -Bioinformatics) on consolidated salary of Rs. 51,000 pm+ HRA</p>

<p>c) Scientist B- UR (2 post-Statistics) on a consolidated salary of Rs.48,000/- pm +HRA</p>

<p>d) Computer Programmer 1 post UR &amp; 1 post SC on a consolidated salary of Rs. 32,500/- pm</p>

<p>e) Research Assistant -UR 1 post on a consolidated salary of Rs. 31,000/- pm</p>

<p>More at https://projectjobs.icmr.org.in/sccbioinformatics/uploads/recruitment/Adv_BMI_24122020.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28807/organellargenomedraw</guid>
	<pubDate>Tue, 16 Aug 2016 08:13:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28807/organellargenomedraw</link>
	<title><![CDATA[OrganellarGenomeDRAW]]></title>
	<description><![CDATA[<p><span>O</span><span>rganellar</span><span>G</span><span>enome</span><span>DRAW</span><span>&nbsp;is dedicated to convert genetic information stored in GenBank entries to graphical maps. The input text file has to be in GenBank flat file format, whereas the output format can be chosen among several formats. The application is especially optimized and adapted for the creation of high-quality, detailed circular maps of organellar genomes like the plastid genome (plastome) or the mitochondrial genome (chondriome). Nevertheless, you can upload any GenBank entry. The workflow is devided into three steps.&nbsp;</span></p>
<p><span>More at&nbsp;http://ogdraw.mpimp-golm.mpg.de/cgi-bin/ogdraw.pl</span></p><p>Address of the bookmark: <a href="http://ogdraw.mpimp-golm.mpg.de/index.shtml" rel="nofollow">http://ogdraw.mpimp-golm.mpg.de/index.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</guid>
	<pubDate>Wed, 03 Jan 2018 05:05:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</link>
	<title><![CDATA[Seal: SEquence ALignment evaluation suite]]></title>
	<description><![CDATA[<p><span>Seal</span>&nbsp;is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including:</p>
<ul>
<li>Reading a pre-existing reference genome from one or more FASTA files.</li>
<li>Alternatively, generating an artificial reference genome based on input parameters (length, repeat count, repeat length, repeat variability rate).</li>
<li>Simulating reads from random locations in the genome based on input parameters of read length, coverage, sequencing error rate, and indel rate.</li>
<li>Applying alignment tools to the genome and the reads through a standardized interface.</li>
<li>Parsing the output of the alignment tool and calculating the number of reads that were correctly or incorrectly mapped.</li>
<li>Computing run times and measures of accuracy.</li>
</ul>
<p><span>Seal</span>&nbsp;has interfaces to evaluate the following software packages:</p>
<ul>
<li>Bowtie</li>
<li>BWA</li>
<li>MAQ</li>
<li>mrFAST</li>
<li>mrsFAST</li>
<li>Novoalign</li>
<li>SHRiMP</li>
<li>SOAPv2</li>
</ul><p>Address of the bookmark: <a href="http://compbio.case.edu/seal/" rel="nofollow">http://compbio.case.edu/seal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>