<?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/34618?offset=340</link>
	<atom:link href="https://bioinformaticsonline.com/related/34618?offset=340" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43828/understanding-hifi-reads</guid>
	<pubDate>Thu, 24 Mar 2022 19:48:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43828/understanding-hifi-reads</link>
	<title><![CDATA[Understanding HiFi Reads !]]></title>
	<description><![CDATA[<p><span>While little public data is available for either of the new synthetic long read approaches, Illumina showed an example comparison earlier this year at the&nbsp;</span><a href="https://www.festivalofgenomics.com/rami-mehio" target="_blank">Festival of Genomics &amp; Biodata conference</a><span>&nbsp;(FoG 2022). In the IGV screenshot presented (below), synthetic Infinity reads &ndash; labeled &ldquo;Longas&rdquo; &ndash; are at the top, followed by standard Illumina short reads, and PacBio HiFi reads labeled &ldquo;CCS&rdquo; depicted at the bottom:</span></p><p>Address of the bookmark: <a href="http://pacb.com/blog/the-hifi-difference-true-long-reads-vs-synthetic-long-reads/" rel="nofollow">http://pacb.com/blog/the-hifi-difference-true-long-reads-vs-synthetic-long-reads/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</guid>
	<pubDate>Sun, 08 Jun 2014 09:56:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</link>
	<title><![CDATA[Bioinformatician’s Pocket Reference !!]]></title>
	<description><![CDATA[<p><span>It is amusing how brain of bioinformaticians work! Learning a new programming language for days feels so much of fun that making 5 minute discussion with neighbours (unless under special circumstances!) in our own mother-tongue. Today every bioinformatician keeps more than few languages and core IT toolkits on their plate. It has become mandatory to be able to mould different code snippets to build our own custom workflows, and thus keeping syntax at our fingertips has become essential.Although Google is best way to get syntax problem solved, it is not a bad idea to keep reference sheets is our smartphones or stick out some printed sheets on the back of your door, in the old fashion way!!</span></p><p>Address of the bookmark: <a href="http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/" rel="nofollow">http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/</a></p>]]></description>
	<dc:creator>RAJESH DETROJA</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</guid>
	<pubDate>Wed, 15 Sep 2021 21:15:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</link>
	<title><![CDATA[Reference Sequence Resource!]]></title>
	<description><![CDATA[<p><span>The ENCODE project uses Reference Genomes from&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/genome/browse/reference/">NCBI</a><span>&nbsp;or&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/downloads.html">UCSC</a><span>&nbsp;to provide a consistent framework for mapping high-throughput sequencing data.&nbsp;In general, ENCODE data are mapped consistently to 2 human (GRCH38, hg19) and 2 mouse (mm9/mm10) genomes for historical comparability.&nbsp;</span><em>Drosophia melanogaster</em><span>&nbsp;experiments are mapped to either dm3 or dm6 and&nbsp;</span><em>Caenorhabdilis elegans&nbsp;</em><span>experiments are mapped to ce10 or ce11.&nbsp;T</span></p><p>Address of the bookmark: <a href="https://www.encodeproject.org/data-standards/reference-sequences/" rel="nofollow">https://www.encodeproject.org/data-standards/reference-sequences/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41230/curated-set-of-ribosomal-rna-rrna-reference-sequences-targeted-loci-with-verifiable-organism</guid>
	<pubDate>Sun, 23 Feb 2020 02:17:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41230/curated-set-of-ribosomal-rna-rrna-reference-sequences-targeted-loci-with-verifiable-organism</link>
	<title><![CDATA[Curated set of ribosomal RNA (rRNA) reference sequences (targeted loci) with verifiable organism]]></title>
	<description><![CDATA[<p>MCBI have a curated set of ribosomal RNA (rRNA) reference sequences (targeted loci) with verifiable organism sources and current names. This set is critical for correctly identifying and classifying prokaryotic (bacteria and archaea) and fungal samples. To provide easy access to these sequences, we recently added a separate rRNA/ITS databases section on the nucleotide BLAST page for these targeted sequences that makes it convenient to quickly identify source organisms. The new databases are: </p><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *16S ribosomal RNA (Bacteria and Archaea)</p><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *18S ribosomal RNA sequences (SSU) from Fungi type and reference material&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</p><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *28S ribosomal RNA sequences (LSU) from Fungi type and reference material</p><p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *Internal transcribed spacer region (ITS) from Fungi type and reference material</p><p>You can also download these from the BLAST db FTP area.&nbsp; See the <a href="https://go.usa.gov/xdEBX" target="_blank">NCBI Insights post</a> for more detail. </p><p>Useful links</p><p>-----------------</p><p><a href="https://go.usa.gov/xdEj5" target="_blank">BLAST form with rRNA/ITS databases</a></p><p><a href="https://ftp.ncbi.nlm.nih.gov/blast/db/" target="_blank">BLAST db download</a></p><p><a href="https://www.ncbi.nlm.nih.gov/refseq/targetedloci/" target="_blank">Targeted loci</a></p><p><span style="color: black;">If you have any questions or concerns, please contact <a href="mailto:blast-help@ncbi.nlm.nih.gov" target="_blank" title="Follow link">blast-help@ncbi.nlm.nih.gov<sup><span style="color: black; text-decoration: none;"><img src="https://mail.google.com/mail/u/0?ui=2&amp;ik=024a8aa0b9&amp;attid=0.1&amp;permmsgid=msg-f:1659255165855446848&amp;th=1706dbc8408bb740&amp;view=fimg&amp;sz=s0-l75-ft&amp;attbid=ANGjdJ_drW2ArYDNLoHrQh36gm6rp2Std8ZUSplCzP6bYQSQYBsQfZ_85vOujXOdTRdaLxrR7QeEBVUbyACPBJHhFUeIglX8G7Ew7TcclzhvO7fJhiz7sIdkkDgZ7QA&amp;disp=emb" alt="https://jira.ncbi.nlm.nih.gov/images/icons/mail_small.gif" width="13" height="12" style="border: 0px;"></span></sup></a></span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</guid>
	<pubDate>Thu, 10 Oct 2013 11:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</link>
	<title><![CDATA[The anatomy of successful computational biology software]]></title>
	<description><![CDATA[<p>Creators of software widely used in computational biology discuss the factors that contributed to their success</p><p><em>Nature Biotechnology</em><span>&nbsp;spoke with Altschul and several other originators of computational biology software programs widely used today (</span><a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html#t1">Table 1</a><span>). The conversations explored what makes certain software tools successful, the unique challenges of developing them for biological research and how the field of computational biology, as a whole, can move research agendas forward. What follows is an edited compilation of interviews.</span></p><p>Detail @&nbsp;<a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html">http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html</a></p><p>News Source @ Nature</p>]]></description>
	<dc:creator>Jitendra Narayan</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/27432/gkno</guid>
	<pubDate>Fri, 20 May 2016 18:56:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27432/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>http://gkno.me/how-to/install.html</span></p>
<p><span>http://gkno.me/software.html</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</guid>
	<pubDate>Fri, 27 Jan 2017 16:00:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30680/easybuild</link>
	<title><![CDATA[EasyBuild]]></title>
	<description><![CDATA[<p><a href="https://github.com/hpcugent/easybuild">EasyBuild</a><span>&nbsp;is a software build and installation framework that allows you to manage (scientific) software on High Performance Computing (HPC) systems in an efficient way.</span><br><span>A full list of supported software packages is available&nbsp;</span><a href="http://easybuild.readthedocs.io/en/latest/version-specific/Supported_software.html">here</a><span>.</span></p><p>Address of the bookmark: <a href="https://hpcugent.github.io/easybuild/" rel="nofollow">https://hpcugent.github.io/easybuild/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</guid>
	<pubDate>Tue, 14 Nov 2017 09:30:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</link>
	<title><![CDATA[OrthoGNC: A Software for Accurate Identification of Orthologs Based on Gene Neighborhood Conservation]]></title>
	<description><![CDATA[<div>
<p id="sp0005">Orthology relations can be used to transfer annotations from one gene (or protein) to another. Hence, detecting orthology relations has become an important task in the post-genomic era. Various genomic events, such as duplication and horizontal gene transfer, can cause erroneous assignment of orthology relations. In closely-related species, gene neighborhood information can be used to resolve many ambiguities in orthology inference. Here we present OrthoGNC, a software for accurately predicting pairwise orthology relations based on gene neighborhood conservation. Analyses on simulated and real data reveal the high accuracy of OrthoGNC. In addition to orthology detection, OrthoGNC can be employed to investigate the conservation of genomic context among potential orthologs detected by other methods. OrthoGNC is freely available online at http://bs.ipm.ir/softwares/orthognc and http://tinyurl.com/orthoGNC.</p>
<p>http://www.comp.nus.edu.sg/~wongls/projects/orthoGNC/</p>
</div><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S1672022917301663" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S1672022917301663</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</guid>
	<pubDate>Wed, 25 Apr 2018 05:15:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</link>
	<title><![CDATA[Tools for Protein-Protein Docking !]]></title>
	<description><![CDATA[<p>Predicting the structure of protein&ndash;protein complexes using docking approaches is a difficult problem whose major challenges include identifying correct solutions, and properly dealing with molecular flexibility and conformational changes. Following are the tools to predict&nbsp;<span>the structure of protein&ndash;protein complexes:</span></p><p><a href="http://www.sbg.bio.ic.ac.uk/docking/index.html" target="_blank">3D-Dock Suite</a></p><p>Global rigid search: FFTShape complementarity and electrostatics</p><p>Re-scoring and clustering. Refinement of interface side-chains</p><p><a href="http://www.sbg.bio.ic.ac.uk/~3dgarden/" target="_blank">3D-Garden</a></p><p>Global rigid search in ensamble</p><p>Shape complementarity and Lennard&ndash;Jones potential</p><p>Side chain and backbone dihedral refinement</p><p><a href="http://www.sdsc.edu/CCMS/DOT/" target="_blank">DOT</a></p><p>Global rigid search: FFTShape complementarity, electrostatics and VDWNone</p><p><a href="http://users.unimi.it/~ddl/escherng/index.htm" target="_blank">Escher NG</a></p><p>Global rigid searchShape complementarity, hydrogen bonds and electrostatic</p><p>Integrated in&nbsp;<a href="http://users.unimi.it/~ddl/vega/download.htm" target="_blank">VEGA</a></p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/gramm1" target="_blank">GRAMM</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potential</p><p>Clustering of conformations</p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/grammx/" target="_blank">GRAMM-X</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potentialminimization and re-scoring with multiple filters</p><p><a href="http://www.loria.fr/~ritchied/hex_server/" target="_blank">HEX</a></p><p>Global rigid search: Fourier correlation of spherical harmonics</p><p>Shape complementarity</p><p><a href="http://www.csd.abdn.ac.uk/hex/" target="_blank"></a><a href="http://haddock.chem.uu.nl/Haddock/haddock.php" target="_blank">HADDOCK</a></p><p>Global rigid searchElectrostatic ,VDW and desolvation energy termsMD simulated annealing refinement . Filtering based on external data.&nbsp;</p><p><a href="http://www.molsoft.com/docking.html">ICM</a></p><p>Global rigid search: Monte CarloEmpirical scoring function</p><p>Clustering and selection of conformations. Refinement of interface side-chains and re-scoring</p><p><a href="http://www.weizmann.ac.il/Chemical_Research_Support/molfit/" target="_blank">MolFit&nbsp;</a></p><p>Global rigid search: FFTShape complementarity</p><p>Clustering of good solutions, filtering using&nbsp;<em>a priori&nbsp;</em>information and small, local rigid rotations around selected conformations</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank">PatchDock</a></p><p>Global rigid searchShape complementarity and atomic desolvation energy</p><p>Clustering of conformations</p><p><a href="http://inb.bsc.es/gn6/PyDock" target="_blank">PyDock</a></p><p>Global rigid search:FFTShape complementarity</p><p>rescoring by binding electrostatics and desolvation energy</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank"></a><a href="http://rosettadock.graylab.jhu.edu/" target="_blank">RosettaDock</a></p><p>Local rigid search: Monte Carlo with low and high resolution structure representation levels</p><p>Different scoring parameters for the different resolutions&nbsp;</p><p><a href="http://zlab.bu.edu/zdock/" target="_blank">ZDOCK</a></p><p>Global rigid search: FFTShape complementarity, desolvation energy, and electrostatics.</p><p>Energy minimization and re-scoringFree for academics</p><p>&nbsp;</p><p>Point to note:</p><p>The proper treatment of flexibility in protein&ndash;protein docking is still an active field of research. You first should analyzed your proteins in order to define their conformational space and then choose the most suitable method for your docking problem.</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>