<?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/30147?offset=1120</link>
	<atom:link href="https://bioinformaticsonline.com/related/30147?offset=1120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27477/cytoscape</guid>
	<pubDate>Mon, 23 May 2016 02:32:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27477/cytoscape</link>
	<title><![CDATA[Cytoscape]]></title>
	<description><![CDATA[<p>Cytoscape is an <a href="http://www.cytoscape.org/download.php">open source</a> software platform for visualizing complex networks and integrating these with any type of attribute data. A lot of <a href="http://apps.cytoscape.org/"><em>Apps</em></a> are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.</p><p>Address of the bookmark: <a href="http://www.cytoscape.org/" rel="nofollow">http://www.cytoscape.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27549/ra-at-university-of-hyderabad</guid>
  <pubDate>Sun, 29 May 2016 11:50:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at UNIVERSITY OF HYDERABAD]]></title>
  <description><![CDATA[
<p>UNIVERSITY OF HYDERABAD</p>

<p>School of Life Sciences</p>

<p>Department of Animal Biology</p>

<p>Applications are invited on a plane paper (along with copies of educational qualifications and experience) from eligible candidates for the selection of following position to work under a collaborative research project entitled “Development and application of high resolution genome conformation capture technology to investigate genome architecture in space and time” between University of Hyderabad and CR Rao advanced Institute of Mathematics, Statistics and Computer Sciences, sponsored by Department of Biotechnology, Government of India, New Delhi</p>

<p>Name and No. of positions JRF‐ONE</p>

<p>Emoluments for the position Rs. 25,000/p.m. + Eligible HRA</p>

<p>Qualifications MSc or M.Tech in any branch of biology/bioinformatics/computational biology/computer sciences/Mathematics/Physics</p>

<p>Duration Appointments are made initially for ONE year and can be extended further TWO years or until the duration of project</p>

<p>Our laboratory is interested in understanding signalling and spatiotemporal dynamics of 3‐Dimensional genome architecture and gene expression during embryonic stem cell differentiation by utilizing a combination of cellular, molecular genetics, Biochemical and computational tools in combination with next generation sequencing based chromatin structure analysing methods. Successful candidates shall pursue project related to either experimental or computational analysis of genome and Epigenomics data derived from human and mouse cells. Experience in Computational biology, bioinformatics, statistics, machine learning and algorithmic development is required. Knowledge of programming languages (e.g. C, C++, Perl, Python, Ruby etc.) and statistical framework (e.g. R, matlab, etc.) is preferable. Basic understanding of molecular biology will be an added advantage.</p>

<p>Interested candidates with the above mentioned qualification can send their curriculum vitae to   Dr. K. Sreenivasulu, Department of Animal Biology, School of Life Sciences, South campus, University of Hyderabad or via email at positionssklab@gmail.com or svksl@uohyd.ernet.in.</p>

<p>Candidates with CSIR/UGC/ICMR/DBT/BINC qualifications if interested in above mentioned area of research are welcomed to approch principal investigator for a position leading to PhD. Last date for submission of applications is 17/06/2016. Eligible candidates will be called for an interview and they should carry all original certificates of the qualifying exam. No TA/ DA will be paid for attending the interview or at the time of joining the post.</p>

<p>Advertisement: http://www.uohyd.ac.in/images/recruitment/jrf_260516.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</guid>
	<pubDate>Fri, 03 Jun 2016 05:06:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</link>
	<title><![CDATA[HistoneDB 2.0 – with variants]]></title>
	<description><![CDATA[<p><span>This histone database can be used to explore the diversity of histone proteins and their sequence variants in many organisms. The resource was established to better understand how sequence variation may affect functional and structural features of nucleosomes. To get started, select a histone type to explore its variants.</span></p>
<p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</span></p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/" rel="nofollow">http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27827/guest-faculty-centre-for-bioinformatics-at-pondicherry-university</guid>
  <pubDate>Wed, 15 Jun 2016 03:44:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Guest Faculty Centre for Bioinformatics at Pondicherry University]]></title>
  <description><![CDATA[
<p>Guest Faculty Centre For Bioinformatics Jobs opportunity in Pondicherry University<br />Qualification : M.Phil. (with NET/SLET)/ M.Tech. / M.E. in Computer Science with a minimum of 55% of marks as per UGC norms.<br />Desirable : Ph.D and Teaching experience in Perl and Java programming.<br />Honorarium : Rs. 1,000/- per lecture (subject to a maximum of Rs. 25,000/- per month)<br />How to apply<br />Walk-in-Interview will be held on 29.06.2016 (Wednesday) at 2:30 P.M at the office of Centre for Bioinformatics, Pondicherry University, Puducherry — 605 014. Interested eligible candidates may attend the Walk-in-Interview along with all original certificates, self attested photocopies and testimonials with a copy of their bio-data. Candidates reporting after 2:30 P.M will not be entertained.</p>

<p>More at http://www.pondiuni.edu.in/news?quicktabs_2=5#quicktabs-2</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27847/anvio</guid>
	<pubDate>Thu, 16 Jun 2016 18:15:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27847/anvio</link>
	<title><![CDATA[Anvio]]></title>
	<description><![CDATA[<p>In a nutshell</p>
<p>Anvi&rsquo;o is an analysis and visualization platform for &lsquo;omics data.</p>
<p>Please find the methods paper here: https://peerj.com/articles/1319/</p>
<p>Anvi&rsquo;o would not have been possible without the help of many people who directly or indirectly contributed to its development. Here is the acknowledgements section of our methods paper</p>
<p><span>An analysis and visualization platform for 'omics data</span><span>&nbsp;</span><span><a href="http://merenlab.org/projects/anvio">http://merenlab.org/projects/anvio</a></span></p>
<p><span>Paper&nbsp;https://peerj.com/articles/1839/</span></p><p>Address of the bookmark: <a href="https://github.com/meren/anvio" rel="nofollow">https://github.com/meren/anvio</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</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/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27973/wgsim</guid>
	<pubDate>Thu, 23 Jun 2016 07:26:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27973/wgsim</link>
	<title><![CDATA[WgSim]]></title>
	<description><![CDATA[<p>Reads simulator</p>
<p>Wgsim is a small tool for simulating sequence reads from a reference genome. It is able to simulate diploid genomes with SNPs and insertion/deletion (INDEL) polymorphisms, and simulate reads with uniform substitution sequencing errors. It does not generate INDEL sequencing errors, but this can be partly compensated by simulating INDEL polymorphisms.<br><br>Wgsim outputs the simulated polymorphisms, and writes the true read coordinates as well as the number of polymorphisms and sequencing errors in read names. One can evaluate the accuracy of a mapper or a SNP caller with wgsim_eval.pl that comes with the package.<br><br></p><p>Address of the bookmark: <a href="https://github.com/lh3/wgsim" rel="nofollow">https://github.com/lh3/wgsim</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</guid>
	<pubDate>Mon, 27 Jun 2016 10:44:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</link>
	<title><![CDATA[QuIN’s web server]]></title>
	<description><![CDATA[<p><span>Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for mapping interactions between DNA regions, e.g., ChIA-PET and HiC, can generate genome-wide maps of interactions between regulatory elements. These interaction datasets are important resources to infer distal gene targets of non-coding regulatory elements and to facilitate prioritization of critical loci for important cellular functions. With the increasing diversity and complexity of genomic information and public ontologies, making sense of these datasets demands integrative and easy-to-use software tools. Moreover, network representation of chromatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no software that can take full advantage of network theory approaches for the analysis of chromatin interaction datasets. To fill this gap, we developed a web-based application, QuIN, which enables: 1) building and visualizing chromatin interaction networks, 2) annotating networks with user-provided private and publicly available functional genomics and interaction datasets, 3) querying network components based on gene name or chromosome location, and 4) utilizing network based measures to identify and prioritize critical regulatory targets and their direct and indirect interactions.&nbsp;</span></p>
<p><strong>AVAILABILITY:</strong><span>&nbsp;QuIN&rsquo;s web server is available at&nbsp;</span><a href="http://quin.jax.org/">http://quin.jax.org</a><span>&nbsp;QuIN is developed in Java and JavaScript, utilizing an Apache Tomcat web server and MySQL database and the source code is available under the GPLV3 license available on GitHub:</span><a href="https://github.com/UcarLab/QuIN/">https://github.com/UcarLab/QuIN/</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>