<?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/37496?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/37496?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</guid>
	<pubDate>Tue, 28 Jan 2020 03:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</link>
	<title><![CDATA[Π-cyc: A Reference-free SNP Discovery Application using Parallel Graph Search]]></title>
	<description><![CDATA[<p>Reference free SNP search for comparative population genomics: multiple samples run simultanously. **experimental phase, compiles and runs with OpenMPI-1.8.8 with Intel Compiler only</p>
<p><span>Cycles enumeration (aka Bubbles) as part of de novo de bruijn graphs assembly using colours can be unpractical for large error prone genomes which makes the assembly process produce an excessive number of false positive cycles.&nbsp; Our solution is to search the graph in multicores shared memory parallel mode using graph decomposition then use filtering method to generate good quality SNPs.</span></p>
<p><a href="https://arxiv.org/abs/1809.06700">https://arxiv.org/abs/1809.06700</a></p>
<p><a href="https://github.com/redayounsi/2KP2P">https://github.com/redayounsi/2KP2P</a></p>
<blockquote>
<p>/2kp2omp/bin/main_2kp2_K63_C2 -i fastq_files.txt -o fungus_bub.fasta -r stat_fungus.txt -c cov_fungus_hash.txt -k 63 -h 20 -b 100 -g 600 -l 100 -f 16 -t 5.0 -x 1 -v 0 -p 1 -y 1 -u 1</p>
<p>&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="https://github.com/redayounsi/2KP2P" rel="nofollow">https://github.com/redayounsi/2KP2P</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</guid>
	<pubDate>Wed, 10 Jan 2018 03:10:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</link>
	<title><![CDATA[GIGGLE: a search engine for large-scale integrated genome analysis]]></title>
	<description><![CDATA[<p><span>GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (</span><a href="https://github.com/ryanlayer/giggle">https://github.com/ryanlayer/giggle</a><span>) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation.</span></p>
<p>https://www.nature.com/articles/nmeth.4556</p><p>Address of the bookmark: <a href="https://github.com/ryanlayer/giggle" rel="nofollow">https://github.com/ryanlayer/giggle</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</guid>
	<pubDate>Fri, 07 Apr 2023 13:11:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</link>
	<title><![CDATA[Carrot2 clustering engine]]></title>
	<description><![CDATA[<h2>&nbsp;</h2>
<p>This is the demo application of the&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;clustering engine</a>. It uses Carrot<sup>2</sup>'s algorithms to organize search results into thematic folders.</p>
<h3>User interfaces</h3>
<ul>
<li><span><a href="https://search.carrot2.org/#/search/:source">Web Search Clustering</a></span>&nbsp;organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.</li>
<li><span><a href="https://search.carrot2.org/#/workbench">Clustering Workbench</a></span>&nbsp;clusters content from local files in JSON or Excel format, Solr or Elasticsearch; allows tuning of clustering parameters and exporting results as Excel or JSON.</li>
</ul>
<h3>Search engines</h3>
<ul>
<li><span>Web</span>:&nbsp;<span>web search results provided by&nbsp;<a href="https://etools.ch/" target="_blank">etools.ch</a>. Extensive use may require special arrangements with the&nbsp;<a href="mailto:sschmid@comcepta.com" target="_blank">owner</a>&nbsp;of the etools.ch service.</span></li>
<li><span>PubMed</span>:&nbsp;<span>abstracts of medical papers from the PubMed database provided by NCBI.</span></li>
<li><span>Local file</span>:&nbsp;<span>content read from a local file in Carrot2 XML, JSON, CSV or Excel format.</span></li>
<li><span>Solr</span>:&nbsp;<span>queries an Apache Solr instance.</span></li>
<li><span>Elasticsearch</span>:&nbsp;<span>queries an Elasticsearch instance.</span></li>
</ul>
<h3>Clustering algorithms</h3>
<ul>
<li><span>Lingo</span>:&nbsp;<span>creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a>.</span></li>
<li><span>STC</span>:&nbsp;<span>the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
<li><span>k-means</span>:&nbsp;<span>base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
</ul><p>Address of the bookmark: <a href="https://search.carrot2.org/#/search/web" rel="nofollow">https://search.carrot2.org/#/search/web</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10237/genome-of-rainbow-trout-sequenced</guid>
	<pubDate>Fri, 25 Apr 2014 10:36:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10237/genome-of-rainbow-trout-sequenced</link>
	<title><![CDATA[Genome of Rainbow Trout Sequenced]]></title>
	<description><![CDATA[<p>Major finding:</p><p><span>&ldquo;In humans and most vertebrates the duplication events were older so there are fewer duplicated genes still present. Most of the duplicated genes get lost or modified so much that they are no longer recognizable as duplicates over time. In the trout and salmon we can see an earlier stage in the process and many duplicated genes are still present,&rdquo; said Dr Gary Thorgaard of Washington State University, a co-author of the paper published in the journal Nature Communications.</span></p><p><span>Source:</span></p><p><span>http://www.sci-news.com/genetics/science-genome-rainbow-trout-01877.html</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10378/real-time-sequencing</guid>
	<pubDate>Sun, 04 May 2014 18:16:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10378/real-time-sequencing</link>
	<title><![CDATA[Real time Sequencing]]></title>
	<description><![CDATA[<p><span>&ldquo;... we now know we can do high-throughput sequencing at any location on Earth,&rdquo; Moroz said.</span></p><p><span>Source:</span></p><p><span>http://news.ufl.edu/2014/04/28/real-time-genome-sequencing-at-sea/</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11365/drawback-of-exome-sequencing</guid>
	<pubDate>Mon, 02 Jun 2014 05:46:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11365/drawback-of-exome-sequencing</link>
	<title><![CDATA[Drawback of Exome Sequencing]]></title>
	<description><![CDATA[<p><span><span>Dr Eric Londin, Assistant Professor, Thomas Jefferson University, USA, stated that analysis of 44 exome datasets from four different testing kits showed that they missed a high proportion of clinically relevant regions in the 56 ACMG genes. "At least one gene in each exome method was missing more than 40 percent of disease-causing genetic variants, and we found that the worst-performing method missed more than 90 percent of such variants in four of the 56 genes," he says.</span><br /></span></p><p><span><strong>Source</strong>:&nbsp;http://www.eurekalert.org/pub_releases/2014-05/esoh-pco052914.php</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>