<?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/27440?offset=1050</link>
	<atom:link href="https://bioinformaticsonline.com/related/27440?offset=1050" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</guid>
	<pubDate>Thu, 26 Jul 2018 04:51:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</link>
	<title><![CDATA[Nanopolis: polish a genome assembly]]></title>
	<description><![CDATA[<p><span>Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome and more (see Nanopolish modules, below).</span></p>
<p>Quickstart</p>
<p>http://nanopolish.readthedocs.io/en/latest/quickstart_consensus.html</p>
<p>Algorithms</p>
<p>http://simpsonlab.github.io/2017/06/30/nanopolish-v0.7.0/</p><p>Address of the bookmark: <a href="https://github.com/jts/nanopolish" rel="nofollow">https://github.com/jts/nanopolish</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17187/urdip-bioinformatics-rajrf-vacancies</guid>
  <pubDate>Sat, 20 Sep 2014 20:52:56 -0500</pubDate>
  <link></link>
  <title><![CDATA[URDIP Bioinformatics RA/JRF Vacancies]]></title>
  <description><![CDATA[
<p>CSIR - UNIT FOR RESEARCH AND DEVELOPMENT OF INFORMATION PRODUCTS (CSIR- URDIP)</p>

<p>Adv. No. URDIP/ 6/2014</p>

<p>Opportunity for young Bioinformatics Professionals to make a career in the area of Intellectual Property CSIR has set up a Unit for Research and Development of Information Products (CSIR-URDIP) at Pune to work in the area of scientific informatics. One of the major focus areas of research work at CSIR-URDIP is PATENT INFORMATICS. With the increasing applications of Bioinformatics in the areas of life sciences industry such as Agriculture and Health Care (Diagnostics and Drugs), the output of research in these area is being protected by different forms of Intellectual Property rights. Realizing the importance of IP in the Bioinformatics field, Department of Biotechnology (DBT) has sanctioned a project on “Development, Facilitation and Harvesting of Bioinformatics related Intellectual Property” at CSIR-URDIP.</p>

<p>The project will involve application of Patent Informatics tools and techniques to Bioinformatics (including creation of patent landscapes, preparation of techno-legal reports of patentability, freedom to operate studies) to help protect IPRs and develop and conduct training programmes on IPRs related to Bioinformatics.</p>

<p>CSIR-URDIP invites applications from young Bioinformatics professionals to work on this emerging area which offers challenging opportunities and attractive career possibilities in future.</p>

<p>Position I: Research Associate</p>

<p>No of Positions: One</p>

<p>Consolidated amount Payable: Rs. 22,000/- per month + 20% HRA= Rs.26,400</p>

<p>Qualification:  PhD in Bioinformatics. In exceptional cases, candidature of M. Tech. candidates with First class in Bioinformatics with three years of relevant work experience will also be considered.</p>

<p>Age Limit: 35 years. The age should not exceed the limit indicated as on a closing date of receipt of completed application form.</p>

<p>Upper age limit is relaxable for 5 years for SC/ST, OBC, Physically handicapped and female candidates as per CSIR/Government of India rules.</p>

<p>Position II: Junior Research Fellow</p>

<p>No of Positions: one</p>

<p>Consolidated amount Payable: Rs. 16,000/- + 20% HRA = 19,200</p>

<p>Qualification: M.Sc / BE or equivalent in Bioinformatics with minimum of 55% marks in aggregate Job requirement: Scientific literature and patent search, analysis and Report Writing</p>

<p>Preference: Preference will be given to candidates with knowledge of patents and or 1-2 years of experience + Knowledge of Computers (MS Excel + Word Processing)</p>

<p>Age Limit: 28 years. The age should not exceed the limit indicated as on a closing date of receipt of completed application form.</p>

<p>For details please visit our website (www.urdip.res.in/careers) for further details and apply online by 30th September, 2014.</p>

<p>Advertisement: http://www.urdip.res.in/download/Advt6_2014.pdf</p>
]]></description>
</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/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</guid>
	<pubDate>Fri, 24 Jan 2020 04:09:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</link>
	<title><![CDATA[MitoZ: a toolkit for animal mitochondrial genome assembly, annotation and visualization]]></title>
	<description><![CDATA[<p><span>MitoZ is a Python3-based toolkit which aims to automatically filter pair-end raw data (fastq files), assemble genome, search for mitogenome sequences from the genome assembly result, annotate mitogenome (genbank file as result), and mitogenome visualization. MitoZ is available from&nbsp;</span><code>https://github.com/linzhi2013/MitoZ</code><span>.</span></p>
<p><span><a href="https://academic.oup.com/nar/article/47/11/e63/5377471">https://academic.oup.com/nar/article/47/11/e63/5377471</a></span></p><p>Address of the bookmark: <a href="https://github.com/linzhi2013/MitoZ" rel="nofollow">https://github.com/linzhi2013/MitoZ</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</guid>
	<pubDate>Thu, 13 Feb 2020 00:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</link>
	<title><![CDATA[genomics public data links !]]></title>
	<description><![CDATA[<p>List of publically available databases on google server.</p>
<p>More at <a href="https://software.broadinstitute.org/gatk/download/bundle">https://software.broadinstitute.org/gatk/download/bundle</a></p>
<p><a href="ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/">ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/</a>.</p>
<p><a href="ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/">ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/</a></p><p>Address of the bookmark: <a href="https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1" rel="nofollow">https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</guid>
	<pubDate>Mon, 27 Nov 2017 10:38:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</link>
	<title><![CDATA[INC-Seq: accurate single molecule reads using nanopore sequencing]]></title>
	<description><![CDATA[<p><span>INC-Seq reads enabled accurate species-level classification, identification of species at 0.1&nbsp;% abundance and robust quantification of relative abundances, providing a cheap and effective approach for pathogen detection and microbiome profiling on the MinION system.</span></p><p>Address of the bookmark: <a href="https://github.com/CSB5/INC-Seq" rel="nofollow">https://github.com/CSB5/INC-Seq</a></p>]]></description>
	<dc:creator>Jit</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/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/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/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

</channel>
</rss>