<?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/29280?offset=940</link>
	<atom:link href="https://bioinformaticsonline.com/related/29280?offset=940" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11603/ncbi-webinar</guid>
	<pubDate>Sun, 08 Jun 2014 02:47:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11603/ncbi-webinar</link>
	<title><![CDATA[NCBI Webinar]]></title>
	<description><![CDATA[<p>In less than two weeks, NCBI will offer a webinar entitled "Introducing 3 NCBI Resources to Navigate Testing for Disease Linked Variants: MedGen, GTR and ClinVar". This webinar will delve into the lifecycle of genetic testing and teach attendees how to navigate the NIH Genetic Testing Registry, ClinVar, and MedGen resources. These resources can be used to prepare for clinical cases, access detailed information about orderable genetic tests, interpret test results, and more.</p><p>More at https://attendee.gotowebinar.com/register/8452228815737989634</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</guid>
	<pubDate>Wed, 10 Jan 2018 03:10:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</link>
	<title><![CDATA[GIGGLE: a search engine for large-scale integrated genome analysis]]></title>
	<description><![CDATA[<p><span>GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (</span><a href="https://github.com/ryanlayer/giggle">https://github.com/ryanlayer/giggle</a><span>) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation.</span></p>
<p>https://www.nature.com/articles/nmeth.4556</p><p>Address of the bookmark: <a href="https://github.com/ryanlayer/giggle" rel="nofollow">https://github.com/ryanlayer/giggle</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12111/internship-program-with-arraygen-technolgies</guid>
  <pubDate>Sun, 22 Jun 2014 23:18:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship program with ArrayGen Technolgies]]></title>
  <description><![CDATA[
<p>Internship Program for Bioinformatics / Biotechnology Professionals Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>

<p>Interested candidates may email their resume along with a cover letter to careers@arraygen.com</p>

<p>Official website: http://www.arraygen.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</guid>
	<pubDate>Sat, 03 Feb 2018 04:59:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</link>
	<title><![CDATA[MUMmer4: A fast and versatile genome alignment system]]></title>
	<description><![CDATA[<p><span>MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the&nbsp;</span><span>nucmer</span><span>&nbsp;program in MUMmer4 is easily able to handle alignments of large genomes;&nbsp;</span></p><p>Address of the bookmark: <a href="https://mummer4.github.io/" rel="nofollow">https://mummer4.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12566/jrf-at-national-research-centre-on-plant-biotechnology</guid>
  <pubDate>Fri, 04 Jul 2014 13:36:02 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF at NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY]]></title>
  <description><![CDATA[
<p>NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY</p>

<p>New Delhi-110012</p>

<p>Walk in interview</p>

<p>Eligible candidates may appear for Walk-in interview for the temporary positions of JRF/SRF/ RA, in ICAR, DBT funded research projects. Positions are purely temporary in nature and are co-terminus with the projects. The initial appointment will be for maximum one year, which can be extended on the basis of assessment of the candidate performance and need in the project work (PI-Dr. N. K. Singh, National Professor).</p>

<p>Name of the</p>

<p>PI (Project)<br />	</p>

<p>Name of</p>

<p>Position<br />	</p>

<p>Number of</p>

<p>positions<br />	</p>

<p>Emoluments</p>

<p>Fixed per</p>

<p>month (Rs.)<br />	</p>

<p>Essential</p>

<p>Qualifications</p>

<p>DBT-“Physical Mapping and Sample sequencing of Wheat Chromosome 2A- International Wheat Genome Sequencing Consortium (India)”.</p>

<p>(Up to Nov,2014)</p>

<p>DBT- Identification and functional analysis of genes related to yield and biotic stresses (Up to Oct,2014)</p>

<p>NPTC-Central Facility<br />	</p>

<p>RA (Master)</p>

<p>JRF/SRF</p>

<p>Research Associate: One</p>

<p>Essential: MCA or M. Tech. (Bioinformatics and computer Science with 2 years experience in Database Management with</p>

<p>MySQL, Linux)</p>

<p>Desirable: Proficiency in handling of large biological databases</p>

<p>Age limit: Max. Age 35 years (Age of relaxation of 5 years for SC/ST&amp; woman. and 3 years for OBC). The interview will be held on 08 July, 2014 at 11 am at room no. 39, NRCPB, LBS Building, Pusa Campus, New Delhi-110012. The candidates must bring original certificates and four copies of biodata, and recent passport size photograph. No TA/DA would be given for the appearance in interview. Only the candidates having essential qualifications would be entertained for the interviews.</p>

<p>Advertisement:</p>

<p>www.nrcpb.org/sites/default/files/news%20paper%20advirtisment..docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36218/g-compass-a-comparative-genome-browser</guid>
	<pubDate>Thu, 12 Apr 2018 10:00:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36218/g-compass-a-comparative-genome-browser</link>
	<title><![CDATA[G-compass: a comparative genome browser]]></title>
	<description><![CDATA[<p><span>G-compass (</span><a href="http://www.h-invitational.jp/g-compass/" target="_top">http://www.h-invitational.jp/g-compass/</a><span>) is a comparative genome browser. It visualizes evolutionarily conserved genomic regions between human and other 12 vertebrates based on original genome alignments pursuing higher coverage (1,2). Annotations of human genes/transcripts and their ortholog information were derived from&nbsp;</span><a href="http://www.h-invitational.jp/hinv/ahg-db/index.jsp" target="_top">H-InvDB</a><span>&nbsp;and its subdatabase&nbsp;</span><a href="http://www.h-invitational.jp/evola/" target="_top">Evola</a><span>, respectively. G-compass is available for free of charge. [&nbsp;</span><a href="http://www.h-invitational.jp/g-compass/cgi-bin/gc_main.cgi?species_1=Hg18&amp;species_2=pt2&amp;strand_1=%2B&amp;strand_2=%2B&amp;from_win=main&amp;gen_str=2&amp;chr_1=01&amp;chr_2=01&amp;st_1=103804298&amp;ed_1=104204297&amp;st_2=105235351&amp;ed_2=105635350" target="_top">Sample</a><span>&nbsp;]</span></p><p>Address of the bookmark: <a href="http://www.h-invitational.jp/g-compass/" rel="nofollow">http://www.h-invitational.jp/g-compass/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12988/guest-lecturer-molecular-biology-bioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 13:34:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Guest Lecturer - Molecular Biology &amp; Bioinformatics]]></title>
  <description><![CDATA[
<p>Adv. No. F.TU/ACA/GT-APP/01/14 Date: 07.07.2014</p>

<p>Faculty of Science</p>

<p>Essential Qualifications:</p>

<p>(i) Good academic record having at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s Degree level in a relevant subject, from an Indian University, or an equivalent degree from an accredited foreign University.</p>

<p>(II) Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET.</p>

<p>(III) Notwithstanding anything contained in sub-clauses (i) and (ii) of clause 4.4.1 of UGC regulations 2010, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/ SLET/ SET for engagement of guest Teacher.</p>

<p>(IV) NET/ SLET/ SET shall also not be required for such Master’s Degree Programmes in discipline for which NET/ SLET/ SET is not conducted.</p>

<p>Application form along with detailed instructions can be downloaded from Tripura University website: www.tripurauniv.in. The duly filled in application forms complete in all respects may be sent so as to reach the Office of the Deputy Registrar Academic Branch, Tripura University, Suryamaninagar - 799022, Tripura on or before 31st July, 2014. The Candidates who responded against advertisement No. TU.REG/N-Advt./02/10 dated 20.02.2014 need not apply again.</p>

<p>For more info visit: http://www.tripurauniv.in/images/universitymedia/EmploymentNotification/Guest%20Teacher%20Advt.%20website_09072014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</guid>
	<pubDate>Tue, 15 May 2018 09:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</link>
	<title><![CDATA[Circlator: automated circularization of genome assemblies using long sequencing reads]]></title>
	<description><![CDATA[A tool to circularize genome assemblies. The algorithm and benchmarks are described in the Genome Biology manuscript. 

Citation: "Circlator: automated circularization of genome assemblies using long sequencing reads", Hunt et al, Genome Biology 2015 Dec 29;16(1):294. doi: 10.1186/s13059-015-0849-0. PMID: 26714481.<p>Address of the bookmark: <a href="http://sanger-pathogens.github.io/circlator/" rel="nofollow">http://sanger-pathogens.github.io/circlator/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</guid>
	<pubDate>Mon, 11 Jun 2018 03:08:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</link>
	<title><![CDATA[PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.]]></title>
	<description><![CDATA[We are pleased to release PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other assembler.

http://derisilab.ucsf.edu/software/price/<p>Address of the bookmark: <a href="http://derisilab.ucsf.edu/software/price/" rel="nofollow">http://derisilab.ucsf.edu/software/price/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

</channel>
</rss>