<?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/30966?offset=700</link>
	<atom:link href="https://bioinformaticsonline.com/related/30966?offset=700" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<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/pages/view/43977/read-simulators</guid>
	<pubDate>Fri, 30 Sep 2022 06:48:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43977/read-simulators</link>
	<title><![CDATA[Read Simulators]]></title>
	<description><![CDATA[<h1>Short Read Simulators</h1><p>With the popularity of next-generation sequencing (NGS) technologies, many NGS read simulators have been developed. Currently, many of the popular short read simulators are designed to simulate reads mimicking many Illumina, 454 and SOLiD platforms. Listed below are some popular short read simulators. Links to their publications are provided as well.</p><ol>
<li><a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0003373" target="_blank">MetaSim</a></li>
<li><a href="https://github.com/lh3/wgsim" target="_blank">wgsim</a></li>
<li><a href="https://github.com/timmassingham/simNGS" target="_blank">SimNGS</a></li>
<li><a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049110" target="_blank">ArtificialFastqGenerator</a></li>
<li id="e943"><a href="https://academic.oup.com/bioinformatics/article/35/3/521/5055123" target="_blank">InSilicoSeq</a></li>
</ol><h1>Long Read Simulators</h1><p id="d469">With the advancements in sequencing technologies, scientists have shown an increasing interest in using third-generation sequencing (TGS) technologies. Currently, many of the popular long read simulators are designed to simulate reads mimicking the two main TGS technologies; (1)&nbsp;<em>Pacific Biosciences (PacBio)</em>&nbsp;and (2)&nbsp;<em>Oxford Nanopore (ONT)</em>. Listed below are some of the popular and recently introduced PacBio and ONT simulators. Links to their publications are provided as well.</p><h2><span>PacBio Simulators</span></h2><ol>
<li><a href="https://academic.oup.com/bioinformatics/article/29/1/119/273243" target="_blank">PBSIM</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/32/24/3829/2525710" target="_blank">LongISLND</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/32/17/2704/2450740" target="_blank">SimLoRD</a></li>
<li><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2208-0" target="_blank">NPBSS</a></li>
<li id="fed0"><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2901-7" target="_blank">PaSS</a></li>
</ol><h2><span>ONT Simulators</span></h2><ol>
<li id="f145"><a href="https://academic.oup.com/gigascience/article/6/4/gix010/3051934" target="_blank">NanoSim</a></li>
<li id="c6f5"><a href="https://ieeexplore.ieee.org/document/8621253" target="_blank">Nanopore SimulatION</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/34/17/2899/4962495" target="_blank">DeepSimulator</a></li>
<li><a href="https://academic.oup.com/bioinformatics/article/36/8/2578/5698265" target="_blank">DeepSimulator1.5</a></li>
</ol>]]></description>
	<dc:creator>Abhi</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/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</guid>
	<pubDate>Tue, 15 May 2018 04:44:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36618/lamsa-fast-split-read-alignment-with-long-approximate-matches</link>
	<title><![CDATA[LAMSA: fast split read alignment with long approximate matches]]></title>
	<description><![CDATA[LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).

LAMSA takes takes the advantage of the rareness of SVs to implement a specifically designed two-step strategy. That is, LAMSA initially splits the read into relatively long fragments and co-linearly align them to solve the small variations or sequencing errors, and mitigate the effect of repeats. The alignments of the fragments are then used for implementing a sparse dynamic programming (SDP)-based split alignment approach to handle the large or non-co-linear variants.

We benchmarked LAMSA with simulated and real datasets having various read lengths and sequencing error rates, the results demonstrate that it is substantially faster than the state-of-the-art long read aligners; mean-while, it also has good ability to handle various categories of SVs.

LAMSA is open source and free for non-commercial use.

LAMSA is mainly designed by Bo Liu &amp; Yan Gao and developed by Yan Gao in Center for Bioinformatics, Harbin Institute of Technology, China.<p>Address of the bookmark: <a href="https://github.com/hitbc/LAMSA" rel="nofollow">https://github.com/hitbc/LAMSA</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/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</guid>
	<pubDate>Wed, 20 Aug 2014 21:57:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</link>
	<title><![CDATA[The 8000 years old Tibetian gene mutation !!!]]></title>
	<description><![CDATA[<p>A new study has provided insight into how gene mutation around 8,000 years ago helped Tibetans' to survive in the thin air on the Tibetan Plateau, where an average elevation is of 14,800 feet.<br /><br />A study led by University of Utah scientists is the first to find a genetic cause for the adaptation, a single DNA base pair change that dates back 8,000 years and demonstrate how it contributes to the Tibetans' ability to live in low oxygen conditions.</p><p>About 8,000 years ago, the gene EGLN1 changed by a single DNA base pair. Today, a relatively short time later on the scale of human history, 88 percent of Tibetans have the genetic variation, and it was virtually absent from closely related lowland Asians. The findings indicate the genetic variation endows its carriers with an advantage.<br /><br />In those without the adaptation, low oxygen caused their blood to become thick with oxygen-carrying red blood cells, an attempt to feed starved tissues, which could cause long-term complications such as heart failure. The researchers found that the newly identified genetic variation protected Tibetans by decreasing the over-response to low oxygen.</p><p>Reference: http://www.nature.com/nature/journal/v512/n7513/abs/nature13408.html</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</guid>
	<pubDate>Sun, 23 Sep 2018 05:12:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</link>
	<title><![CDATA[rHAT: a seed-and-extension-based noisy long read alignment tool]]></title>
	<description><![CDATA[<p><span>rHAT is a seed-and-extension-based noisy long read alignment tool. It is suitable for aligning 3rd generation sequencing reads which are in large read length with relatively high error rate, especially Pacbio's Single Molecule Read-time (SMRT) sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/dfguan/rHAT" rel="nofollow">https://github.com/dfguan/rHAT</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12936/assistant-professor-medical-bioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 05:00:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor - Medical Bioinformatics]]></title>
  <description><![CDATA[
<p>Advt. No : ME-I/A-IV/03/14</p>

<p>No.of Posts:01 (SC)</p>

<p>Pay Scale:</p>

<p>Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.</p>

<p>Qualifications:</p>

<p>Area of Specialization:-</p>

<p>Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology</p>

<p>1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.</p>

<p>2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/</p>

<p>Immunology/Structural Biology etc</p>

<p>Experience:</p>

<p>1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical</p>

<p>Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.</p>

<p>2. Minimum two publication with atleast one in international journal and atleast one as first author</p>

<p>Desirable:-</p>

<p>Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)</p>

<p>Send your applications to O/O, Deputy Registrar, Recruitment &amp; Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014</p>

<p>For more details,please visit website:http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42280/urmap-an-ultra-fast-read-mapper</guid>
	<pubDate>Thu, 29 Oct 2020 23:03:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42280/urmap-an-ultra-fast-read-mapper</link>
	<title><![CDATA[URMAP, an ultra-fast read mapper]]></title>
	<description><![CDATA[<p><span>URMAP, a new read mapping algorithm. URMAP is an order of magnitude faster than BWA with comparable accuracy on several validation tests. On a Genome in a Bottle (GIAB) variant calling test with 30&times; coverage 2&times;150 reads, URMAP achieves high accuracy (precision 0.998, sensitivity 0.982 and F-measure 0.990) with the strelka2 caller. However, GIAB reference variants are shown to be biased against repetitive regions which are difficult to map and may therefore pose an unrealistically easy challenge to read mappers and variant callers.</span></p>
<p><span>More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7320720/</span></p><p>Address of the bookmark: <a href="https://github.com/rcedgar/urmap" rel="nofollow">https://github.com/rcedgar/urmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>