<?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/17843?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/17843?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/news/view/2991/illumina-reveals-first-dataset-of-long-reads</guid>
	<pubDate>Fri, 23 Aug 2013 06:29:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</link>
	<title><![CDATA[Illumina reveals first dataset of long reads]]></title>
	<description><![CDATA[<p>With the help of Moleculo technology , acquired by Illumina releases new service for long reads sequencing i.e., &nbsp;<a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">FastTrack Long Reads</a>.</p><p>Average read length is around<span>&nbsp;8,500 base pairs in release dataset.</span>&nbsp;Best thing about this, there is not much effect on cost and quality of data.</p><p>You can also check following pages for publications on long reads and more:</p><p><a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">http://www.illumina.com/services/long-read-sequencing-service.ilmn</a></p><p><a href="http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/">http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/</a></p><p>&nbsp;</p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4212/eivind-hovigs-lab</guid>
  <pubDate>Tue, 03 Sep 2013 19:06:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Eivind Hovig's Lab]]></title>
  <description><![CDATA[
<p>Bioinformatics relevant research topics are:</p>

<p>genomic scale studies<br />endogenous mechanisms of mutations, germ line and somatic <br />computational aspects of immunology in cancer <br />signalling networks<br />three-dimensional organization of information in the nucleus<br />gene silencing<br />metastatic cross-talk<br />kinase signaling<br />personalized medicine<br />detection of biomarkers in cancer <br />historical DNA variation</p>

<p>From : http://www.ous-research.no/hovig/</p>

<p>Group address:<br />Eivind Hovig, The Norwegian Radium Hospital, Montebello, 0310 Oslo,Norway<br />Email: ehovig@radium.uio.no</p>
]]></description>
</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9675/application-scientist-in-strand-lifesciences-bangalore</guid>
  <pubDate>Mon, 07 Apr 2014 08:17:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[Application Scientist in Strand LifeSciences Bangalore]]></title>
  <description><![CDATA[
<p>Job Description<br />We are looking for a motivated application scientist to help evaluate, compare, and develop next generation sequencing (NGS) data analysis methods. The successful candidate should be able to quickly understand the state-of-art computational biology techniques, prototype them and perform benchmarking studies. The candidate must also be comfortable working with people from different disciplines and be able to present data analysis results in a clear and effective manner. The candidate is also expected to interact with customers as needed, write technical reports and publish new methods and/or data analysis findings in public forums.</p>

<p>Candidate Requirements:<br />A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered. </p>

<p>To Apply<br />To apply, please send your updated CV and cover letter to Dr. Rohit Gupta (rohit@strandls.com). </p>

<p>Source: http://www.strandls.com/application-scientist</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</guid>
	<pubDate>Mon, 02 Jun 2014 08:04:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</link>
	<title><![CDATA[Metagenomics role in antibiotic resistance]]></title>
	<description><![CDATA[<p>Related latest article:</p>
<p><a href="http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf">http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf</a></p><p>Address of the bookmark: <a href="https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf" rel="nofollow">https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</guid>
	<pubDate>Tue, 07 Nov 2017 05:33:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34221/alignment-free-sequence-comparison-tools-available-for-next-generation-sequencing-data-analysis</link>
	<title><![CDATA[Alignment-free sequence comparison tools available for next-generation sequencing data analysis]]></title>
	<description><![CDATA[<div><p><span>kallisto</span></p></div><div><p>Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)</p><p>Software (C++)</p><p><a href="https://pachterlab.github.io/kallisto/">https://pachterlab.github.io/kallisto/</a></p><p>Sailfish</p><p>Estimation of isoform abundances from reference sequences and RNA-seq data (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="http://www.cs.cmu.edu/~ckingsf/software/sailfish/">http://www.cs.cmu.edu/~ckingsf/software/sailfish/</a></p><p>Salmon</p><p>Quantification of the expression of transcripts using RNA-seq data (uses&nbsp;<em>k</em>-mers)</p><p><a href="https://combine-lab.github.io/salmon/">https://combine-lab.github.io/salmon/</a></p><p>RNA-Skim</p><p>RNA-seq quantification at transcript-level (partitions the transcriptome into disjoint transcript clusters; uses&nbsp;<em>sig</em>-mers, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C++)</p><p><a href="http://www.csbio.unc.edu/rs/">http://www.csbio.unc.edu/rs/</a></p><p>Variant calling</p><p>ChimeRScope</p><p>Fusion transcript prediction using gene&nbsp;<em>k</em>-mers profiles of the RNA-seq paired-end reads</p><p>Software (Java)</p><p><a href="https://github.com/ChimeRScope/ChimeRScope/wiki">https://github.com/ChimeRScope/ChimeRScope/wiki</a></p><p>FastGT</p><p>Genotyping of known SNV/SNP variants directly from raw NGS sequence reads by counting unique&nbsp;<em>k</em>-mers</p><p>Software (C)</p><p><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></p><p>Phy-Mer</p><p>Reference-independent mitochondrial haplogroup classifier from NGS data (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/danielnavarrogomez/phy-mer">https://github.com/danielnavarrogomez/phy-mer</a></p><p>LAVA</p><p>Genotyping of known SNPs (dbSNP and Affymetrix's Genome-Wide Human SNP Array) from raw NGS reads (<em>k</em>-mer based)</p><p>Software (C)</p><p><a href="http://lava.csail.mit.edu/">http://lava.csail.mit.edu/</a></p><p>MICADo</p><p>Detection of mutations in targeted third-generation NGS data (can distinguish patients&rsquo; specific mutations; algorithm uses&nbsp;<em>k</em>-mers and is based on colored de Bruijn graphs)</p><p>Software (Python)</p><p><a href="http://github.com/cbib/MICADo">http://github.com/cbib/MICADo</a></p><p>General mapper</p><p>Minimap</p><p>Lightweight and fast read mapper and read overlap detector (uses the concept of &ldquo;minimazers&rdquo;, a special type of&nbsp;<em>k</em>-mers)</p><p>Software (C)</p><p><a href="https://github.com/lh3/minimap">https://github.com/lh3/minimap</a></p><p>Assembly</p><p>De novo genome assembly</p><p>MHAP</p><p>Produces highly continuous assembly (fully resolved chromosome arms) from third-generation long and noisy reads (10 kbp) using a dimensionality reduction technique MinHash</p><p>Software (Java)</p><p><a href="https://github.com/marbl/MHAP">https://github.com/marbl/MHAP</a></p><p>Miniasm</p><p>Assembler of long noisy reads (SMRT, ONT) using the Overlap-Layout Consensus (OLC) approach without the necessity of an error correction stage (uses minimap)</p><p>Software (C)</p><p><a href="https://github.com/lh3/miniasm">https://github.com/lh3/miniasm</a></p><p>LINKS</p><p>Scaffolding genome assembly with error-containing long sequence (e.g., ONT or PacBio reads, draft genomes)</p><p>Software (Perl)</p><p><a href="https://github.com/warrenlr/LINKS/">https://github.com/warrenlr/LINKS/</a></p><p>Read clustering</p><p>afcluster</p><p>Clustering of reads from different genes and different species based on&nbsp;<em>k</em>-mer counts</p><p>Software (C++)</p><p><a href="https://github.com/luscinius/afcluster">https://github.com/luscinius/afcluster</a></p><p>QCluster</p><p>Clustering of reads with alignment-free measures (<em>k</em>-mer based) and quality values</p><p>Software (C++)</p><p><a href="http://www.dei.unipd.it/~ciompin/main/qcluster.html">http://www.dei.unipd.it/~ciompin/main/qcluster.html</a></p><p>Reads error correction</p><p>Lighter</p><p>Correction of sequencing errors in raw, whole genome sequencing reads (<em>k</em>-mer based)</p><p>Software (C++)</p><p><a href="https://github.com/mourisl/Lighter">https://github.com/mourisl/Lighter</a></p><p>QuorUM</p><p>Error corrector for Illumina reads using k-mers</p><p>Software (C++)</p><p><a href="https://github.com/gmarcais/Quorum">https://github.com/gmarcais/Quorum</a></p><p>Trowel</p><p>Software (C++)</p><p><a href="https://sourceforge.net/projects/trowel-ec/">https://sourceforge.net/projects/trowel-ec/</a></p><p>Metagenomics</p><p>Assembly-free phylogenomics</p><p>AAF</p><p>Phylogeny reconstruction directly from unassembled raw sequence data from whole genome sequencing projects; provides bootstrap support to assess uncertainty in the tree topology (<em>k</em>-mer based)</p><p>Software (Python)</p><p><a href="https://github.com/fanhuan/AAF">https://github.com/fanhuan/AAF</a></p><p>kSNP v3</p><p>Reference-free SNP identification and estimation of phylogenetic trees using SNPs (based on&nbsp;<em>k</em>-mer analysis)</p><p>Software (C)</p><p><a href="https://sourceforge.net/projects/ksnp/files/">https://sourceforge.net/projects/ksnp/files/</a></p><p>NGS-MC</p><p>Phylogeny of species based on NGS reads using alignment-free sequence dissimilarity measures d2* and d2&nbsp;S&nbsp;under different Markov chain models (using&nbsp;<em>k</em>-words)</p><p>R package</p><p><a href="http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html">http://www-rcf.usc.edu/~fsun/Programs/NGS-MC/NGS-MC.html</a></p><p>Species identification/taxonomic profiling</p><p>CLARK</p><p>Taxonomic classification of metagenomic reads to known bacterial genomes using&nbsp;<em>k</em>-mer search and LCA assignment</p><p>Software (C++)</p><p><a href="http://clark.cs.ucr.edu/">http://clark.cs.ucr.edu/</a></p><p>FOCUS</p><p>Reports organisms present in metagenomic samples and profiles their abundances (uses composition-based approach and non-negative least squares for prediction)</p><p>Web service Software (Python)</p><p><a href="http://edwards.sdsu.edu/FOCUS/">http://edwards.sdsu.edu/FOCUS/</a></p><p>GSM</p><p>Estimation of abundances of microbial genomes in metagenomic samples (<em>k</em>-mer based)</p><p>Software (Go)</p><p><a href="https://github.com/pdtrang/GSM">https://github.com/pdtrang/GSM</a></p><p>Mash</p><p>Species identification using assembled or unassembled Illumina, PacBio, and ONT data (based on MinHash dimensionality-reduction technique)</p><p>Software (C++)</p><p><a href="https://github.com/marbl/mash">https://github.com/marbl/mash</a></p><p>Kraken</p><p>Taxonomic assignment in metagenome analysis by exact&nbsp;<em>k</em>-mer search; LCA assignment of short reads based on a comprehensive sequence database</p><p>Software (C++)</p><p><a href="https://ccb.jhu.edu/software/kraken/">https://ccb.jhu.edu/software/kraken/</a></p><p>LMAT</p><p>Assignment of taxonomic labels to reads by&nbsp;<em>k</em>-mers searches in precomputed database</p><p>Software (C++/Python)</p><p><a href="https://sourceforge.net/projects/lmat/">https://sourceforge.net/projects/lmat/</a></p><p>stringMLST</p><p><em>k</em>-mer-based tool for MLST directly from the genome sequencing reads</p><p>Software (Python)</p><p><a href="http://jordan.biology.gatech.edu/page/software/stringMLST">http://jordan.biology.gatech.edu/page/software/stringMLST</a></p><p>Taxonomer</p><p><em>k</em>-mer-based ultrafast metagenomics tool for assigning taxonomy to sequencing reads from clinical and environmental samples</p><p>Web service</p><p><a href="http://taxonomer.iobio.io/">http://taxonomer.iobio.io/</a></p><p>Other</p><p>d2-tools</p><p>Word-based (<em>k</em>-tuple) comparison (pairwise dissimilarity matrix using d2S measure) of metatranscriptomic samples from NGS reads</p><p>Software (Python/R)</p><p><a href="https://code.google.com/p/d2-tools/">https://code.google.com/p/d2-tools/</a></p><p>VirHostMatcher</p><p>Prediction of hosts from metagenomic viral sequences based on ONF using various distance measures (e.g., d2)</p><p>Software (C++)</p><p><a href="https://github.com/jessieren/VirHostMatcher">https://github.com/jessieren/VirHostMatcher</a></p><p>MetaFast</p><p>Statistics calculation of metagenome sequences and the distances between them based on assembly using de Bruijn graphs and Bray&ndash;Curtis dissimilarity measure</p><p>Software (Java)</p><p><a href="https://github.com/ctlab/metafast">https://github.com/ctlab/metafast</a></p></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34748/airvf-a-filtering-toolbox-for-precise-variant-calling-in-ion-torrent-sequencing</guid>
	<pubDate>Fri, 22 Dec 2017 00:31:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34748/airvf-a-filtering-toolbox-for-precise-variant-calling-in-ion-torrent-sequencing</link>
	<title><![CDATA[AIRVF: a filtering toolbox for precise variant calling in Ion Torrent sequencing]]></title>
	<description><![CDATA[<p><span>AIRVF that works on flowgram, raw and mapped reads and called variants to reduce artifact-driven false variant calls. Tests on sequencing data of standard reference material showed up to &sim;98% reduction of false variants when combined to conventional public pipelines and &sim;48% to the in-house commercial solution, with a minimal loss of sensitivity</span></p>
<p><span><span>The program with a detailed manual is available at&nbsp;</span><a href="https://sourceforge.net/projects/airvf/" target="">https://sourceforge.net/projects/airvf/</a></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/airvf/" rel="nofollow">https://sourceforge.net/projects/airvf/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>