<?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/36849?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/36849?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</guid>
	<pubDate>Tue, 14 Jul 2020 06:42:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</link>
	<title><![CDATA[ShadowCaster: a hybrid approach for the detection of horizontal gene transfer events in prokaryotes]]></title>
	<description><![CDATA[<p><span>ShadowCaster implements an evolutionary model to calculate Bayesian likelihoods for each &lsquo;alien genes&rsquo; with an unusual sequence composition according to the host genome background to detect HGT events in prokaryotes.</span></p>
<p><a href="https://www.mdpi.com/2073-4425/11/7/756/htm">https://www.mdpi.com/2073-4425/11/7/756/htm</a></p>
<p><a href="https://shadowcaster.readthedocs.io/en/latest/">https://shadowcaster.readthedocs.io/en/latest/</a></p>
<p><a href="https://github.com/dani2s/ShadowCaster_testData">https://github.com/dani2s/ShadowCaster_testData</a></p><p>Address of the bookmark: <a href="https://github.com/dani2s/ShadowCaster" rel="nofollow">https://github.com/dani2s/ShadowCaster</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</guid>
	<pubDate>Wed, 20 Aug 2014 22:09:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</link>
	<title><![CDATA[Pimp your brain: Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/KqelGy6Q8nE" frameborder="0" allowfullscreen></iframe>Jan Lisec from the Max Planck Institute of Molecular Plant Physiology explains, in this "pimp your brain" episode, what bioinformatics is and why bioinformatics is so important and indispensable for biological research.

In the video serial "Pimp your brain" scientists from the Max Planck Institute of Molecular Plant Physiology describe their research. More videos from the 'Pimp your brain' serial are available on www.youtube.com/playlist?list=PL-l9VItC9Gn2Ur2Xj6PTOAkjLUlVPbIOO

More videos are available on www.mpimp-golm.mpg.de]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43362/machine-learning-for-genomics</guid>
	<pubDate>Thu, 09 Sep 2021 11:26:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43362/machine-learning-for-genomics</link>
	<title><![CDATA[Machine Learning for Genomics]]></title>
	<description><![CDATA[<h3>Module 1: Statistics for genomics (2-8 August 2021)</h3>
<ul>
<li>A simple intro to statistical distributions</li>
<li>hypothesis testing</li>
<li>linear models.</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/stats.html">http://compgenomr.github.io/book/stats.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/compgen2021_stats.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/compgen2021_stats.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/</a></p>
<h3><a href="https://github.com/BIMSBbioinfo/compgen2021#module-2-unsupervised-learning-for-genomics-9-15-august-2021"></a>Module 2: Unsupervised learning for genomics (9-15 August 2021)</h3>
<ul>
<li>Understanding basic intuition behind machine learning approaches.</li>
<li>Using unsupervised learning to cluster and visualise data points</li>
<li>Dimension reduction techniques for visualisation and as input to clustering methods</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/unsupervisedLearning.html">http://compgenomr.github.io/book/unsupervisedLearning.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/compgen2021_unsupervisedLearning.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/compgen2021_unsupervisedLearning.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/</a></p>
<h3><a href="https://github.com/BIMSBbioinfo/compgen2021#module-3-supervised-learning-for-genomics-16-22-august-2021"></a>Module 3: Supervised learning for genomics (16-22 August 2021)</h3>
<ul>
<li>Understanding and using supervised learning methods for predictive purposes</li>
<li>How to measure prediction performance</li>
<li>Understand and use cross-validation and related concepts</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/supervisedLearning.html">http://compgenomr.github.io/book/supervisedLearning.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/compgen2021_supervisedLearning.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/compgen2021_supervisedLearning.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/</a></p>
<p>https://github.com/BIMSBbioinfo/compgen2021</p><p>Address of the bookmark: <a href="https://github.com/BIMSBbioinfo/compgen2021" rel="nofollow">https://github.com/BIMSBbioinfo/compgen2021</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</guid>
	<pubDate>Tue, 31 Dec 2019 19:33:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</link>
	<title><![CDATA[Machine learning training and courses in bioinformatics !]]></title>
	<description><![CDATA[<p>Machine learning techniques have been successful in analyzing biological data because of their capabilities in handling randomness and uncertainty of data noise and in generalization. In this class, we will learn basics about probabilistic models and machine learning techniques. We will focus on probabilistic models (Markov models, Hidden Markov models, and Bayesian networks) for biological sequence analysis and systems biology. Other machine learning techniques, such as Naive bayes, neural networks and SVMs will only be covered briefly.</p>
<p>More at&nbsp;http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</p>
<p>More tutorial at&nbsp;</p>
<p><a href="http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm">http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm</a></p>
<p><a href="http://www.raetschlab.org/lectures/MLBioinformatics">http://www.raetschlab.org/lectures/MLBioinformatics</a></p>
<p><a href="http://www.raetschlab.org/lectures/bertinoro08">http://www.raetschlab.org/lectures/bertinoro08</a></p>
<p>Book at&nbsp;</p>
<p><a href="https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf">https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf</a></p><p>Address of the bookmark: <a href="http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/" rel="nofollow">http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43831/ten-quick-tips-for-deep-learning-in-biology</guid>
	<pubDate>Fri, 25 Mar 2022 18:35:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43831/ten-quick-tips-for-deep-learning-in-biology</link>
	<title><![CDATA[Ten quick tips for deep learning in biology]]></title>
	<description><![CDATA[<p><span>By taking a comprehensive and careful approach to deep learning based on critical thinking about research questions, planning to maintain rigor, and discerning how work might have far-reaching consequences with ethical dimensions, the life science community can advance reproducible, interpretable, and high-quality science that is enriching and beneficial for both scientists and society.</span></p><p>Address of the bookmark: <a href="https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1009803" rel="nofollow">https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1009803</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27479/biogps</guid>
	<pubDate>Mon, 23 May 2016 03:15:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27479/biogps</link>
	<title><![CDATA[BioGPS]]></title>
	<description><![CDATA[<p>A free&nbsp;<em>extensible</em>&nbsp;and&nbsp;<em>customizable</em>&nbsp;<strong>gene annotation portal</strong>, a complete resource for learning about&nbsp;<strong>gene and protein function</strong>.</p>
<p>http://biogps.org/#goto=welcome</p><p>Address of the bookmark: <a href="http://biogps.org/#goto=welcome" rel="nofollow">http://biogps.org/#goto=welcome</a></p>]]></description>
	<dc:creator>Anjana</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26543/breakseq2</guid>
	<pubDate>Mon, 29 Feb 2016 17:45:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26543/breakseq2</link>
	<title><![CDATA[BreakSeq2]]></title>
	<description><![CDATA[<p>Ultrafast and accurate nucleotide-resolution analysis of structural variants</p>
<p>More at http://bioinform.github.io/breakseq2/</p>
<p>Download BreakSeq2</p>
<p>Latest version: https://github.com/bioinform/breakseq2/archive/2.2.tar.gz<br><br>For other versions, see "releases". https://github.com/bioinform/breakseq2/releases</p><p>Address of the bookmark: <a href="http://bioinform.github.io/breakseq2/" rel="nofollow">http://bioinform.github.io/breakseq2/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31382/seqmule-automated-human-exomegenome-variants-detection</guid>
	<pubDate>Tue, 07 Mar 2017 10:12:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31382/seqmule-automated-human-exomegenome-variants-detection</link>
	<title><![CDATA[SeqMule: Automated human exome/genome variants detection]]></title>
	<description><![CDATA[<p><span>SeqMule takes single-end or paird-end FASTQ or BAM files, generates a script consisting of more than 10 popular alignment, analysis tools and runs the script line by line. Users can change the pipeline or fine-tune the parameters by modifying its configuration file. SeqMule also has some built-in functions, such as pooling consensus calls from various callers, plotting a Venn diagram showing intersection among different callers, and downloading databases. SeqMule can be used for both Mendelian disease study and cancer genome study.</span></p><p>Address of the bookmark: <a href="http://seqmule.openbioinformatics.org/en/latest/" rel="nofollow">http://seqmule.openbioinformatics.org/en/latest/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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>

</channel>
</rss>