<?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/31300?offset=560</link>
	<atom:link href="https://bioinformaticsonline.com/related/31300?offset=560" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9519/bioinformatics-phd-at-university-of-calcutta</guid>
  <pubDate>Mon, 31 Mar 2014 08:41:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics PhD at University of Calcutta]]></title>
  <description><![CDATA[
<p>University of Calcutta<br />Department of Biophysics, Molecular Biology &amp; Bioinformatics</p>

<p>Applications are invited for admission to the Ph.D. programme in the Department of Biophysics, Molecular Biology &amp; Bioinformatics, University of Calcutta for the year 2014 from eligible candidates who would be placed under the departmental teachers or affiliated research supervisors for the pursuance of their Ph.D. programme.</p>

<p>Candidates are requested to download the Ph.D. admission test application form from the University website and apply in the prescribed proforma by paying Rs. 100/- through a challan available through different University Cash counters. The challan is to be duly forwarded through the Head, Department of Biophysics, Molecular Biology &amp; Bioinformatics, University of Calcutta.</p>

<p>The completed application form with a copy of the paid challan is to be submitted to the office of the Department by April 16, 2014.</p>

<p>Syllabus for the Test: The questions for the admission test and interview will be based on topics in the following areas:</p>

<p>Mathematical methods, Molecular and Cellular Biophysics, Molecular and Cell Biology, Biochemistry, Genetics, Plant Biology, Developmental biology, Neurobiology, Biotechnology and Bioinformatics.</p>

<p>However, the interview will be primarily based on the research emphasis of the candidate. Candidates must clearly indicate the program in which they want to apply.</p>

<p>Date of Admission test : April 22, 2014 (Tuesday)</p>

<p>Date of publication of selection list for the interview : April 22, 2014(Tuesday)</p>

<p>Date of Interview : April 23, 2014 (Wednesday)</p>

<p>Number of vacancies for the Ph.D. programme : 12</p>

<p>Reservation policy will be followed as per rules.</p>

<p>Candidates with valid NET/GATE/M.Phil. or equivalent qualifications are not required to appear at the admission test but would need to qualify in the interview.</p>

<p>Advertisement:</p>

<p>http://www.caluniv.ac.in/admission%20notice/PHD_BIO_PHYSICS.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43112/calling-variants-in-non-diploid-systems</guid>
	<pubDate>Sat, 26 Jun 2021 15:37:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43112/calling-variants-in-non-diploid-systems</link>
	<title><![CDATA[Calling variants in non-diploid systems]]></title>
	<description><![CDATA[<p><span>The main challenge associated with non-diploid variant calling is the difficulty in distinguishing between the sequencing noise (abundant in all NGS platforms) and true low frequency variants. Some of the early attempts to do this well have been accomplished on human mitochondrial&nbsp;</span><span>DNA</span><span>&nbsp;although the same approaches will work equally good on viral and bacterial genomes (</span><a href="https://training.galaxyproject.org/training-material/topics/variant-analysis/tutorials/non-dip/tutorial.html#Rebolledo-Jaramillo2014">Rebolledo-Jaramillo&nbsp;<em>et al.</em>&nbsp;2014</a><span>,&nbsp;</span><a href="https://training.galaxyproject.org/training-material/topics/variant-analysis/tutorials/non-dip/tutorial.html#Li2015">Li&nbsp;<em>et al.</em>&nbsp;2015</a><span>).</span></p><p>Address of the bookmark: <a href="https://training.galaxyproject.org/training-material/topics/variant-analysis/tutorials/non-dip/tutorial.html" rel="nofollow">https://training.galaxyproject.org/training-material/topics/variant-analysis/tutorials/non-dip/tutorial.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9666/phylogenomicsphylogenetic-website</guid>
	<pubDate>Mon, 07 Apr 2014 02:17:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9666/phylogenomicsphylogenetic-website</link>
	<title><![CDATA[Phylogenomics/Phylogenetic website]]></title>
	<description><![CDATA[<div>
<p>Welcome to phylobabble.org, a discussion forum for phylogenetic theory and applications. The primary goal of this forum is to discuss best practice and new developments in phylogenetics. Although we do have a Troubleshooting category for getting feedback on analyses, this is not a help site for running phylogenetics programs.</p>
<p>A great place to chat about phylogenetics for researchers and the broader community of students and science-interested citizens. </p>
</div><p>Address of the bookmark: <a href="http://phylobabble.org/" rel="nofollow">http://phylobabble.org/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43614/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</guid>
	<pubDate>Tue, 30 Nov 2021 23:23:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43614/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>MitoZ, consisting of independent modules of <em>de novo</em> assembly, findMitoScaf (find Mitochondrial Scaffolds), annotation and visualization, that can generate mitogenome assembly together with annotation and visualization results from HTS raw reads.</p>
<p>https://academic.oup.com/nar/article/47/11/e63/5377471</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>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43661/maftools</guid>
	<pubDate>Fri, 17 Dec 2021 03:18:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43661/maftools</link>
	<title><![CDATA[maftools]]></title>
	<description><![CDATA[<p>With advances in Cancer Genomics, <a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a> (MAF) is being widely accepted and used to store somatic variants detected. <a href="http://cancergenome.nih.gov">The Cancer Genome Atlas</a> Project has sequenced over 30 different cancers with sample size of each cancer type being over 200. <a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">Resulting data</a> consisting of somatic variants are stored in the form of <a href="https://docs.gdc.cancer.gov/Data/File_Formats/MAF_Format/">Mutation Annotation Format</a>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner from either TCGA sources or any in-house studies as long as the data is in MAF format.</p>
<p>https://www.bioconductor.org/packages/devel/bioc/vignettes/maftools/inst/doc/maftools.html</p><p>Address of the bookmark: <a href="https://github.com/PoisonAlien/maftools" rel="nofollow">https://github.com/PoisonAlien/maftools</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</guid>
	<pubDate>Tue, 22 Apr 2014 20:53:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</link>
	<title><![CDATA[BioCodes/BioScripts]]></title>
	<description><![CDATA[<p>Over the years most bioinformatics people amass a collection of small utility scripts which make their lives easier. Too often they are kept either in private repositories or as part of a public collection to which noone else can contribute. Biocode is a curated repository of general-use utility scripts.</p>
<p>Algorithms scripts @ https://github.com/jschendel/bioinformatics-algorithms-coursera</p><p>Address of the bookmark: <a href="https://github.com/jorvis/biocode" rel="nofollow">https://github.com/jorvis/biocode</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/43728/short-read-assembly-using-spades</guid>
	<pubDate>Mon, 31 Jan 2022 07:18:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43728/short-read-assembly-using-spades</link>
	<title><![CDATA[Short-read assembly using Spades !]]></title>
	<description><![CDATA[<h2 id="short-read-assembly-a-comparison">If we only had Illumina reads, we could also assemble these using the tool Spades.</h2><p>You can try this here, or try it later on your own data.</p><h2 id="get-data">Get data</h2><p>We will use the same Illumina data as we used above:</p><ul>
<li>illumina_R1.fastq.gz: the Illumina forward reads</li>
<li>illumina_R2.fastq.gz: the Illumina reverse reads</li>
</ul><h2 id="assemble">Assemble</h2><p>Run Spades:</p><div><pre>spades.py -1 illumina_R1.fastq.gz -2 illumina_R2.fastq.gz --careful --cov-cutoff auto -o spades_assembly_all_illumina
</pre></div><ul>
<li><code>-1</code>&nbsp;is input file of forward reads</li>
<li><code>-2</code>&nbsp;is input file of reverse reads</li>
<li><code>--careful</code>&nbsp;minimizes mismatches and short indels</li>
<li><code>--cov-cutoff auto</code>&nbsp;computes the coverage threshold (rather than the default setting, &ldquo;off&rdquo;)</li>
<li><code>-o</code>&nbsp;is the output directory</li>
</ul><h2 id="results">Results</h2><p>Move into the output directory and look at the contigs:</p><div><pre>infoseq contigs.fasta</pre></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10380/ra-at-alagappa-university</guid>
  <pubDate>Sun, 04 May 2014 23:33:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at ALAGAPPA UNIVERSITY]]></title>
  <description><![CDATA[
<p>DEPARTMENT OF BIOTECHNOLOGY<br />(UGC SAP and DST-FIST &amp; PURSE Sponsored Department)<br />ALAGAPPA UNIVERSITY<br />(A State University Accredited by NAAC with „A‟ Grade)<br />Karaikudi - 630 004, India</p>

<p>WALK IN INTERVIEW</p>

<p>A walk-in Interview for the following position tenable at the Bioinformatics Infrastructure Facility (BIF), Department of Biotechnology, Alagappa University will be held at the Department of Biotechnology, Alagappa University, Karaikudi 630 003 on 15.05.2014 (Thursday) at 01:00 PM. This national facility is funded by the Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi. The main objectives of the Centre involve teaching and research activities in bioinformatics/biotechnology.</p>

<p>RA (One Post):</p>

<p>Salary : Rs. 11000 p.m. plus admissible HRA</p>

<p>Qualification: M.Sc., in Bioinformatics/Biotechnology/Biophysics/Biochemistry/ Life Sciences</p>

<p>Interested candidates are encouraged to send their Curriculum Vitae by email to “sk_pandian@rediffmail.com” in advance. On the day of interview, the candidates must produce original certificates in proof of their educational qualification and experience and a recommendation letter from the Head of the Department/Institution where last studied/worked. Candidates who have already passed the required Degree alone are eligible to appear for interview. No TA&amp;DA will be given for attending the interview.</p>

<p>Advertisement: http://www.alagappabiotech.org/Walk%20in%20interview.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43801/smudgeplot-inference-of-ploidy-and-heterozygosity-structure-using-whole-genome-sequencing-data</guid>
	<pubDate>Fri, 25 Feb 2022 04:42:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43801/smudgeplot-inference-of-ploidy-and-heterozygosity-structure-using-whole-genome-sequencing-data</link>
	<title><![CDATA[Smudgeplot: Inference of ploidy and heterozygosity structure using whole genome sequencing data]]></title>
	<description><![CDATA[<p dir="auto">This tool extracts heterozygous kmer pairs from kmer count databases and performs gymnastics with them. We are able to disentangle genome structure by comparing the sum of kmer pair coverages (CovA + CovB) to their relative coverage (CovB / (CovA + CovB)). Such an approach also allows us to analyze obscure genomes with duplications, various ploidy levels, etc.</p>
<p dir="auto">Smudgeplots are computed from raw or even better from trimmed reads and show the haplotype structure using heterozygous kmer pairs. For example:</p>
<p dir="auto"><a href="https://user-images.githubusercontent.com/8181573/45959760-f1032d00-c01a-11e8-8576-ff0512c33da9.png" target="_blank"><img src="https://user-images.githubusercontent.com/8181573/45959760-f1032d00-c01a-11e8-8576-ff0512c33da9.png" alt="smudgeexample" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/KamilSJaron/smudgeplot" rel="nofollow">https://github.com/KamilSJaron/smudgeplot</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>