<?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/5388?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/5388?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/17843/pathway-analysis</guid>
	<pubDate>Fri, 03 Oct 2014 08:51:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/17843/pathway-analysis</link>
	<title><![CDATA[Pathway Analysis]]></title>
	<description><![CDATA[<p>Pathway Analysis is usually performed with aim to enrich the genes with their functional information and reveal the underlying biological mechanisms pursue by genes. Pathway Analysis is not only limited to what biological pathways a particular set of expressed genes follow but also to disclose the relationships between these genes. With availability of more genomics, transcriptomics and proteomics data, interactions between genes involve in multiple pathways become more clear and also relationships between the genes, their transcripts, and their gene products. However, existing tools and dbs mainly based on knowledge driven approach in which pathways will be identified by finding the correlation between the&nbsp;<span>information in one of the pathway knowledge databases (KEGG,Reactome,Panther,BioCarta, Panther,GO,NCI,WikiPathways,etc) and gene expression result for a specific conditions for instance tumor, obesity , cold resistant crops/plants, etc.</span></p><p><span><strong>Introductory Articles/ppt/sources</strong>:</span></p><p><a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1002375"><span>http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1002375</span></a></p><p><a href="http://bioinformatics.mdanderson.org/MicroarrayCourse/Lectures09/Pathway%20Analysis.pdf"><span>http://bioinformatics.mdanderson.org/MicroarrayCourse/Lectures09/Pathway%20Analysis.pdf</span></a></p><p><a href="http://gettinggeneticsdone.blogspot.de/2012/03/pathway-analysis-for-high-throughput.html"><span>http://gettinggeneticsdone.blogspot.de/2012/03/pathway-analysis-for-high-throughput.html</span></a></p><p><a href="http://davetang.org/muse/tag/pathway/"><span>http://davetang.org/muse/tag/pathway/</span></a></p><p><a href="https://www.biostars.org/p/42219/"><span>https://www.biostars.org/p/42219/</span></a></p><p><a href="http://bioinformatics.ca//files/public/Pathways_2014_Module4_v2.pdf"><span>http://bioinformatics.ca//files/public/Pathways_2014_Module4_v2.pdf</span></a></p><p><a href="http://bioinformatics.ca//files/public/Pathways_2014_Module2.pdf"><span>http://bioinformatics.ca//files/public/Pathways_2014_Module2.pdf</span></a></p><p><span><strong>Impotant Database and Tools</strong>:</span></p><p>GeneMANIA, Cytoscape,&nbsp;<a href="http://www.ingenuity.com/products/ipa">IPA</a>&nbsp;and <a href="http://thomsonreuters.com/metacore/">Metacore</a> (Commerical ),&nbsp;<span>Pathway Commons, Reactome ,Panther, BioCyc, WikiPathways, Pathvisio, KEGG, NCI, Stringdb, Amigo,&nbsp;<span>WebGestalt ,<span>ConsensusPathDB ,GSEA,Blast2go</span></span></span></p><p><span><strong>Popular R based tools</strong>:</span></p><p><span>Reactome.db, ReactomePA, ClusterProfiler, Gage, SPIA, topGO, Pathview,DOSE,GOStat</span></p><p><span><strong>More</strong>:</span></p><p><a href="http://www.bioconductor.org/help/search/index.html?q=Enrichment+analysis+"><span>http://www.bioconductor.org/help/search/index.html?q=Enrichment+analysis+</span></a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</guid>
	<pubDate>Fri, 13 May 2016 04:54:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27323/cutadapt</link>
	<title><![CDATA[cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cleaning your data in this way is often required: Reads from small-RNA sequencing contain the 3&rsquo; sequencing adapter because the read is longer than the molecule that is sequenced. Amplicon reads start with a primer sequence. Poly-A tails are useful for pulling out RNA from your sample, but often you don&rsquo;t want them to be in your reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite <a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a> .</p><p>Address of the bookmark: <a href="https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart" rel="nofollow">https://cutadapt.readthedocs.io/en/stable/installation.html#quickstart</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Fri, 19 May 2017 07:44:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS is a tool able to merge two or more assemblies in order to improve contiguity and correctness. It can be used on all NGS-based assembly projects and it shows its full potential with multi-library Illumina-based projects. With more than 20 available assemblers it is hard to select the best tool. In this context we propose a tool that improves assemblies (and, as a by-product, perhaps even assemblers) by merging them and selecting the generating that is most likely to be correct.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/36405/earth-biogenome-project</guid>
	<pubDate>Wed, 25 Apr 2018 07:48:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/36405/earth-biogenome-project</link>
	<title><![CDATA[Earth BioGenome Project]]></title>
	<description><![CDATA[<p><span>The central goal of the Earth BioGenome Project is to understand the evolution and organization of life on our planet by sequencing and functionally annotating the genomes of 1.5 million known species of eukaryotes, a massive group that includes plants, animals, fungi and other organisms whose cells have a nucleus that houses their chromosomal DNA. To date, the genomes of less than 0.2 percent of eukaryotic species have been sequenced.&nbsp;</span></p><p><span>More at&nbsp;https://www.ucdavis.edu/news/earth-biogenome-project-aims-sequence-dna-all-complex-life</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/1956/structure-of-binary-files-used-for-storing-sequencing-data-bam-and-sff</guid>
	<pubDate>Sun, 11 Aug 2013 14:29:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/1956/structure-of-binary-files-used-for-storing-sequencing-data-bam-and-sff</link>
	<title><![CDATA[Structure of Binary files used for storing sequencing data-bam and sff]]></title>
	<description><![CDATA[<p>Many times bioinformatician needs to parse binary files like bam and sff. Advantage of binary files is that they occupy less space in memory with maximum information content.</p><p>Link for those who looking for structure of Bam and sff file:</p><p>Bam:</p><p><a href="http://samtools.sourceforge.net/SAMv1.pdf">http://samtools.sourceforge.net/SAMv1.pdf</a>&nbsp;(from page 12)</p><p>sff file (for Ion torrent and 454 files):</p><p><a href="http://www.ncbi.nlm.nih.gov/Traces/trace.cgi?cmd=show&amp;f=formats&amp;m=doc&amp;s=format#sff">http://www.ncbi.nlm.nih.gov/Traces/trace.cgi?cmd=show&amp;f=formats&amp;m=doc&amp;s=format#sff</a></p><p>Binary file Editor and Viewer:</p><p><a href="http://mh-nexus.de/en/hxd/">http://mh-nexus.de/en/hxd/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/3889/bioinformatics-and-sequencing-courses-and-workshops</guid>
	<pubDate>Sat, 24 Aug 2013 16:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/3889/bioinformatics-and-sequencing-courses-and-workshops</link>
	<title><![CDATA[Bioinformatics and Sequencing Courses and Workshops]]></title>
	<description><![CDATA[<p>Swiss Institute of Bioinformatics (SIB) organises lots of bioinformatics courses covering wide range of topics:</p><p><a href="http://www.isb-sib.ch/education/training-courses.html">http://www.isb-sib.ch/education/training-courses.html</a></p><p>Canadian bioinformatics also organises various bioinformatics and sequencing courses:</p><p><a href="http://bioinformatics.ca/workshops">http://bioinformatics.ca/workshops</a></p><p>In addition to above two, EMBI&nbsp;Europe, EMBO Europe, Cold Spring Harbour USA, Wellcome Trust UK and NOVA&nbsp;Europe&nbsp;also organise bioinformatics and sequencing courses annually:</p><p><a href="http://www.embl.de/training/events/index.php?p_outstation=ALL">http://www.embl.de/training/events/index.php?p_outstation=ALL</a></p><p><a href="http://www.embo.org/funding-awards/courses-workshops">http://www.embo.org/funding-awards/courses-workshops</a></p><p><a href="http://meetings.cshl.edu/courses.html">http://meetings.cshl.edu/courses.html</a></p><p><a href="http://www.wellcome.ac.uk/Education-resources/Courses-and-conferences/Advanced-Courses-and-Scientific-Conferences/Advanced-Courses/index.htm">http://www.wellcome.ac.uk/Education-resources/Courses-and-conferences/Advanced-Courses-and-Scientific-Conferences/Advanced-Courses/index.htm</a></p><p><a href="http://www.nova-university.org/pagetop.cfm?MenySidorTop_id=2&amp;open=7">http://www.nova-university.org/pagetop.cfm?MenySidorTop_id=2&amp;open=7</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3030/illuminating-next-generation-sequencing-data-with-go</guid>
	<pubDate>Fri, 23 Aug 2013 07:13:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3030/illuminating-next-generation-sequencing-data-with-go</link>
	<title><![CDATA[Illuminating next generation sequencing data with Go]]></title>
	<description><![CDATA[<p>Another good lecture for Illumina sequencing data analysis from&nbsp;</p>
<p>Dan Kortschak,&nbsp;Bioinformatics Group,&nbsp;School of Molecular and Biomedical Science ,The University of Adelaide</p><p>Address of the bookmark: <a href="http://talks.biogo.googlecode.com/git/illumination/illumination.pdf" rel="nofollow">http://talks.biogo.googlecode.com/git/illumination/illumination.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>