<?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/36739?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/36739?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/34470/simngs-and-simlibrary-%E2%80%93-software-for-simulating-next-gen-sequencing-data</guid>
	<pubDate>Tue, 28 Nov 2017 06:49:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34470/simngs-and-simlibrary-%E2%80%93-software-for-simulating-next-gen-sequencing-data</link>
	<title><![CDATA[simNGS and simLibrary – Software for Simulating Next-Gen Sequencing Data]]></title>
	<description><![CDATA[<p>simNGS is software for simulating observations from Illumina sequencing machines using the statistical models behind the AYB base-calling software. By default, observations only incorporate noise due to sequencing and do not incorporate effects from more esoteric sources of noise that may be present in real data ("dust", bubbles, merged clusters, sequence-heterogeneous clusters, etc). Many of these additional sources may optionally applied.</p>
<p>simNGS takes fasta format sequences and a file describing the covariance of noise between bases and cycles observed in an actual run of the machine, randomly generates noisy intensities representing the signals for the sequence at each cycle and calculates likelihoods for all possible base calls.</p><p>Address of the bookmark: <a href="https://www.ebi.ac.uk/goldman-srv/simNGS/" rel="nofollow">https://www.ebi.ac.uk/goldman-srv/simNGS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</guid>
	<pubDate>Mon, 26 Aug 2019 18:07:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</link>
	<title><![CDATA[LRSDAY: Long-read Sequencing Data Analysis for Yeasts]]></title>
	<description><![CDATA[<p><span>Long-read sequencing technologies have become increasingly popular in genome projects due to their strengths in resolving complex genomic regions. As a leading model organism with small genome size and great biotechnological importance, the budding yeast,&nbsp;</span><em>Saccharomyces cerevisiae</em><span>, has many isolates currently being sequenced with long reads.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/yjx1217/LRSDAY" rel="nofollow">https://github.com/yjx1217/LRSDAY</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</guid>
	<pubDate>Mon, 18 May 2020 16:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: Package for Next Generation Sequencing and Genome Assembly]]></title>
	<description><![CDATA[<div>
<p>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.<br><br>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.<br><br>Therefore, Genobuntu offers a well-tailored environment for both novices and experts working in the field of genome assembly.</p>
</div>
<div>
<h3>Features</h3>
<ul>
<li>Velvet</li>
<li>MiB</li>
<li>SSAKE</li>
<li>EULER</li>
<li>VCAKE</li>
<li>ABySS</li>
<li>ALLPATHS</li>
<li>Celera</li>
<li>SHARCGS</li>
<li>Allpaths</li>
<li>IDBA</li>
<li>TAIPAN</li>
<li>Edena</li>
<li>SOAPdenovo</li>
<li>Maq</li>
<li>IDBA-UD</li>
<li>No. of Reads present in the Ref. Seq.</li>
<li>ART NGS Reads Simulator</li>
<li>HiTEC, FASTQC</li>
<li>Minimum Description Length</li>
<li>SOAPaligner</li>
<li>Sequencing Read Archive Toolkit</li>
</ul>
</div><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</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/researchlabs/view/4591/the-breitbart-lab</guid>
  <pubDate>Tue, 17 Sep 2013 18:19:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Breitbart lab]]></title>
  <description><![CDATA[
<p>Breitbart’s lab has created a new branch of biology called metagenomics in which one can sample and sequence genetic material collected from the environment.</p>

<p>Breitbart lab is located in the College of Marine Science at the University of South Florida. She is chosen as top "10 Brilliant" scientist by Popular Science magazine.<br />http://www.popsci.com/science/article/2013-09/mya-breitbart</p>

<p>Lab Link:<br />https://sites.google.com/site/breitbartgenomicslab/<br />http://www.marine.usf.edu/faculty/mya-breitbart.shtml</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</guid>
	<pubDate>Wed, 09 Oct 2013 13:37:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</link>
	<title><![CDATA[Key Bioinformatics Scientists]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors" rel="nofollow">http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>