<?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/33011?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/33011?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30966/maftools</guid>
	<pubDate>Thu, 16 Feb 2017 11:16:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30966/maftools</link>
	<title><![CDATA[MafTools]]></title>
	<description><![CDATA[<p>maftools - An R package to summarize, analyze and visualize MAF files. <a href="https://github.com/PoisonAlien/maftools#introduction"></a>Introduction.</p>
<p>With advances in Cancer Genomics, Mutation Annotation Format (MAF) is being widley accepted and used to store variants detected. <a href="http://cancergenome.nih.gov">The Cancer Genome Atlas</a> Project has seqenced over 30 different cancers with sample size of each cancer type being over 200. The <a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">resulting data</a> consisting of genetic variants is stored in the form of <a href="https://wiki.nci.nih.gov/display/TCGA/Mutation+Annotation+Format+%28MAF%29+Specification">Mutation Annotation Format</a>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner either from TCGA sources or any in-house studies as long as the data is in MAF format. Maftools can also handle ICGC Simple Somatic Mutation format.</p>
<p>maftools is on <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f449.png" alt=":point_right:" width="20" height="20" style="border: 0px;"> <a href="http://biorxiv.org/content/early/2016/05/11/052662">bioRxiv</a> <img src="https://assets-cdn.github.com/images/icons/emoji/bowtie.png" alt=":bowtie:" title=":bowtie:" width="20" height="20" style="border: 0px; text-align: absmiddle;"></p>
<p>Please cite the below if you find this tool useful for you.</p>
<p>Mayakonda, A. and H.P. Koeffler, Maftools: Efficient analysis, visualization and summarization of MAF files from large-scale cohort based cancer studies. bioRxiv, 2016. doi: <a href="http://dx.doi.org/10.1101/052662">http://dx.doi.org/10.1101/052662</a></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>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</guid>
	<pubDate>Fri, 05 Jan 2018 04:02:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</link>
	<title><![CDATA[ECTOOLS: Long Read Correction and other Correction tools]]></title>
	<description><![CDATA[<p>Long Read Correction and other Correction tools</p>
<p>This package is a loose collection of scripts. To run the correction<br>routine see the section below. Descriptions of the other scripts<br>are at the bottom of this file.</p>
<p>Contact: gurtowsk@cshl.edu</p>
<p>In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:<br>http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf</p><p>Address of the bookmark: <a href="https://github.com/jgurtowski/ectools" rel="nofollow">https://github.com/jgurtowski/ectools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</guid>
	<pubDate>Wed, 06 Apr 2016 13:27:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</link>
	<title><![CDATA[PEAR: a fast and accurate Illumina Paired-End reAd mergeR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p>
<p>More at&nbsp;http://www.exelixis-lab.org/web/software/pear</p>
<p>Paper:&nbsp;http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3933873/</p><p>Address of the bookmark: <a href="http://www.exelixis-lab.org/web/software/pear" rel="nofollow">http://www.exelixis-lab.org/web/software/pear</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/982</guid>
	<pubDate>Wed, 17 Jul 2013 15:25:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/982</link>
	<title><![CDATA[Is reference genome necessary for gene expression study in transcriptome sequencing or for variant discovery in genome sequencing?]]></title>
	<description><![CDATA[<p><span>Like in case of plant genomes where nature of genome is too complex and huge in size to accomplish complete<em> de novo</em> assembly by current sequencing technology. What would be alternate solution? Can we live in reference free world?</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/2044</guid>
	<pubDate>Mon, 12 Aug 2013 12:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2044</link>
	<title><![CDATA[Does anyone have Nanopore latest updates?]]></title>
	<description><![CDATA[<p>There was a lot of buzz about&nbsp;<span>Oxford Nanopore Technologies&reg; is developing the GridION&trade; system and miniaturised MinION&trade; device. These are a new generation of electronic molecular analysis system for use in scientific research, personalised medicine, crop science, security/defence and more. The platform technology uses nanopores to analyse single molecules including DNA/RNA and proteins. With a broad patent portfolio, the Oxford Nanopore pipeline includes biological nanopores and solid-state nanopores.</span></p><p>Is this available, or still under trial mode?&nbsp;</p><p><a href="https://www.nanoporetech.com/">https://www.nanoporetech.com/</a></p><p><a href="https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system">https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4195/barber-pole-worm-sheep-pathogen-sequenced</guid>
	<pubDate>Tue, 03 Sep 2013 16:32:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4195/barber-pole-worm-sheep-pathogen-sequenced</link>
	<title><![CDATA[Barber pole worm , sheep pathogen sequenced !!!]]></title>
	<description><![CDATA[<p>Haemonchus contortus is a highly pathogenic parasitic nematode of that can infect a large number of wild and domesticated ruminant species and is the most economically important parasite of sheep and goats worldwide. Scientists at the Wellcome Trust Sanger Institute have sequenced the genome of the barber's pole worm (Haemonchus contortus), which will help to explore the this tropical parasite which&nbsp;been disseminated around the world by livestock movement.&nbsp;</p><p>H. contortus is a member of the superfamily trichostrongyloidea (Strongylida) which contains most of the economically important parasitic nematodes of grazing livestock. These parasites cost the global livestock industry billions of dollars per annum in lost production and drug costs.&nbsp;A common type of clover may be a preventative or palliative for the disease. However, some particular breeds of sheep, such as the Gulf Coast Native from the Southern United States, have been shown to have developed special resistance to H. contortus.</p><p>Getting the full genome can help to tackle the problem and understand the resistance mechanism with an ease. Moreover, the genome could now provide a comprehensive understanding of how treatments against parasitic worms work and point to further new treatments and vaccines.&nbsp;By comparing the genome of the barber's pole worm with those of worms that have acquired drug resistance, researchers expect to reveal information about how and why resistance has occurred. Till now, researchers have uncovered essential information in the fight against drug resistance in worms.</p><p>Reference:</p><p><a href="http://www.fwi.co.uk/articles/28/08/2013/140758/researchers-close-in-on-worm-resistance-in-sheep.htm">http://www.fwi.co.uk/articles/28/08/2013/140758/researchers-close-in-on-worm-resistance-in-sheep.htm</a></p><p><a href="http://www.sciencedaily.com/releases/2013/08/130828103351.htm?utm_source=feedburner&amp;utm_medium=feed&amp;utm_campaign=Feed%3A+sciencedaily%2Fplants_animals+(ScienceDaily%3A+Plants+%26+Animals+News)">http://www.sciencedaily.com/releases/2013/08/130828103351.htm?utm_source=feedburner&amp;utm_medium=feed&amp;utm_campaign=Feed%3A+sciencedaily%2Fplants_animals+(ScienceDaily%3A+Plants+%26+Animals+News)</a></p><p>Image source: Wikipedia</p><p><img src="http://upload.wikimedia.org/wikipedia/commons/8/8e/Haemonchus_contortus.jpg" alt="image" width="800" height="533" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/6896/dna-tale-of-3-to-4-years-old-serbia-boy</guid>
	<pubDate>Tue, 26 Nov 2013 17:34:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/6896/dna-tale-of-3-to-4-years-old-serbia-boy</link>
	<title><![CDATA[DNA tale of 3 to 4 years old Serbia boy]]></title>
	<description><![CDATA[<p><span>The genome of a young boy found underground at Mal&rsquo;ta near Lake Baikal of eastern Siberia around 24,000 years ago came out as close relative of Europeans and Native Indians.</span></p><p><span>Link:</span></p><p><span><a href="http://www.nytimes.com/2013/11/21/science/two-surprises-in-dna-of-boy-found-buried-in-siberia.html?_r=0">http://www.nytimes.com/2013/11/21/science/two-surprises-in-dna-of-boy-found-buried-in-siberia.html?_r=0</a></span></p><p>&nbsp;</p><p><a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature12736.html">http://www.nature.com/nature/journal/vaop/ncurrent/full/nature12736.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>