<?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/27432?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/27432?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41905/research-associate-bioinformatics-in-iisc-recruitment-2020</guid>
  <pubDate>Tue, 23 Jun 2020 21:53:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics in IISc Recruitment 2020]]></title>
  <description><![CDATA[
<p>Research Associate Bioinformatics in IISc Recruitment 2020</p>

<p>Essential Qualifications: Ph.D. (Bioinformatics/ Biophysics/ Biotechnology or any other stream of biological/ physical sciences) with a minimum of two publications in reputed peer reviewed journals in the area of structural bioinformatics or biophysics or biomolecular modeling/ simulation.</p>

<p>Job description: Development of bioinformatics tools and algorithms/software for structure based analysis of biomolecular systems. Programmatic access to major biomolecular databases using APIs Knowledge based prediction and analysis of biomolecular structure, function and interactions. Docking/simulations for inhibitor design.</p>

<p>Desirable Qualifications (Research Associate/s): i)  Strong computer programming skills (in Python/PERL/PHP or C++ or object oriented database management systems like MySQL etc or scripting languages under LINUX/UNIX environment). </p>

<p>ii) Extensive experience in computational analysis of biomolecular structure/interactions and usage of advanced biomolecular simulation softwares. iii) Adequate knowledge of major databases, webservers and softwares in the area of biomolecular structure/function and drug design. iv)  Familiarity with Parallel Programming environments and experience in usage of high-end HPC clusters.</p>

<p>The candidates must highlight their experience in above mentioned fields/topics in their CV. Initial appointment will be for a period of 1 year, subject to extension after review of performance.</p>

<p>Emoluments: As per DST, GOI norms and commensurate with experience.</p>

<p>More at https://www.iisc.ac.in/positions-open/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44716/exploring-rna-sequence-analysis-tools-for-every-bioinformatician</guid>
	<pubDate>Fri, 13 Dec 2024 04:03:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44716/exploring-rna-sequence-analysis-tools-for-every-bioinformatician</link>
	<title><![CDATA[Exploring RNA Sequence Analysis: Tools for Every Bioinformatician]]></title>
	<description><![CDATA[<p>RNA sequence analysis has become an essential part of modern biological research. From RNA-seq pipelines to specialized tools for specific RNA types, here's a comprehensive guide to tools you can use to make sense of RNA data.</p><h4><strong>1. RNA-Seq Analysis Pipelines</strong></h4><p>RNA-seq is one of the most popular techniques for studying RNA. These tools streamline processing raw sequence data:</p><ul>
<li><strong>FASTQC</strong>: For quality control of raw RNA-seq reads.</li>
<li><strong>Trimmomatic</strong>: For trimming and filtering RNA-seq reads.</li>
<li><strong>HISAT2/STAR</strong>: High-performance aligners for RNA-seq reads.</li>
<li><strong>FeatureCounts</strong>: For quantifying gene expression.</li>
<li><strong>DESeq2/EdgeR</strong>: For differential expression analysis.</li>
</ul><h4><strong>2. Transcriptome Assembly and Annotation</strong></h4><p>For analyzing transcriptomes from non-model organisms or assembling novel transcripts:</p><ul>
<li><strong>Trinity</strong>: For de novo transcriptome assembly.</li>
<li><strong>StringTie</strong>: For transcript assembly and quantification from RNA-seq alignments.</li>
<li><strong>TransDecoder</strong>: To predict coding regions within assembled transcripts.</li>
<li><strong>TAU</strong>: Tools for annotating non-coding and coding RNAs.</li>
</ul><h4><strong>3. Exploring Non-Coding RNA (ncRNA)</strong></h4><p>Non-coding RNAs play critical regulatory roles. Dedicated tools for studying them include:</p><ul>
<li><strong>Infernal</strong>: For identifying ncRNA sequences based on covariance models.</li>
<li><strong>Rfam</strong>: Database and tools for ncRNA families.</li>
<li><strong>miRDeep</strong>: For identifying microRNAs in RNA-seq datasets.</li>
</ul><h4><strong>4. RNA Structure and Motif Analysis</strong></h4><p>Structural biology of RNA helps in understanding its function:</p><ul>
<li><strong>RNAfold (ViennaRNA)</strong>: Predicts secondary structures from RNA sequences.</li>
<li><strong>RNAstructure</strong>: Tools for RNA secondary structure prediction and analysis.</li>
<li><strong>MEME Suite</strong>: For identifying motifs in RNA sequences.</li>
<li><strong>IntaRNA</strong>: For RNA-RNA interaction prediction.</li>
</ul><h4><strong>5. RNA Editing and Modifications</strong></h4><p>Epitranscriptomics is a growing field focusing on RNA modifications:</p><ul>
<li><strong>REDItools</strong>: For RNA editing analysis.</li>
<li><strong>m6Aboost</strong>: For identifying m6A modifications in RNA.</li>
</ul><h4><strong>6. Long-Read RNA Sequencing Analysis</strong></h4><p>Long-read technologies like Nanopore and PacBio are transforming RNA research:</p><ul>
<li><strong>FLAIR</strong>: For isoform-level analysis of long-read RNA-seq data.</li>
<li><strong>NanoMod</strong>: For detecting modifications in RNA from Nanopore sequencing.</li>
</ul><h4><strong>7. RNA-Protein Interactions</strong></h4><p>To study RNA-protein interactions and complexes:</p><ul>
<li><strong>RBPmap</strong>: For identifying RNA-binding protein motifs.</li>
<li><strong>PARalyzer</strong>: For analyzing PAR-CLIP data.</li>
</ul><h4><strong>8. Functional Enrichment Analysis</strong></h4><p>Understanding biological functions and pathways from RNA-seq data:</p><ul>
<li><strong>getENRICH</strong>: A tool designed for pathway enrichment analysis of non-model organisms (hypergeometric P-value calculation with FDR correction).</li>
<li><strong>ClusterProfiler</strong>: For GO and KEGG pathway enrichment analysis.</li>
</ul><h4><strong>9. Visualization and Data Sharing</strong></h4><p>Presenting and sharing RNA sequence analysis results effectively:</p><ul>
<li><strong>IGV</strong>: Genome browser for visualizing RNA-seq alignments.</li>
<li><strong>Circos</strong>: Circular visualization of RNA-seq data.</li>
<li><strong>DashBio</strong>: A Python library for creating bioinformatics visualizations.</li>
</ul><h4><strong>Conclusion</strong></h4><p>The bioinformatics landscape for RNA sequence analysis is vast, with tools catering to specific needs. Whether you&rsquo;re studying coding RNAs, non-coding RNAs, or exploring RNA-protein interactions, the right tools can transform your data into biological insights.</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/44491/cgviewjs-is-a-circular-genome-viewing-tool</guid>
	<pubDate>Wed, 27 Mar 2024 11:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</link>
	<title><![CDATA[CGView.js is a Circular Genome Viewing tool]]></title>
	<description><![CDATA[<p>CGView.js is a&nbsp;<span>C</span>ircular&nbsp;<span>G</span>enome&nbsp;<span>View</span>ing tool for visualizing and interacting with small genomes. This software is an adaptation of the Java program&nbsp;<a href="https://paulstothard.github.io/cgview/">CGView</a>.</p>
<div>
<p>CGView.js is the genome viewer of Proksee, an expert system for genome assembly, annotation and visualization.</p>
<a href="https://proksee.ca/"></a></div>
<h1 id="features">Features</h1>
<ul>
<li>
<p>Circular and linear views of genomes</p>
</li>
<li>
<p>Capable of drawing genomes up to 10 Mbp with 1000's of features and 100's contigs</p>
</li>
<li>
<p>Smooth zooming down to the sequence level</p>
</li>
<li>
<p>Easily generate features and plots directly form the sequence (e.g. ORFs, GC-content and GC-Skew)</p>
</li>
<li>
<p>Save high resolution PNG maps up to 8000x8000px</p>
</li>
<li>
<p>Fully documented API for interacting with CGView.js maps</p>
</li>
</ul><p>Address of the bookmark: <a href="https://js.cgview.ca/" rel="nofollow">https://js.cgview.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</guid>
	<pubDate>Mon, 06 Oct 2014 12:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</link>
	<title><![CDATA[Software developed in pevsner lab]]></title>
	<description><![CDATA[<div>
<div id="block-system-main">
<div>
<div id="node-7">
<div>
<div>
<div>
<div>
<p><a href="http://pevsnerlab.kennedykrieger.org/dragon.htm">DRAGON</a>: Database Referencing of Array Genes Online</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/96">SNOMAD</a>: Standardization and Normalization of Microarray Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/70">SNPduo</a>: SNP Analysis Between Two Individuals</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/71">SNPtrio</a>: Analyzing and Visualizing and Inheritance Patterns in Trios</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">SNPscan</a>: Data Analysis and Visualization of SNP Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">pediSNP</a>: Analyze SNP Data From a Pedigree of Two Generations</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/73">kcoeff</a>: Calculate Cotterman Coefficients of SNP Genotype Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/113">triPOD:</a> Detects chromosomal abnormalities in parent-child trio-based microarray data</p>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div><p>Address of the bookmark: <a href="http://pevsnerlab.kennedykrieger.org/php/?q=software" rel="nofollow">http://pevsnerlab.kennedykrieger.org/php/?q=software</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26306/busco</guid>
	<pubDate>Sun, 07 Feb 2016 16:02:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26306/busco</link>
	<title><![CDATA[BUSCO]]></title>
	<description><![CDATA[<p>Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs</p>
<p>More at http://busco.ezlab.org/</p><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26409/ucsc-genome-browser-and-blat-software</guid>
	<pubDate>Thu, 18 Feb 2016 03:18:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26409/ucsc-genome-browser-and-blat-software</link>
	<title><![CDATA[UCSC Genome Browser and Blat software !]]></title>
	<description><![CDATA[<p>This directory contains Genome Browser and Blat application binaries built for standalone <br>command-line use on various supported Linux and UNIX platforms. To determine which set of binaries <br>to download, type "uname -a" on the command line to display your machine type. In most cases the <br>usage statement for the application can be viewed by running the binary with no arguments. <br><br>The UCSC Genome Browser and Blat software are free for academic, nonprofit, and personal use. A <br>license is required for commercial download and installation of these binaries, with the exception <br>of items built from the following source code directories, which are freely available for all uses:<br><br>&nbsp;- kent/src/utils (includes big* tools)<br>&nbsp;- kent/src/lib<br>&nbsp;- kent/src/hg/autoSql<br>&nbsp;- kent/src/hg/autoXml<br><br>For information about commercial licensing of the Genome Browser software, see <br>http://genome.ucsc.edu/license/. The Blat and In-Silico PCR software may be commercially<br>licensed through Kent Informatics (http://www.kentinformatics.com).</p>
<p>More at http://hgdownload.cse.ucsc.edu/admin/exe/</p><p>Address of the bookmark: <a href="http://hgdownload.cse.ucsc.edu/admin/exe/" rel="nofollow">http://hgdownload.cse.ucsc.edu/admin/exe/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</guid>
	<pubDate>Tue, 05 Jul 2016 10:02:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</link>
	<title><![CDATA[Bioinformatics tools and software]]></title>
	<description><![CDATA[<p><a href="http://drive5.com/usearch">USEARCH &gt;</a><br><span>Extreme high-throughput sequence analysis. Orders of magnitude faster than BLAST.</span>&nbsp;<a href="http://drive5.com/muscle">MUSCLE &gt;</a><br><span>Multiple sequence alignment. Faster and more accurate than CLUSTALW.</span></p>
<p>&nbsp;<a href="http://drive5.com/uparse">UPARSE &gt;</a><br><span>OTU clustering for 16S and other marker genes. Highly accurate OTU sequences and improved diversity measures.</span>&nbsp;<a href="http://drive5.com/uchime">UCHIME &gt;</a><br><span>Chimeric sequence detection.</span>&nbsp;<a href="http://drive5.com/piler">PILER &gt;</a><br><span>De novo genome repeat finder.</span>&nbsp;<a href="http://drive5.com/pilercr">PILER-CR &gt;</a><br><span>Detection of CRISPR repeats in bacterial genomes.</span>&nbsp;<a href="http://drive5.com/qscore">QSCORE &gt;</a><br><span>Compare two multiple alignments for benchmarking.</span>&nbsp;<a href="http://drive5.com/pals">PALS &gt;</a><br><span>Whole-genome alignment.</span>&nbsp;<a href="http://drive5.com/muscle/prefab.htm">PREFAB &gt;</a><br><span>Protein Reference Alignment Database.</span>&nbsp;<a href="http://drive5.com/bench">MSA benchmark collection &gt;</a><br><span>Selected multiple alignment benchmarks in a standardized FASTA format.</span></p><p>Address of the bookmark: <a href="http://drive5.com/software.html" rel="nofollow">http://drive5.com/software.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</guid>
	<pubDate>Thu, 16 Feb 2017 11:39:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</link>
	<title><![CDATA[HivePlot]]></title>
	<description><![CDATA[<p>The&nbsp;<em>hive plot</em>&nbsp;is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes &mdash; this mapping is based on network structural properties. Edges are drawn as curved links. Simple and interpretable.</p>
<p>The purpose of the hive plot is to establish a new baseline for visualization of large networks &mdash; a method that is both general and tunable and useful as a starting point in visually exploring network structure.</p>
<p>More at&nbsp;http://www.hiveplot.com/</p><p>Address of the bookmark: <a href="http://www.hiveplot.com/" rel="nofollow">http://www.hiveplot.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>