<?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/43801?offset=470</link>
	<atom:link href="https://bioinformaticsonline.com/related/43801?offset=470" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40544/ngs-bits-short-read-sequencing-tools</guid>
	<pubDate>Thu, 16 Jan 2020 23:14:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40544/ngs-bits-short-read-sequencing-tools</link>
	<title><![CDATA[ngs-bits - Short-read sequencing tools]]></title>
	<description><![CDATA[<p>Binaries of&nbsp;<em>ngs-bits</em>&nbsp;are available via Bioconda. Alternatively,&nbsp;<em>ngs-bits</em>&nbsp;can be built from sources:</p>
<ul>
<li><span>Binaries</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_bioconda.md">Linux/macOS</a></li>
<li>From&nbsp;<span>sources</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_unix.md">Linux/macOS</a></li>
<li>From&nbsp;<span>sources</span>&nbsp;for&nbsp;<a href="https://github.com/imgag/ngs-bits/blob/master/doc/install_win.md">Windows</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/imgag/ngs-bits" rel="nofollow">https://github.com/imgag/ngs-bits</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</guid>
	<pubDate>Sat, 26 Dec 2020 08:35:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</link>
	<title><![CDATA[FastProNGS: fast preprocessing of next-generation sequencing reads]]></title>
	<description><![CDATA[<p><span>FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/Megagenomics/FastProNGS" rel="nofollow">https://github.com/Megagenomics/FastProNGS</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</guid>
	<pubDate>Wed, 25 Apr 2018 04:35:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</link>
	<title><![CDATA[Binding Site Prediction in Protein !]]></title>
	<description><![CDATA[<p><span>The interaction between proteins and other molecules is fundamental to all biological functions. In this section we include tools that can assist in prediction of interaction sites on protein surface and tools for predicting the structure of the intermolecular complex formed between two or more molecules (docking).</span></p><h4>Pockets Identification</h4><p><a href="http://sts.bioengr.uic.edu/castp/" target="_blank">CASTp</a></p><div style="text-align: justify;">Automatic Identification of pockets and cavities in proteins structure, and quantitation of their volumes using Delaunay triangulation. Available also as PyMOL plugin</div><p><a href="http://www.bioinformatics.leeds.ac.uk/pocketfinder/" target="_blank">Pocket-Finder</a></p><div style="text-align: justify;">Automatic identification of pockets and cavities in proteins structure, and quantitation of their volumes.</div><p><a href="http://gecco.org.chemie.uni-frankfurt.de/pocketpicker/index.html" target="_blank">PocketPicker</a></p><div style="text-align: justify;">Grid-based technique for the analysis of protein pockets. PocketPicker available as a plugin for&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/pymol.htm">PyMOL</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><h4>Binding Site Prediction</h4>
<p><a href="http://consurf.tau.ac.il/" target="_blank">ConSurf</a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification of functional regions in proteins by surface-mapping of phylogenetic information</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www-cryst.bioc.cam.ac.uk/~crescendo/crescendo.php" target="_blank">CRESCENDO</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification protein interaction sites. It uses sequence conservation patterns in homologous proteins to distinguish between residues that are conserved due to structural restraints from those due to functional restraints.&nbsp;&nbsp;</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><strong>Ligand Binding Sites</strong></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www.sbg.bio.ic.ac.uk/~3dligandsite/" target="_blank">3DLigandSite</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">The server utilizes protein-structure prediction to provide structural models of the binding site. Ligands bound to structures are superimposed onto the model and use to predict the binding site.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">F<a href="http://cssb.biology.gatech.edu/skolnick/files/FINDSITE/" target="_blank">INDSITE</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">A threading-based method for ligand-binding site prediction and functional annotation based on binding-site similarity across superimposed groups of threading templates.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">
<p><a href="http://scoppi.biotec.tu-dresden.de/pocket/" target="_blank">LIGSITE<sup>csc</sup></a></p>
<div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Prediction of binding site by pocket identification using the Connolly surface and degree of conservation</div>
<p><a href="http://metapocket.eml.org/" target="_blank"></a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://metapocket.eml.org/" target="_blank">metaPocket</a>A meta server for ligand-binding site prediction. metaPocket use&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#ligsite">LIGSITE<sup>csc</sup></a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pass">PASS</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#qsite">Q-SiteFinder</a>&nbsp;and&nbsp;<a href="http://www.biochem.ucl.ac.uk/~roman/surfnet/surfnet.html" target="_blank">SURFNET</a></div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39187/distruct-a-program-for-the-graphical-display-of-population-structure</guid>
	<pubDate>Mon, 25 Mar 2019 03:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39187/distruct-a-program-for-the-graphical-display-of-population-structure</link>
	<title><![CDATA[DISTRUCT: a program for the graphical display of population structure]]></title>
	<description><![CDATA[<p><em>distruct</em><span>&nbsp;is a program that can be used to graphically display results produced by the genetic clustering program&nbsp;</span><em><a href="http://pritch.bsd.uchicago.edu/">structure</a></em><span>&nbsp;or by other similar programs. The figures produced by&nbsp;</span><em>distruct</em><span>display individual membership coefficients in the same form as used in&nbsp;</span><a href="https://rosenberglab.stanford.edu/papers/popstruct.pdf">"Genetic structure of human populations"&nbsp;<em>Science</em>&nbsp;298: 2381-2385 (2002)</a><span>. Various options enable the user to control left-to-right printing order of populations, bottom-to-top printing order of clusers, colors, and other graphical details. [</span><a href="https://rosenberglab.stanford.edu/distructExample.html">Example</a><span>]</span></p>
<p>[<a href="https://rosenberglab.stanford.edu/distructForms/distructRegistration.html">Download software package (includes the manual)</a>] (you will be directed first to a registration page and we would very much appreciate if you register)&nbsp;<br>[<a href="https://rosenberglab.stanford.edu/software/distructManual.pdf">Download manual</a>]&nbsp;<br>[<a href="https://rosenberglab.stanford.edu/papers/distructNote.pdf">Download software note from&nbsp;<em>Molecular Ecology Notes</em>&nbsp;4: 137-138 (2004)</a>]</p>
<p>To use the UNIX versions, unzip and untar the files in an appropriate directory using</p>
<pre>gunzip filename.tar.gz; tar xvf filename.tar</pre>
<p><span>where "filename.tar.gz" is the downloaded file. Winzip will unzip the Windows version. Run the program by typing</span></p>
<pre>./distruct</pre>
<p><span>in UNIX or</span></p>
<pre>distruct</pre>
<p><span>from a Dos prompt in Windows. It will produce a figure using the data that are represented in the Central/South Asia&nbsp;</span><em>K=5</em><span>&nbsp;plot in&nbsp;</span><em>Science</em><span>&nbsp;298: 2381-2385 (2002).</span></p>
<p>Please send comments or problems with&nbsp;<em>distruct</em>&nbsp;to Noah Rosenberg.</p>
<h4><em>October 15, 2014 &mdash; Users of Distruct may also find&nbsp;<a href="https://rosenberglab.stanford.edu/clumpp.html">CLUMPP</a>&nbsp;and&nbsp;<a href="http://clumpak.tau.ac.il/">CLUMPAK</a>&nbsp;of interest.</em></h4><p>Address of the bookmark: <a href="https://rosenberglab.stanford.edu/distruct.html" rel="nofollow">https://rosenberglab.stanford.edu/distruct.html</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</guid>
	<pubDate>Sat, 11 Jan 2020 07:34:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40525/heatmaply-popular-graphical-method-for-visualizing-high-dimensional-data</link>
	<title><![CDATA[heatmaply: popular graphical method for visualizing high-dimensional data]]></title>
	<description><![CDATA[<p>This work is based on ggplot2 and plotly.js engine. It produces similar heatmaps as d3heatmap, with the advantage of speed (plotly.js is able to handle larger size matrix), and the ability to zoom from the dendrogram.</p>
<p>heatmaply also provides an interface based around the&nbsp;<a href="https://cran.r-project.org/package=plotly">plotly R package</a>. This interface can be used by choosing&nbsp;<code>plot_method = "plotly"</code>&nbsp;instead of the default&nbsp;<code>plot_method = "ggplot"</code>. This interface can provide smaller objects and faster rendering to disk in many cases and provides otherwise almost identical features.</p>
<p>Documentation for this package is also available as a&nbsp;<a href="https://cran.r-project.org/package=pkgdown">pkgdown</a>&nbsp;site:&nbsp;<a href="http://talgalili.github.io/heatmaply/">http://talgalili.github.io/heatmaply/</a></p><p>Address of the bookmark: <a href="http://talgalili.github.io/heatmaply/articles/heatmaply.html" rel="nofollow">http://talgalili.github.io/heatmaply/articles/heatmaply.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41209/juicebox-visualization-and-analysis-software-for-hi-c-data</guid>
	<pubDate>Fri, 21 Feb 2020 00:33:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41209/juicebox-visualization-and-analysis-software-for-hi-c-data</link>
	<title><![CDATA[Juicebox: Visualization and analysis software for Hi-C data]]></title>
	<description><![CDATA[<p>Juicebox is visualization software for Hi-C data. This distribution includes the source code for Juicebox,&nbsp;<a href="https://github.com/theaidenlab/juicer/wiki/Download">Juicer Tools</a>, and&nbsp;<a href="https://aidenlab.org/assembly/">Assembly Tools</a>.&nbsp;<a href="https://github.com/theaidenlab/juicebox/wiki/Download">Download Juicebox here</a>, or use&nbsp;<a href="https://aidenlab.org/juicebox">Juicebox on the web</a>. Detailed documentation is available&nbsp;<a href="https://github.com/theaidenlab/juicebox/wiki">on the wiki</a>. Instructions below pertain primarily to usage of command line tools and the Juicebox jar files.</p>
<p>Juicebox can now be used to visualize and interactively (re)assemble genomes. Check out the Juicebox Assembly Tools Module website&nbsp;<a href="https://aidenlab.org/assembly">https://aidenlab.org/assembly</a>&nbsp;for more details on how to use Juicebox for assembly.</p>
<p>GUI at&nbsp;<a href="https://aidenlab.org/juicebox/">https://aidenlab.org/juicebox/</a></p><p>Address of the bookmark: <a href="https://github.com/aidenlab/Juicebox" rel="nofollow">https://github.com/aidenlab/Juicebox</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/41804/useful-links-to-therapy-disease-drug-and-drug-target-network-data</guid>
	<pubDate>Mon, 01 Jun 2020 11:47:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/41804/useful-links-to-therapy-disease-drug-and-drug-target-network-data</link>
	<title><![CDATA[Useful links to therapy, disease, drug and drug-target network data:]]></title>
	<description><![CDATA[<p>Useful links to therapy, disease, drug and drug-target network data:</p><p><strong>DrugBank:</strong></p><p>a bioinformatics- cheminformatics resource combining detailed drug data with comprehensive drug target information with &gt;4900 drug (~3500 experimental) and &gt;1500 non-redundant protein entries http://www.drugbank.ca/</p><p><strong>Drug-Target Network:</strong></p><p>network data of 890 drugs and 394 target human proteins http://www.nature.com/nbt/journal/v25/ n10/suppinfo/nbt1338_S1.html</p><p><strong>Drug-Therapy Network:</strong></p><p>three layers of drug-therapy networks according to the ATC classification http://www.biomedcentral.com/1471-2210/8/5/additional/</p><p><strong>FDA Orange Book:</strong></p><p>approved drug products with therapeutic equivalence evaluations http://www.fda.gov/cder/ob/HIDdb: Thomson Investigational drugs database including information on 107000 patents, 25000 investigational drugs and 80000 chemical structures http://scientific.thomson.com/products/iddb/HOMIM: a knowledgebase of human genes and genetic disorders http://www.ncbi.nlm.nih.gov/ sites/entrez?db=omim</p><p><strong>PDTD:</strong></p><p>3D drug target structure database with a target identification option http://www.dddc.ac.cn/pdtd/</p><p><strong>Predicted drug targets:</strong></p><p>a set of 1383 predicted drug targets http://www.biomedcentral.com/1471-2105/8/353/additional/ [25] Protein ligand network: a network of 4208 ligands and ~15000 binding sites http://pbil.kaist.ac.kr/~parkkw/Lnet/</p><p><strong>TDR Targets Database:</strong></p><p>identification and ranking targets against neglected tropical diseases http://tdrtargets.org/</p><p><strong>Therapeutic Target Database:</strong></p><p>lists &gt;1500 therapeutic targets, disease conditions and corresponding drugs http://xin.cz3.nus.edu.sg/group/cjttd/ttd.asp</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>