<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=430</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=430" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</guid>
	<pubDate>Sun, 05 Jan 2020 04:08:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</link>
	<title><![CDATA[NextDenovo: string graph-based de novo assembler for TGS long reads]]></title>
	<description><![CDATA[<p>NextDenovo is a string graph-based<span>&nbsp;</span><em>de novo</em><span>&nbsp;</span>assembler for TGS long reads. It uses a "correct-then-assemble" strategy similar to canu, but requires significantly less computing resources and storages. After assembly, the per-base error rate is about 97-98%, to further improve single base accuracy, please use<span>&nbsp;</span><a href="https://github.com/Nextomics/NextPolish">NextPolish</a>.</p>
<p>NextDenovo contains two core modules: NextCorrect and NextGraph. NextCorrect can be used to correct TGS long reads with approximately 15% sequencing errors, and NextGraph can be used to construct a string graph with corrected reads. It also contains a modified version of<span>&nbsp;</span><a href="https://github.com/lh3/minimap2">minimap2</a><span>&nbsp;</span>for adapting input and output and producing more sensitive and accurate dovetail overlaps, and some useful utilities (see<span>&nbsp;</span><a href="https://github.com/Nextomics/NextDenovo/blob/master/doc/UTILITY.md">here</a><span>&nbsp;</span>for more details).</p><p>Address of the bookmark: <a href="https://github.com/Nextomics/NextDenovo" rel="nofollow">https://github.com/Nextomics/NextDenovo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</guid>
	<pubDate>Sat, 04 Jan 2020 01:08:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</link>
	<title><![CDATA[RePS: Repeat-masked Phrap with scaffolding, a WGS sequence assembler]]></title>
	<description><![CDATA[<p>RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering</p>
<p><img src="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/bin/45793-17f1_F4TT.jpg" alt="image" style="border: 0px;"></p>
<p>More at</p>
<p><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/</a></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz" rel="nofollow">ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</guid>
	<pubDate>Fri, 03 Jan 2020 13:28:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</link>
	<title><![CDATA[DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies]]></title>
	<description><![CDATA[<p>DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann&ndash;Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life.</p><p>Address of the bookmark: <a href="https://github.com/YoannAnselmetti/DeCoSTAR_pipeline" rel="nofollow">https://github.com/YoannAnselmetti/DeCoSTAR_pipeline</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</guid>
	<pubDate>Tue, 31 Dec 2019 19:33:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40489/machine-learning-training-and-courses-in-bioinformatics</link>
	<title><![CDATA[Machine learning training and courses in bioinformatics !]]></title>
	<description><![CDATA[<p>Machine learning techniques have been successful in analyzing biological data because of their capabilities in handling randomness and uncertainty of data noise and in generalization. In this class, we will learn basics about probabilistic models and machine learning techniques. We will focus on probabilistic models (Markov models, Hidden Markov models, and Bayesian networks) for biological sequence analysis and systems biology. Other machine learning techniques, such as Naive bayes, neural networks and SVMs will only be covered briefly.</p>
<p>More at&nbsp;http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</p>
<p>More tutorial at&nbsp;</p>
<p><a href="http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm">http://calla.rnet.missouri.edu/cheng_courses/mlbioinfo/mlbioinfo.htm</a></p>
<p><a href="http://www.raetschlab.org/lectures/MLBioinformatics">http://www.raetschlab.org/lectures/MLBioinformatics</a></p>
<p><a href="http://www.raetschlab.org/lectures/bertinoro08">http://www.raetschlab.org/lectures/bertinoro08</a></p>
<p>Book at&nbsp;</p>
<p><a href="https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf">https://personal.utdallas.edu/~pradiptaray/teaching/7_deep_learning_bioinfo.pdf</a></p><p>Address of the bookmark: <a href="http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/" rel="nofollow">http://homes.sice.indiana.edu/yye/lab/teaching/spring2017-I529/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40479/wos-c-women-scientist-scheme-kiran-ipr</guid>
	<pubDate>Fri, 27 Dec 2019 20:51:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40479/wos-c-women-scientist-scheme-kiran-ipr</link>
	<title><![CDATA[WOS-C Women Scientist Scheme KIRAN-IPR]]></title>
	<description><![CDATA[<p>Women Scientist Scheme WOS-C is one among the most coveted programs that Women Scientists in India apply for. It is an initiative started by the Government of India, Department of Science &amp; Technology (DST) to help women scientists in India to return to the field of mainstream science with a special focus on Intellectual Property Rights (IPR).</p>
<p>WOS-C Women Scientist Scheme aims to train women from a myriad of scientific backgrounds for a year, this, in turn, allows them to even work from home and maintain a good work and home life balance. This call opens once a year and is one of the most sought after schemes.</p>
<p><span>The selection process for the WOS-C Women Scientist Scheme is via an online examination and interview. Only shortlisted applicants will be called to appear for the online examination.</span></p>
<p><span>More at&nbsp;<a href="http://115.112.95.114/wosc/online/Control.do?_main=488t3s">http://115.112.95.114/wosc/online/Control.do?_main=488t3s</a></span></p><p>Address of the bookmark: <a href="http://115.112.95.114/wosc/online/Control.do?_main=488t3s" rel="nofollow">http://115.112.95.114/wosc/online/Control.do?_main=488t3s</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40476/libsdyogen-libibrary-for-comparative-genomics</guid>
	<pubDate>Wed, 25 Dec 2019 01:32:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40476/libsdyogen-libibrary-for-comparative-genomics</link>
	<title><![CDATA[LibsDyogen: Libibrary for comparative genomics]]></title>
	<description><![CDATA[<p>Library of usual classes and functions written in python and used in the Dyogen team for comparative genomics applications.</p>
<p>Collaborative python library used in the<span>&nbsp;</span><a href="http://www.ibens.ens.fr/?rubrique43&amp;lang=fr">DYOGEN team</a>for studying the evolution of gene order in vertebrates.</p>
<p><a href="http://www.ibens.ens.fr/?rubrique43&amp;lang=fr">http://www.ibens.ens.fr/?rubrique43&amp;lang=fr</a></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/DyogenIBENS/LibsDyogen" rel="nofollow">https://github.com/DyogenIBENS/LibsDyogen</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40465/airlift-a-methodology-and-tool-for-comprehensively-moving-mappings-and-annotations-from-one-genome-to-another-similar-genome</guid>
	<pubDate>Mon, 23 Dec 2019 10:20:13 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40465/airlift-a-methodology-and-tool-for-comprehensively-moving-mappings-and-annotations-from-one-genome-to-another-similar-genome</link>
	<title><![CDATA[AirLift, a methodology and tool for comprehensively moving mappings and annotations from one genome to another similar genome]]></title>
	<description><![CDATA[<p>We propose AirLift, a methodology and tool for comprehensively moving mappings and annotations from one genome to another similar genome while maintaining the accuracy of a full mapper.</p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/AirLift" rel="nofollow">https://github.com/CMU-SAFARI/AirLift</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</guid>
	<pubDate>Mon, 23 Dec 2019 09:56:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40463/%E2%80%98dockr%E2%80%99-the-r-container</link>
	<title><![CDATA[‘dockr’: the R container]]></title>
	<description><![CDATA[<p><code>dockr</code> 0.8.6 is now available on CRAN. <code>dockr</code> is a minimal toolkit to build a lightweight Docker container image for your R package, in which the package itself is available. The Docker image seeks to mirror your R session as close as possible with respect to R specific dependencies. Both dependencies on CRAN R packages as well as local non-CRAN R packages will be included in the Docker container image.</p>
<p>If you want to know, how Docker works, and why you should consider using Docker, please take a look at the <a href="https://www.docker.com/why-docker" target="_blank">Docker website</a>.</p><p>Address of the bookmark: <a href="https://www.docker.com/why-docker" rel="nofollow">https://www.docker.com/why-docker</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</guid>
	<pubDate>Thu, 19 Dec 2019 07:33:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</link>
	<title><![CDATA[HaploTypo: a variant-calling pipeline for phased genomes]]></title>
	<description><![CDATA[<p>An increasing number of phased (i.e. with resolved haplotypes) reference genomes are available. However, most genetic variant calling tools do not explicitly account for haplotype structure. Here, we present HaploTypo, a pipeline tailored to resolve haplotypes in genetic variation analyses. HaploTypo infers the haplotype correspondence for each heterozygous variant called on a phased reference genome.</p>
<div>Availability and Implementation</div>
<p>HaploTypo is implemented in Python 2.7 and Python 3.5, and is freely available at&nbsp;<a href="https://github.com/gabaldonlab/haplotypo" target="">https://github.com/gabaldonlab/haplotypo</a>, and as a Docker image.</p><p>Address of the bookmark: <a href="https://github.com/gabaldonlab/haplotypo" rel="nofollow">https://github.com/gabaldonlab/haplotypo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>