<?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/37512?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/37512?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</guid>
	<pubDate>Mon, 22 May 2017 05:43:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</link>
	<title><![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]></title>
	<description><![CDATA[<p>This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at&nbsp;<a href="mailto:kklam@eecs.berkeley.edu">kklam@eecs.berkeley.edu</a>. My name is Ka-Kit Lam.</p>
<p>https://github.com/kakitone/MetaFinisherSC</p>
<p>https://github.com/kakitone/BIGMAC</p><p>Address of the bookmark: <a href="https://github.com/kakitone/BIGMAC" rel="nofollow">https://github.com/kakitone/BIGMAC</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/38172/bamview-a-free-interactive-display-of-read-alignments-in-bam-data-files</guid>
	<pubDate>Fri, 09 Nov 2018 13:43:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38172/bamview-a-free-interactive-display-of-read-alignments-in-bam-data-files</link>
	<title><![CDATA[BamView: a free interactive display of read alignments in BAM data files]]></title>
	<description><![CDATA[<p>To run the application on UNIX from the downloaded jar file run the UNIX:</p>
<p><tt>java -mx512m -jar BamView.jar</tt></p>
<p>and extra command line options are given when '-h' is used:</p>
<p><tt>java -jar BamView.jar -h</tt></p>
<p>BAM files can be specified on the command line with the '-a' option:</p>
<p><tt>java -mx512m -jar BamView.jar -a pathToFile/sorted.bam</tt></p>
<p>If a BAM filename is not given on the command line BamView will prompt for a file to be entered. The BAM index file should have the same name as the BAM file but with a '.bai' suffix. Multiple BAM files can be loaded and overlaid in the viewer. To make this easier BamView will read in files that contain a list of filenames.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://bamview.sourceforge.net/" rel="nofollow">http://bamview.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44527/alvis-a-tool-for-contig-and-read-alignment-visualisation-and-chimera-detection</guid>
	<pubDate>Wed, 08 May 2024 07:02:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44527/alvis-a-tool-for-contig-and-read-alignment-visualisation-and-chimera-detection</link>
	<title><![CDATA[Alvis: a tool for contig and read ALignment VISualisation and chimera detection]]></title>
	<description><![CDATA[<p><span>Alvis, a simple command line tool that can generate visualisations for a number of common alignment analysis tasks. Alvis is a fast and portable tool that accepts input in a variety of alignment formats and will output production ready vector images. Additionally, Alvis will highlight potentially chimeric reads or contigs, a common source of misassemblies.</span></p>
<p>More at&nbsp;https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-021-04056-0</p><p>Address of the bookmark: <a href="https://github.com/SR-Martin/alvis" rel="nofollow">https://github.com/SR-Martin/alvis</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/989/bioinformatics-approach-to-boar-taint</guid>
	<pubDate>Wed, 17 Jul 2013 15:50:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/989/bioinformatics-approach-to-boar-taint</link>
	<title><![CDATA[Bioinformatics approach to Boar Taint]]></title>
	<description><![CDATA[<p><span>Meat products obtained from intact male pigs often produce offensive smell or odour which is recognized as a complex genetic trait called boar taint.Androstenone and Skatole&nbsp;in the fat primarily cause boar taint. Metabolism of androstenone and sex steroids share a common pathway which makes removal of boar taint a very challenging task. Castration is a traditional solution to remove boar taint but it also results in bad quality of meat due to low level of steroids which is objectionable to many consumers. Detected functional variant(s) underlying boar taint compounds can be used as genetic markers in selection of male pigs with reduced boar taint levels. Resequencing of a total of 47 samples belong to Norwegian Landrace (NL) and Duroc (D) pigs with varied boar taint levels were done in Illumina HiSeq2000 to &gt;10X average coverage. Short reads generated from these samples mapped to&nbsp;<em>Sus Scrofa</em>&nbsp;version 10.2 reference assembly using Bowtie2. Alignment file then used for calling SNPs and InDels inside previousy identified QTL regions on SSC5,13, and 7 with the aid of FreeBayes , a variant caller tool. A final list of SNPs was prepared after filtering SNPs on the basis of SNP quality, coverage of SNP allele, functional and structural annotation, and repeats, etc. Selected SNPs will be genotyped in sample population for validation and then used for constructing SNPs haplotypes in close linkage disequilibrium with QTLs and fine mapping of QTLs through association mapping of genotyped SNPs.</span><span>&nbsp;</span></p><p><span>&nbsp;</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/989" length="19688" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1926</guid>
	<pubDate>Sun, 11 Aug 2013 11:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1926</link>
	<title><![CDATA[Want to Know which genome assembler rule the world ?]]></title>
	<description><![CDATA[<p><span><strong>Assemblathon 2</strong>: evaluating de novo methods of genome assembly&nbsp;</span></p><p><span><a href="http://www.gigasciencejournal.com/content/2/1/10/abstract">http://www.gigasciencejournal.com/content/2/1/10/abstract</a></span></p><p><span><a href="http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html">http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html</a></span></p><p><a href="http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p">http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</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>