<?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/44479?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/44479?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26827/kamaleshwar-singh-lab</guid>
  <pubDate>Fri, 25 Mar 2016 10:46:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Kamaleshwar Singh Lab]]></title>
  <description><![CDATA[
<p>The focus of Dr. Singh’s research and teaching is on the molecular mechanistic basis for environmental carcinogen-induced genetic (DNA damage) and epigenetic changes, and susceptibility to human cancer development</p>

<p>More at http://www.tiehh.ttu.edu/dr.-kamaleshwar-singh.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</guid>
	<pubDate>Wed, 12 Dec 2018 09:16:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</link>
	<title><![CDATA[KOALA: KEGG&#039;s internal annotation tool for K number assignment of KEGG GENES using SSEARCH computation]]></title>
	<description><![CDATA[<p>KOALA (KEGG Orthology And Links Annotation) is KEGG's internal annotation tool for&nbsp;<a href="https://www.kegg.jp/kegg/ko.html">K number</a>&nbsp;assignment of KEGG GENES using SSEARCH computation. BlastKOALA and GhostKOALA assign K numbers to the user's sequence data by&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/">BLAST</a>&nbsp;and&nbsp;<a href="http://www.bi.cs.titech.ac.jp/ghostx/">GHOSTX</a>&nbsp;searches, respectively, against a nonredundant set of KEGG GENES. Annotate Sequence in KEGG Mapper and Pathogen Checker in KEGG Pathogen are special interfaces to the BlastKOALA server and can be executed in an interactive mode. &nbsp;&nbsp; See&nbsp;<a href="https://www.kegg.jp/blastkoala/help_blastkoala.html" target="_blastkoala">Step-by-step Instructions</a>.</p>
<div>Reference: Kanehisa, M., Sato, Y., and Morishima, K. (2016) BlastKOALA and GhostKOALA: KEGG tools for functional characterization of genome and metagenome sequences. J. Mol. Biol. 428, 726-731. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/26585406">pubmed</a>] [<a href="https://doi.org/10.1016/j.jmb.2015.11.006">pdf</a>]</div><p>Address of the bookmark: <a href="https://www.kegg.jp/blastkoala/" rel="nofollow">https://www.kegg.jp/blastkoala/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</guid>
	<pubDate>Wed, 17 Jul 2013 16:16:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/991/master-thesis-trans-membrane-topology-prediction-through-markov-based-decoders</link>
	<title><![CDATA[Master Thesis: Trans-membrane topology prediction through Markov based decoders]]></title>
	<description><![CDATA[<p dir="ltr"><span>Abstract:</span></p><p dir="ltr"><span></span><span>Background/Motivation: </span></p><p dir="ltr"><span>The dearth of structural information on alpha helical membrane protein (MPs) has hindered thus far the development of reliable knowledge &ndash;based potentials that can be used for automatic prediction of trans-membrane (TM) protein structure. While algorithm for identification of TM segments is available, modelling of the domains of alpha helical MPs involves assembling the segments into a bundle. This requires the correct assignment of the buried and lipid-exposed faces of the TM domains.</span><span>&nbsp;</span></p><p dir="ltr"><span>Results: </span><span><span><span>In a cross validated test on single sequences, our trans-membrane MM, correctly predicts the entire topology for 77% of the sequences in a standard dataset of 86 proteins with supervised topology. These results compare favorably with existing methods.</span></span></span><span>&nbsp;</span></p><p dir="ltr"><span><strong>Source Code</strong>: Matlab</span></p><p dir="ltr"><span></span><span>Conclusion/Implementation</span><span><span><span>: Here discriminant data mining approach was used to predict the location and orientation of alpha helices in membrane-spanning proteins. It is based on a first order Markov model (MM) with an architecture that corresponds closely to the biological systems. The model is enriched with three types of states for the loop on the cytoplasmic side (outer loop), loop for the non-cytoplasmic side (inner side), and trans-membrane part. The closed association between the biological and Markov states allows us to infer which part of the model architecture are important to capture the information which encodes the membrane topology, and gain a better understanding of the mechanism and constraints involved. Predictor Model was established by various &nbsp;Markov decoder , and assignment of the membrane helix boundaries was apparent.</span></span></span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/991" length="161792" type="application/vnd.ms-powerpoint" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33660/equant-energy-based-quality-assessment-of-protein</guid>
	<pubDate>Sat, 24 Jun 2017 19:24:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33660/equant-energy-based-quality-assessment-of-protein</link>
	<title><![CDATA[eQuant : energy-based quality assessment of protein]]></title>
	<description><![CDATA[<p><span>Protein structures are of varying quality. Especially,&nbsp;</span><em>in-silico</em><span>&nbsp;modeled structures are prone to contain serious errors, which limit the usefulness and reliability of these particular protein structures.</span><br><br><span>eQuant is a service for structure quality assessment of single proteins, which utilizes a coarse-grained energy model. The overall quality is calculated as well as the reliability of individual residues. You can submit single PDB files or archives containing a set of proteins.</span></p>
<p>https://biosciences.hs-mittweida.de/equant/</p><p>Address of the bookmark: <a href="https://biosciences.hs-mittweida.de/equant/" rel="nofollow">https://biosciences.hs-mittweida.de/equant/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</guid>
	<pubDate>Mon, 10 Sep 2018 13:21:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</link>
	<title><![CDATA[STRUM: structure-based prediction of protein stability changes upon single-point mutation]]></title>
	<description><![CDATA[<p><span>STRUM is a method for predicting the fold stability change (&Delta;&Delta;G) of protein molecules upon single-point nsSNP mutations. STRUM adopts a gradient boosting regression approch to train the Gibbs free-energy changes on a variety of features at different levels of sequence and structure properties. The unique characteristics of STRUM is the combination of sequence profiles with low-resolution structure models from protein structure prediction, which helps enhance the robustness and accuracy of the method and make it applicable to various protein seqences, including those without experimental structures&nbsp;</span></p><p>Address of the bookmark: <a href="https://zhanglab.ccmb.med.umich.edu/STRUM/" rel="nofollow">https://zhanglab.ccmb.med.umich.edu/STRUM/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41231/phd-student-bio-informatician-in-computational-protein-modeling</guid>
  <pubDate>Sun, 23 Feb 2020 03:46:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD student / Bio-informatician in computational protein modeling]]></title>
  <description><![CDATA[
<p>PhD student / Bio-informatician in computational protein modeling<br />Job Profile<br />You will perform research on drug/protein interaction analysis in the context of lung cancer, using computational protein modeling. You will implement existing models predicting drug efficacy, related to EGFR-driven cancer. You will translate these models to novel oncogenes, including ROS1. You will validate these models against experimental data from a parallel project, with the final goal of deployment of your methods into clinical decision making. Your work will be embedded in an international network consisting of both academic partners and ROS1-NSCLC patient organizations.</p>

<p>Requirements</p>

<p>You are (or soon will be) a master in bio-informatics. You have strong ICT skills and you are eager to fully submerge into the world of protein modeling. You have good experience with Linux and one or more programming languages as well as knowledge of tertiary structure analysis. Candidates with a Master degree in one of the life sciences (Biomedical sciences, Biochemistry, Bio-engineering, Biostatistics, …), with relevant interest and extended experience in this field are also welcome. A general background cancer biology and genetics is needed. You are willing and eligible to apply for a personal PhD fellowship with the Flemish FWO (FWO.be). Therefore, it is required that you hold a master degree from a European university, and have not obtained your master diploma more than three years ago (see FWO website for detailed conditions). Proficiency in English, and good communication skills, both oral and written, are required. You are highly motivated, and you like to work in an interactive research team. You are willing to work on a 4-year PhD project starting beginning of 2020.</p>

<p>What we offer</p>

<p>We offer a one year position, as a PhD student, which can be extended up to 4 year upon positive evaluation, even if a personal fellowship application is not successful. Wages are according to the standard Flemish bursary levels for PhD students.</p>

<p>Interested?<br />For additional information please contact dr. Geert Vandeweyer. To apply, send a copy of your CV including details of your relevant skills and a motivation letter by e-mail to dr. Geert Vandeweyer (geert.vandeweyer@uantwerpen.be) before March 15, 2020.</p>

<p>Source:https://academicpositions.be/ad/university-of-antwerp/2020/phd-student-bio-informatician-in-computational-protein-modeling/141252?utm_source=jooble&amp;utm_medium=cpc&amp;utm_campaign=jooble</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4295/rcsb-pdb-sept13-release</guid>
	<pubDate>Thu, 05 Sep 2013 15:07:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4295/rcsb-pdb-sept13-release</link>
	<title><![CDATA[RCSB PDB Sept'13 Release]]></title>
	<description><![CDATA[<p>RCSB PDB Sept'13 Release offers following new features:</p><p>- New tools to search for drugs and drug targets<br />- Improved interface for 3D visualisation using Jmol/JSmol<br />- An update to the representation of protein symmetry and stoichiometry.<br />- Improvements when performing sequence searches.</p><p>Reference</p><p><a href="http://www.rcsb.org/pdb/static.do?p=general_information/whats_new.jsp?b=1308">http://www.rcsb.org/pdb/static.do?p=general_information/whats_new.jsp?b=1308</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5210/sandelin-group</guid>
  <pubDate>Mon, 30 Sep 2013 19:12:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Sandelin group]]></title>
  <description><![CDATA[
<p>Sandelin group have a deep interest in most biology, but focus on gene regulation and the many areas that are connected with this, including transcriptomics, epigenetics and technological and informatics aspects.</p>

<p>The group is both computational and experimental.</p>

<p>We ask biological questions to large datasets made using novel genomics techniques, with the help of computers. One of the strengths in the group are the many connections to high-profile experimental laboratories which supply data to be analyzed.</p>

<p>Lab webpage @ http://people.binf.ku.dk/albin/Sandelin_group_at_the_Bioinformatic_Centre/The_Sandelin_group.html</p>
]]></description>
</item>

</channel>
</rss>