<?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/36271?offset=300</link>
	<atom:link href="https://bioinformaticsonline.com/related/36271?offset=300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41039/phd-position-in-translational-medicine</guid>
  <pubDate>Sat, 15 Feb 2020 06:07:19 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD position in Translational Medicine]]></title>
  <description><![CDATA[
<p>https://www.jobvector.de/jobs-stellenangebote/biologie-life-sciences/wissenschaftliche-r-mitarbeiter-in/phd-position-translational-medicine-129981.html?suid=1b510358c7578e8f75cf04a464fc21a404a574ca</p>

<p>Essential experience / qualifications:<br />Master / Diploma in Biology, Biochemistry, Molecular Medicine or similar; solid knowledge of molecular and cell biological techniques; good English knowledge</p>

<p>Applications:<br />Please send your application (including CV, letter of motivation, contact information of two references, and list of publication) by 13.03.2020 at the latest to:</p>

<p>Universitätsklinikum Erlangen<br />Chirurgische Klinik<br />Translational Research Center<br />Prof. Dr. rer. nat. Michael Stürzl<br />Schwabachanlage 12<br />91054 Erlangen<br />E-Mail: michael.stuerzl@uk-erlangen.de</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/1720/postdoctoral-associate-bioinformatics-at-duke-university-medical-center</guid>
  <pubDate>Sat, 10 Aug 2013 18:38:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Associate - Bioinformatics  at Duke University Medical Center]]></title>
  <description><![CDATA[
<p>The Department of Biostatistics and Bioinformatics at Duke University Medical Center is seeking a Postdoctoral Associate for a one year appointment to work on several high-dimensional research projects. The specific goals of the project are to identify genes or molecular markers that are predictive of clinical outcomes in renal and prostate cancer.</p>

<p>Candidates must have: a PhD degree in statistics, biostatistics or bioinformatics, extensive experience in analyzing high-dimensional data (microarray, SNP, CNVs) and of validation approaches. In addition, experience in penalized regression methods, data base manipulation; and strong programming skills in order to conduct Monte Carlo studies and applications (R). Candidate must have excellent communication skills (verbal, written and presentation), a strong proficiency in Linux system.</p>

<p>This position is available immediately and will be filled as soon as possible. Appointment could be extended beyond the first year based on additional funding.</p>

<p>For more information about the Department of Biostatistics and Bioinformatics, please visit our website: http://www.biostat.duke.edu.</p>

<p>For more info: http://biostat.duke.edu/sites/biostat.duke.edu/files/Halabi%20-%20Postdoc%20Job%20Posting%202013%20updated.pdf</p>

<p>Duke University is an Equal Opportunity/Affirmative Action Employer.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26432/summer-2016</guid>
  <pubDate>Sun, 21 Feb 2016 06:17:55 -0600</pubDate>
  <link></link>
  <title><![CDATA[Summer 2016]]></title>
  <description><![CDATA[
<p>REU at Fordham University- Summer 2016</p>

<p>An NSF-funded REU to study Y-chromosome diversity and sex-biased dispersal in wild brown rats (Rattus norvegicus) is available in the Munshi-South Lab at Fordham University. Our lab is currently investigating rat evolution at scales ranging from landscape genetics of individual cities to global patterns of diversity. Development of resources for investigating Y-chromosome diversity will support many of these studies. The REU student will work with the lab to bioinformatically identify Y-chromosome SNPs, design SNPtype assays,<br />extract DNA, genotype samples, and analyze data.</p>

<p>We seek applicants interested in bioinformatics, evolutionary biology, and related disciplines.  Applicants must have taken a college-level genetics course.  This REU will require attention to detail, reliability, independence, and critical thinking.</p>

<p>This position is based at Fordham University's field station, the Louis Calder Center, in Armonk, NY. The Calder Center is located approximately 25 miles north of New York City in a protected woodland area. Housing<br />will be provided at the Calder Center for the duration of the REU (May 23 to Aug 12, 2016). Additionally, the student will receive a $6,000 stipend. The selected student will participate in professional development activities through the Calder Centers REU program, including presentation of results at a research colloquium at the end of the summer.</p>

<p>To apply, please send a one page personal statement about your scientific interests and how this REU will support your professional goals, unofficial transcripts including a list of Spring 2016 courses, and names of two professional references (including title, address, phone number, and email address) as a single pdf (with your last name in the file name) to Dr. Jason Munshi-South (jmunshisouth@fordham.edu).</p>

<p>Applications are due March 4th, 2016.</p>

<p>Jason Munshi-South</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</guid>
	<pubDate>Fri, 28 Feb 2020 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</link>
	<title><![CDATA[RAINBOWR: Reliable Association INference By Optimizing Weights with R (R package for SNP-set GWAS and multi-kernel mixed model)]]></title>
	<description><![CDATA[<p><code>RAINBOWR</code>(Reliable Association INference By Optimizing Weights with R) is a package to perform several types of <code>GWAS</code> as follows.</p>
<ul>
<li>Single-SNP GWAS with <code>RGWAS.normal</code> function</li>
<li>SNP-set (or gene set) GWAS with <code>RGWAS.multisnp</code> function (which tests multiple SNPs at the same time)</li>
<li>Check epistatic (SNP-set x SNP-set interaction) effects with <code>RGWAS.epistasis</code> (very slow and less reliable)</li>
</ul>
<p>https://github.com/KosukeHamazaki/RAINBOWR</p>
<p>https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007663</p>
<p>https://cran.r-project.org/web/packages/RAINBOWR/index.html</p><p>Address of the bookmark: <a href="https://github.com/KosukeHamazaki/RAINBOWR" rel="nofollow">https://github.com/KosukeHamazaki/RAINBOWR</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</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/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>