<?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/30203?offset=450</link>
	<atom:link href="https://bioinformaticsonline.com/related/30203?offset=450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</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/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19137/centre-for-systems-biology-bioinformatics-panjab-university-vacancy-of-research-fellow</guid>
  <pubDate>Wed, 12 Nov 2014 06:18:54 -0600</pubDate>
  <link></link>
  <title><![CDATA[Centre for Systems Biology &amp; Bioinformatics, Panjab University vacancy of Research Fellow]]></title>
  <description><![CDATA[
<p>Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of <br />Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology &amp; Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of the project</p>

<p>Essential Qualification<br />For Research Fellow:-<br />M.Sc. in Systems Biology and Bioinformatics / Life<br />Sciences with minimum 55% marks.<br />Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology &amp; Bioinformatics will also be eligible. </p>

<p>Applications should be reach on or before 19-11-2014 in the office of the undersigned. Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology &amp; Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid. </p>

<p>more at http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19248/bioinformatics-jrfrasrf-position-at-institute-of-cytology-and-preventive-oncology-icpo</guid>
  <pubDate>Wed, 19 Nov 2014 20:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at Institute of Cytology and Preventive Oncology (ICPO)]]></title>
  <description><![CDATA[
<p>Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301</p>

<p>Candidates having the below mentioned qualifications may appear for walk in interview at ICPO on 2nd December 2014 between 10.00 AM and 12:00 PM under the below time bound projects under Dr. Subhash M. Agarwal, Scientist C. The post is purely temporary and co-terminus with the project.</p>

<p>Research Assistant (One)<br />25650/- consolidated<br />Discovery of EGFR secondary mutant inhibitors using structure based screening approach (ICMR)<br />Duration: 7 months</p>

<p>Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record.</p>

<p>Desirable: Experience in scripting and molecular docking.<br />	<br />Below 30 years</p>

<p>Junior Research Fellow (One)</p>

<p>16,000 + 30% HRA = Rs. 20800/-</p>

<p>Identification of novel inhibitors targeting EGFR using an integrated ligand and structure based approach (DBT)</p>

<p>Duration: 9 months</p>

<p>Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record. Candidates with CSIR-UGC / ICMR, NET qualification will be preferred</p>

<p>Desirable: Experience in scripting, QSAR and molecular docking.<br />	<br />Below 28 years</p>

<p>Interested eligible candidates may send their applications with Bio-data by email at (smagarwal@gmail.com) or by post addressed to Dr. Subhash M Agarwal, Scientist C, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301 so as to reach latest by 1st December, 2014. The candidates may appear for interview at ICPO along with 3 copies of CV, photo and relevant certificates of qualifications in original and reprints of publications at the time of interview. It should be noted that No TA/DA will be paid for the walk in Interview.</p>

<p>Advertisement: www.icpo.org.in/advt-walk-in-interview.docx</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/19556/genome-origami</guid>
	<pubDate>Fri, 12 Dec 2014 22:48:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19556/genome-origami</link>
	<title><![CDATA[Genome Origami]]></title>
	<description><![CDATA[<p>There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director&rsquo;s Blog highlights new research illustrating how the human genome folds inside the cell&rsquo;s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.</p><p>http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome<br /><br />Researchers have been working to determine how cells regulate gene expression for nearly as long as we&rsquo;ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.<br /><br /></p><p>More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php</p><p>Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19545/walk-%E2%80%93-in-%E2%80%93-interview-agricultural-knowledge-management-unit-indian-agricultural-research-institute-new-delhi-110012</guid>
  <pubDate>Fri, 12 Dec 2014 21:33:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012]]></title>
  <description><![CDATA[
<p>Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:</p>

<p>1 Dr. A.K.Mishra Coordinator &amp; PI (BTISnet)</p>

<p>Traineeship (two) for one year</p>

<p>Rs. 5000/- (consolidated)</p>

<p>M.Sc. (Bioinformatics) with 60 % marks from a recognized University</p>

<p>20-12-2014 (10:00 AM -11:00 AM)</p>

<p>Studentship (four) for one year</p>

<p>Rs. 2500/- (consolidated)</p>

<p>Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University</p>

<p>20-12-2014 (11:00 AM- 1:00 PM)</p>

<p>The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.</p>

<p>Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf</p>
]]></description>
</item>

</channel>
</rss>