<?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/42023?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/42023?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</guid>
	<pubDate>Tue, 17 Sep 2024 02:34:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</link>
	<title><![CDATA[SVbyEye: R Package to visualize alignments between two or multiple DNA sequences]]></title>
	<description><![CDATA[<p dir="auto">R Package to visualize alignments between two or multiple DNA sequences including<br>a number of functionalities to facilitate processing of alignments in PAF format.</p>
<p dir="auto"><span>SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence alignments along with various functionalities to process alignments in PAF format. The tool facilitates the characterization of complex SVs in the context of sequence homology helping resolve the mechanisms underlying their formation. Availability and implementation SVbyEye is available at https://github.com/daewoooo/SVbyEye.</span></p>
<p dir="auto">Author: David Porubsky</p><p>Address of the bookmark: <a href="https://github.com/daewoooo/SVbyEye" rel="nofollow">https://github.com/daewoooo/SVbyEye</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</guid>
	<pubDate>Thu, 28 Jan 2021 11:23:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/42693/dna-rna-meme</link>
	<title><![CDATA[DNA RNA MEME]]></title>
	<description><![CDATA[<p>Explain the DNA and RNA with picture ...</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/42693" length="41627" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</guid>
	<pubDate>Tue, 13 Aug 2024 07:16:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</link>
	<title><![CDATA[HELIANO: A fast and accurate tool for detection of Helitron-like elements]]></title>
	<description><![CDATA[<p><span>Helitron-like elements (HLE1 and HLE2) are DNA transposons. They have been found in diverse species and seem to play significant roles in the evolution of host genomes. Although known for over twenty years, Helitron sequences are still challenging to identify. Here, we propose HELIANO (Helitron-like elements annotator) as an efficient solution for detecting Helitron-like elements.</span></p>
<p>https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae679/7730539?login=true</p><p>Address of the bookmark: <a href="https://github.com/Zhenlisme/heliano/" rel="nofollow">https://github.com/Zhenlisme/heliano/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2645/dna-bending-propensity-in-the-presence-of-base-mismatches-implications-for-dna-repair</guid>
	<pubDate>Mon, 19 Aug 2013 16:01:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2645/dna-bending-propensity-in-the-presence-of-base-mismatches-implications-for-dna-repair</link>
	<title><![CDATA[DNA Bending Propensity in the Presence of Base Mismatches: Implications for DNA Repair]]></title>
	<description><![CDATA[<p>Understanding how the human body recognizes damaged DNA and initiates repair fascinates Michael Feig, professor of biochemistry and molecular biology at Michigan State University. Feig studies the proteins MutS and MSH2-MSH6, which recognize defective DNA and initiate DNA repair. Natural DNA repair occurs when proteins like MutS (the primary protein responsible for recognizing a variety of DNA mismatches) scan the DNA, identify a defect, and recruit other enzymes to carry out the actual repair.</p><p><em>Results from computer simulations show that it is energetically less expensive to bend mismatch-containing, defective DNA (G:T, C:C, C:T, G:A, G:G, T:T, A:A, A+:C) vs. non-defective DNA (containing A:T or G:C base pairs). DNA repair mechanisms likely take advantage of this feature to detect defective DNA based on an increased bending propensity.</em></p><p>http://www.tacc.utexas.edu/news/feature-stories/2013/how-dna-repair-helps-prevent-cancer</p><p>http://pubs.acs.org/doi/abs/10.1021/jp403127a</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4656/pandey-lab</guid>
  <pubDate>Fri, 20 Sep 2013 13:19:18 -0500</pubDate>
  <link></link>
  <title><![CDATA[Pandey Lab]]></title>
  <description><![CDATA[
<p>The Pandey Lab at Johns Hopkins University is a Systems Biology lab that combines molecular biology, analytical chemistry and computational biology with various "Omics" technologies including genomics and proteomics to understand signaling pathways and to identify therapeutic targets and biomarkers in a number of cancers.</p>

<p>More at http://pandeylab.igm.jhmi.edu/</p>

<p>http://scholar.google.com/citations?user=OhuG0FcAAAAJ&amp;hl=en</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13338/protein-function-annotation-and-machine-learning-upmc-paris-france</guid>
  <pubDate>Sat, 02 Aug 2014 01:22:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Protein function annotation and machine learning - UPMC - Paris, France]]></title>
  <description><![CDATA[
<p>Protein function annotation and machine learning - UPMC - Paris, France</p>

<p>Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.</p>

<p>We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.</p>

<p>Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>Start date: September 1st, 2014<br />Contact Person: Alessandra Carbone<br />Contact: alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/14302/bioinformatician-at-work</guid>
	<pubDate>Sat, 23 Aug 2014 04:44:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/14302/bioinformatician-at-work</link>
	<title><![CDATA[Bioinformatician at work !!!]]></title>
	<description><![CDATA[<p>Yet another peep up view of a bioinformatician research laboratory ...</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/14302" length="232751" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/19732/marine-bioinformatician</guid>
	<pubDate>Wed, 24 Dec 2014 05:17:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/19732/marine-bioinformatician</link>
	<title><![CDATA[Marine bioinformatician ;)]]></title>
	<description><![CDATA[<p>A marine bioinformatician at work. Sorry&nbsp;jealous biotechnologist, this is how we work.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/19732" length="35550" type="image/gif" />
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23122/candidates-required-in-bioinformatics-and-genomics-uk-only</guid>
  <pubDate>Fri, 03 Jul 2015 08:22:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Candidates required in Bioinformatics and Genomics UK ONLY]]></title>
  <description><![CDATA[
<p>I have various permanent positions available based in London, Manchester, Herftfordshire, Oxford and Belfast, as well as other areas throughout the UK.</p>

<p>If you are looking for a new opportunity and have skills within any sector of Bioinformatics with an IT skill then I would love to hear from you.  I have various exciting opportunities from programmers to researchers to scientists.</p>

<p>Call me now on 01772 278050 or email me your cv and requirements and I will call you back dareen.evans@itworkshealth.co.uk</p>
]]></description>
</item>

</channel>
</rss>