<?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/41881?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/41881?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</guid>
	<pubDate>Thu, 04 Jun 2020 23:19:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</link>
	<title><![CDATA[HNADOCK: a nucleic acid docking server for modeling RNA/DNA–RNA/DNA 3D complex structures]]></title>
	<description><![CDATA[<p><span>The HNADOCK server is to predict the binding complex structure between two nucleic acid molecules through a hierarchical docking algorihtm of an FFT-based global search strategy and an intrinsic scoring function for nucleic acid interactions. Users are required to provide the three-dimensional (3D) structures of the two molecules to be docked.&nbsp;</span></p><p>Address of the bookmark: <a href="http://huanglab.phys.hust.edu.cn/hnadock/" rel="nofollow">http://huanglab.phys.hust.edu.cn/hnadock/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/40566/the-el-sherif-group-chair-of-developmental-biology-department-of-biology-phd-position</guid>
  <pubDate>Sun, 19 Jan 2020 10:06:37 -0600</pubDate>
  <link></link>
  <title><![CDATA[The El-Sherif Group, Chair of Developmental Biology, Department of Biology - PhD Position]]></title>
  <description><![CDATA[
<p>El-Sherif lab studies how genes are regulated to mediate patterning in Development. We use live and super-resolution imaging in addition to computational modeling to understand transcription dynamics at the single-cell level in three model systems: the fruit fly Drosophila melanogaster, the beetle Tribolium castaneum, and embryonic bodies derived from embryonic mouse stem cells.</p>

<p>In this project, you will use single-molecule techniques to label mRNA and DNA in (live and fixed) Drosophila embryos and fixed embryonic bodies. You will also use super-resolution microscopy to visualize protein condensates. Co-localization dynamics reflecting DNA-protein bindings and DNA looping events will be detected, analyzed, and used to test computational models of gene transcription.</p>

<p>Qualification:<br />MSc degree (or equivalent) in Biology, Biophysics, or Bioengineering</p>

<p>Experience in one or more of these areas: (1) molecular cloning, (2) imaging, (3) image analysis (using Matlab/Python/Java), (4) microfluidics, and (5) computational modeling.</p>

<p>How to Apply?<br />Send (1) your CV, (2) summary of research experience, and (3) email addresses of at least 2 references to ezzat.el-sherif@fau.de. Title your email ‘Transcription PhD Position’.</p>

<p>salary Grade.: E13<br />Total Time: 3 Jahre<br />Start: 01.01.2020.<br />End: 31.3.2020.</p>

<p>Address:<br />Dr. El-Sherif, Ezzat<br />Department Biologie<br />Professur für Zoologie (Entwicklungsbiologie) (Prof. Dr. Klingler)<br />Telefon 09131/85-28068, Fax 09131/85-28040, E-Mail: ezzat.el-sherif@fau.de</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</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/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/39728/patterns-a-modeling-tool-dedicated-to-biological-network-modeling</guid>
	<pubDate>Fri, 26 Jul 2019 01:11:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39728/patterns-a-modeling-tool-dedicated-to-biological-network-modeling</link>
	<title><![CDATA[Patterns: a modeling tool dedicated to biological network modeling]]></title>
	<description><![CDATA[<p>It is designed to work with <strong>patterned data</strong>. Famous examples of problems related to patterned data are:</p>
<ul>
<li>recovering <strong>signals</strong> in networks after a <strong>stimulation</strong> (cascade network reverse engineering),</li>
<li>analysing <strong>periodic signals</strong>.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/fbertran/Patterns" rel="nofollow">https://github.com/fbertran/Patterns</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6130/rna-bioinformatics-and-high-throughput-analysis-jena</guid>
  <pubDate>Sat, 09 Nov 2013 20:03:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RNA Bioinformatics and High Throughput Analysis Jena]]></title>
  <description><![CDATA[
<p>Research Topics:</p>

<p>High Throughput Sequencing Analysis<br />Comparative Genomics<br />Identification and Annotation of Non-coding RNAs<br />Bioinformatic Analysis and System Biology of Viruses<br />Coevolution of Proteins and RNAs<br />Algorithmic Bioinformatics<br />Phylogenetic Analysis</p>

<p>http://www.rna.uni-jena.de/index.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</guid>
	<pubDate>Sat, 22 Jun 2019 12:16:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39640/flas-fast-and-high-throughput-algorithm-for-pacbio-long-read-self-correction</link>
	<title><![CDATA[FLAS: fast and high throughput algorithm for PacBio long read self-correction.]]></title>
	<description><![CDATA[<p><span>FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/baoe/flas" rel="nofollow">https://github.com/baoe/flas</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>