<?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/27323?offset=1150</link>
	<atom:link href="https://bioinformaticsonline.com/related/27323?offset=1150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17176/arvados</guid>
	<pubDate>Sat, 20 Sep 2014 16:54:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17176/arvados</link>
	<title><![CDATA[Arvados]]></title>
	<description><![CDATA[<p>Arvados is a free and open&nbsp;source bioinformatics&nbsp;platform for genomic and&nbsp;biomedical data. User can&nbsp;Store | Organize | Compute | Share the data for free.&nbsp;</p>
<p><img src="https://arvados.org/images/dax.png" width="400" height="535" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://arvados.org/" rel="nofollow">https://arvados.org/</a></p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</guid>
	<pubDate>Tue, 05 Jun 2018 10:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</link>
	<title><![CDATA[Cerulean: A hybrid assembly using high throughput short and long reads]]></title>
	<description><![CDATA[Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads.

Cerulean v0.1 has been implemented with bacterial genomes in mind.

The method is fully described in Deshpande, V., Fung, E. D., Pham, S., &amp; Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933.
http://arxiv.org/abs/1307.7933<p>Address of the bookmark: <a href="https://sourceforge.net/projects/ceruleanassembler/" rel="nofollow">https://sourceforge.net/projects/ceruleanassembler/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<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/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</guid>
	<pubDate>Fri, 29 Jun 2018 09:19:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</link>
	<title><![CDATA[JBrowse: Embeddable genome browser built completely with JavaScript and HTML5]]></title>
	<description><![CDATA[JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl.

Headline Features:
Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed.
Scales easily to multi-gigabase genomes and deep-coverage sequencing.
Quickly open and view data files on your computer without uploading them to any server.
Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more.  BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed.
Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks.
Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance.
Can run as a stand-alone app on OSX and Windows using the Electron platform
Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry

https://jbrowse.org/<p>Address of the bookmark: <a href="https://github.com/GMOD/jbrowse" rel="nofollow">https://github.com/GMOD/jbrowse</a></p>]]></description>
	<dc:creator>Jit</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/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/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/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>

</channel>
</rss>