<?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/29586?offset=810</link>
	<atom:link href="https://bioinformaticsonline.com/related/29586?offset=810" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18819/jrfsrf-at-jawaharlal-nehru-institute-ofadvanced-studies-jnias-hyderabad</guid>
  <pubDate>Fri, 31 Oct 2014 08:48:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF/SRF at Jawaharlal Nehru Institute ofAdvanced Studies (JNIAS), Hyderabad]]></title>
  <description><![CDATA[
<p>Applications for Academic Projects in Biotechnology, Bioinformatics, Environmental Sciences and Computer Science &amp; Engineering</p>

<p>About JNIAS<br />Jawaharlal Nehru Institute of Advanced Studies (JNIAS), Hyderabad has been established by Dr. D. Swaminadhan Research Foundation (DSRF), Hyderabad as a Research and Educational Institution with a view to contribute in developing advanced technologies and build „core competence‟ in specific areas. The activities of JNIAS involves: Education, Research Training and Innovations in the fields of Sciences, Technologies, Humanities and Social Sciences. It aims to blossom into an Advanced Institute of education and research with a reservoir of expertise and experience in the relevant fields and the necessary capability to harness multi-disciplinary research and studies. JNIAS has been recognized as an Advanced Research Institute by Jawaharlal Nehru Technological University Hyderabad (JNTUH), Hyderabad and Jawaharlal Nehru Technological University Anantapur (JNTUA), for offering Ph.D., P.G M.Phil, P.G Diploma and Training Programmes in Sciences and Engineering &amp; Technology.</p>

<p>Jawaharlal Nehru Architecture and Fine Arts University (JNAFAU) Hyderabad also recognized JNIAS for offering UG, PG degree in Architecture.</p>

<p>Projects &amp; Facilities</p>

<p>JNIAS offers wide range of projects:</p>

<p>Biotechnology area:</p>

<p>Molecular Biology<br />Microbiology<br />Nanotechnology<br />Bioinformatics (Schrodinger Software)<br />In Silico studies &amp; Drug Designing<br />Sequence analysis<br />Protein structure function studies</p>

<p>Registration<br />Tuition Fees: Interested students need to pay the following tuition fees:<br />1. Six Month’s Project: Rs. 20,000/-<br />2. Four Month’s Project: Rs. 15,000/-<br />3. Three Month’s Project: Rs. 10,000/-<br />4. One Month - Hands on Training : Rs. 8,000/-</p>

<p>For enquires call:<br />91-7893203414 (Biotechnology), 91-9949582263 (Environmental Sciences) 91-8977369305 (Computer Science)</p>

<p>Interested student may download the application from the website (www.jnias.in) and send the hard copy of the completed application forms and Curriculum Vitae along with the Demand Draft drawn on any nationalized Banks in favor of “The Registrar, JNIAS, Secunderabad”. Application forms can be sent through email to academicprojects@jnias.in</p>

<p>Address<br />Jawaharlal Nehru Institute of Advanced Studies (JNIAS)<br />6th Floor, Buddha Bhavan, M.G Road,<br />Secunderabad - 500 003<br />Andhra Pradesh, India<br />Tele/Fax: 040- 27541551; 27541553<br />Mobile: 08885541554<br />Web site: www.jnias.in</p>

<p>Brochure : https://drive.google.com/file/d/0B3zPwhgA-u-nU0dyMFd2OWcxNUpSTWNYc0xDSGs5UDI4UDNB/view?usp=sharing</p>
]]></description>
</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/18382/google-genomics</guid>
	<pubDate>Fri, 17 Oct 2014 02:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/18382/google-genomics</link>
	<title><![CDATA[Google Genomics]]></title>
	<description><![CDATA[<p>Google Genomics provides an API to store, process, explore, and share DNA sequence reads, reference-based alignments, and variant calls, using Google's cloud infrastructure.</p>
<ul>
<li><strong>Store</strong> alignments and variant calls for one genome or a million.</li>
<li><strong>Process</strong> genomic data in batch by running principal component analysis or Hardy-Weinberg equilibrium, in minutes or hours, by using parallel computing frameworks like MapReduce.</li>
<li><strong>Explore</strong> data by slicing alignments and variants by genomic range across one or multiple samples -- for your own algorithms or for visualization; or interactively process entire cohorts to find transition/transversion ratios, allelic frequency, genome-wide association and more using BigQuery.</li>
<li><strong>Share</strong> genomic data with your research group, collaborators, the broader community, or the public. You decide.</li>
</ul>
<p>Google Genomics is implementing the API defined by the <a href="http://genomicsandhealth.org/">Global Alliance for Genomics and Health</a> for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.</p><p>Address of the bookmark: <a href="https://cloud.google.com/genomics/" rel="nofollow">https://cloud.google.com/genomics/</a></p>]]></description>
	<dc:creator>Reshma Khatun</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18578/research-scientist-%E2%80%93-national-institute-of-cholera-and-enteric-diseases</guid>
  <pubDate>Wed, 22 Oct 2014 10:26:46 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – National Institute of Cholera and Enteric Diseases]]></title>
  <description><![CDATA[
<p>The following post is to be filled up on purely temporary basis under the project entitled "Second phase of Task Force Biomedical Informatics Center of ICMR" under Dr. Santasabuj Das, Scientist 'D' of this Institute:-</p>

<p>01. Scientist II 01<br />Essential: Ph.D. degree in Life Sciences from a recognized university along with a minimum of 2 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>OR<br />Ph.D. degree in Bioinformatics from a recognized university.</p>

<p>OR<br />M.Sc. in Bioinformatics from a recognized university along with a minimum of 3 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>Desirable:<br />Thorough Knowledge about In silico genome analysis and comparative genomics.<br />Experience with in silico identification of novel virulence factors of pathogens, host-pathogen interactions and Systems Biology.<br />Additional Postdoctoral research experience in relevant subjects from a recognized institutions.</p>

<p>Rs. 44,000/- p.m. (consolidated) plus 30% HRA</p>

<p>Below 40 years</p>

<p>Applications along with Bio-Data containing detail work experience and full list of publications may be sent via email tosantasabujdas@yahoo.com latest by October 27, 2014.</p>

<p>Short-listed candidates will be called via email for an interview to be held at the institute in the second week of November, 2014.</p>

<p>Advertisement: www.niced.org.in/placements.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18866/celebrating-crystallography-an-animated-adventure</guid>
	<pubDate>Fri, 31 Oct 2014 15:59:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18866/celebrating-crystallography-an-animated-adventure</link>
	<title><![CDATA[Celebrating Crystallography - An animated adventure]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/uqQlwYv8VQI" frameborder="0" allowfullscreen></iframe>NEW: Now with French or Spanish subtitles (click on the 'Captions' icon to select). Plus... Watch the French language version here: https://www.youtube.com/watch?v=PvLu7BOsJhM

X-ray crystallography is arguably one of the greatest innovations of the twentieth century, but not that many people know what it is or how it came about.

Join us on an animated journey through the 100 year history of crystallography -- from the pioneering work of William and Lawrence Bragg in 1913 to the surface of Mars!

Narrated by structural biologist Stephen Curry and produced by animation company 12foot6, the film explores the extraordinary history of crystallography. To date 28 Nobel Prizes have been awarded to projects related to the field and X-ray crystallography remains the foremost technique in determining the structures of a huge range of complex molecules.

This film was produced in celebration of the Bragg Centenary and was funded by STFC.

Watch more science videos on the amazing Ri Channel: http://richannel.org

Watch more animations from 12foot6: http://12foot6.com/

The Ri is on Twitter: http://twitter.com/ri_science
and Facebook: http://www.facebook.com/royalinstitution
Subscribe for the latest science videos: http://richannel.org/newsletter]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19086/postdoctoral-fellowship-in-bioinformatics</guid>
  <pubDate>Sat, 08 Nov 2014 14:41:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral fellowship in Bioinformatics]]></title>
  <description><![CDATA[
<p>A two-year post-doctoral position is available in the Biocomputing group of the Sapienza University led by Anna Tramontano to work on either genomics research or structural bioinformatics, focusing on the study of relevant biomedical problems.<br />The ideal candidate should be motivated and talented, hold a PhD degree, have good programming skills, a grasp of statistical methods and an understanding of biology.<br />Experience in the development of computational biology methods would be an added value.</p>

<p>Good communication skills and fluency in spoken and written English are required.<br />Please apply sending a curriculum vitae, the names of at least two referees and a letter of motivation describing past experience and future goals to anna.tramontano@uniroma1.it with subject: “Application for post-doctoral position November 2014 YOUR LAST NAME”</p>

<p>Deadline: No later than November 28th, 2014.<br />Duration: 2 years</p>

<p>Salary on grant: Commeasured to the experience of the candidate<br />Contact Person (Referent): Anna Tramontano<br />Ref. E-Mail: anna.tramontano@uniroma1.it<br />Group Web Page: http:/www.biocomputing.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>