<?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/29280?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/29280?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</guid>
	<pubDate>Thu, 26 Jul 2018 04:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37411/my-commonly-used-commands-in-bioinformatics</link>
	<title><![CDATA[My commonly used commands in Bioinformatics]]></title>
	<description><![CDATA[<p>FYI, I've found it useful to use MUMmer to extract the specific changes that Racon makes, so I can evaluate them individually:</p><pre><code>minimap -t 24 assembly.fasta long_reads.fastq.gz | racon -t 24 long_reads.fastq.gz - assembly.fasta racon_assembly.fasta
nucmer -p nucmer assembly.fasta racon_assembly.fasta
show-snps -C -T -r nucmer.delta
</code></pre><p>This reports Racon's changes in a table. You can exclude indels with the&nbsp;<code>-I</code>&nbsp;option in&nbsp;<code>show-snps</code>.&nbsp;</p><p>This process (Racon -&gt; MUMmer -&gt; SNP table) solves the problem I originally raised in this issue. So as far as I'm concerned, you can close this issue (or keep it open if you still want to implement some kind of variant table).</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/14756/roderic-guigo-lab</guid>
  <pubDate>Mon, 01 Sep 2014 17:13:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Roderic Guigó Lab]]></title>
  <description><![CDATA[
<p>Research in our group focuses on the investigation of the signals involved in gene specification in genomic sequences (promoter elements, splice sites, translation initiation sites, etc…). We are interested both in the mechanism of their recognition and processing, and in their evolution. In addition, but related to this basic component of our research, our group is also involved in the development of software for gene prediction and annotation in genomic sequences. Our group also actively participates in the analysis of many eukaryotic genomes and it in involved in the NIH-funded ENCODE project. Furthermore we are members of two large cancer-studies consortia (chronic lymphocytic leukemia "CLL" and Breast Cancer -Hospital del Mar/CRG/Roche-).  <br /> <br />More at http://big.crg.cat/computational_biology_of_rna_processing</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/15000/which-mathstatistics-programming-languageapplication-do-you-most-frequently-use-in-bioinformatics</guid>
	<pubDate>Thu, 04 Sep 2014 17:46:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/15000/which-mathstatistics-programming-languageapplication-do-you-most-frequently-use-in-bioinformatics</link>
	<title><![CDATA[Which math/statistics programming language/application do you most frequently use in bioinformatics?]]></title>
	<description><![CDATA[<p>I'm doing a bit more statistical analysis on some bioinformatics things lately, and I'm curious if there are any programming languages that are particularly good for this NGS computation. What suggestions do you guys have? Are there any languages that have exceptionally good libraries?</p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</guid>
	<pubDate>Tue, 22 Oct 2019 22:05:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</link>
	<title><![CDATA[ALF--a simulation framework for genome evolution.]]></title>
	<description><![CDATA[<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;"><span style="color: #4d4d4d; font-size: small; font-style: normal; font-weight: 400; text-align: left; background-color: #ffffff; float: none;">Artificial Life Framework (ALF)</span> simulates a root genome into a number of related genomes. Result files include the resulting gene sequences, true tree and true MSAs. A description of ALF can be found in the following article:</p>
<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;">Daniel A Dalquen, Maria Anisimova, Gaston H Gonnet, Christophe Dessimoz: ALF - A Simulation Framework for Genome Evolution.<span>&nbsp;</span><em>Mol Biol Evol</em>, 29(4):1115-1123, April 2012.<br><a href="http://mbe.oxfordjournals.org/content/29/4/1115" target="_blank">http://mbe.oxfordjournals.org/content/29/4/1115</a></p><p>Address of the bookmark: <a href="http://alfsim.org/#index" rel="nofollow">http://alfsim.org/#index</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19187/srbioinformatics-analyst-ngs-at-ocimum-biosolution</guid>
  <pubDate>Sat, 15 Nov 2014 04:46:10 -0600</pubDate>
  <link></link>
  <title><![CDATA[Sr.Bioinformatics Analyst (NGS) at Ocimum Biosolution]]></title>
  <description><![CDATA[
<p>“Ocimum Biosolution” is a comprehensive Integrated Life Science Informatics solutions provider with service offerings that span Sample and Data Management (LIMS, Biologics Data Management), Genomics Data Analysis Services such as Gene Expression, Genotyping, and Next Gen Sequencing, Bioinformatics and Genomics Databases (BioExpress®, ToxExpress®) and Bio-IT consulting services.</p>

<p>Experience Required: 3-5 years of experience</p>

<p>No of Positions : Multiple</p>

<p>Qualifications: Candidates with minimum qualification as M.Sc Bioinformatics with 3-5  years of experience in Life sciences R&amp;D or Pharma Industry.</p>

<p>Ph.D candidates with research experience in Bioinformatics with publications in International journal and minimum 2 years of  industry experience in clinical genomics will be preferred for this position.</p>

<p>Requirement:</p>

<p>1.  Must have basic understanding of molecular biology and Genomics.</p>

<p>2. Experience in application development or must have expertise in programming using either of Perl/Python.</p>

<p>3.  Experience in statistical programming using R/Bioconductor/Matlab.</p>

<p>4. Strong concept in statistical and mathematical modelling.</p>

<p>5.  Experience in designing and developing the bioinformatics pipeline.</p>

<p>6.  Must have minimum 2+ years of hands on experience in NSG data analysis such as RNA-Seq,Exome-Seq ,Chip-Seq and downstream analysis.</p>

<p>7. Knowledge in WGS ,WES, Targeted re-sequencing,GWAS and population genomics will be preferred.</p>

<p>8. Must have experience working on opensource software/Framework and commercial software for NGS data analysis and reporting.</p>

<p>9. Should be aware of handling big data and guiding team members on multiple projects simultaneously.</p>

<p>10. Should have experience coordinating with different groups of clinical research scientist for various project requirements.</p>

<p>11. Ability to work as team as well as independently with minimal support.</p>

<p>More at http://www.ocimumbio.com/careers1/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/19979/zhang-lab</guid>
  <pubDate>Sun, 28 Dec 2014 12:43:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[Zhang Lab]]></title>
  <description><![CDATA[
<p>We develop and use integrative bioinformatics approaches to extract biological meanings from experimental data and generate hypotheses for experimental validation. Please explore our website to learn more about our people and our research.</p>

<p>More at http://bioinfo.vanderbilt.edu/zhanglab/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</guid>
	<pubDate>Sat, 13 Oct 2018 14:17:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</link>
	<title><![CDATA[You can't hide from Genome Hackers]]></title>
	<description><![CDATA[<p><span>Young computational biologist named Yaniv Erlich shocked the research world by showing it was possible to&nbsp;</span><a href="https://www.wired.com/2013/01/your-genome-could-reveal-your-identity/">unmask the identities</a><span>&nbsp;of people listed in anonymous genetic databases using&nbsp;</span><a href="http://science.sciencemag.org/content/339/6117/321" target="_blank">only an Internet connection</a></p><p>Paper: http://science.sciencemag.org/content/early/2018/10/10/science.aau4832</p><p>More at&nbsp;https://www.wired.com/story/genome-hackers-show-no-ones-dna-is-anonymous-anymore/</p>]]></description>
	<dc:creator>Neel</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/news/view/22793/sequencing-by-xpansion</guid>
	<pubDate>Wed, 17 Jun 2015 20:58:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22793/sequencing-by-xpansion</link>
	<title><![CDATA[Sequencing By Xpansion]]></title>
	<description><![CDATA[<p>Sequencing By Xpansion (SBX) is a DNA sequencing method that uses a simple biochemical reaction to encode the sequence of a DNA molecule into a highly measurable surrogate called an Xpandomer. This single molecule approach produces enough Xpandomer in a single drop reaction to sequence an entire human genome 1000X over. To achieve this, an Xpandomer replaces each DNA sequence with a sequence of large, high signal reporter molecules using the SBX molecular expansion technology. The DNA sequence is then read out as the Xpandomer reporters pass sequentially through a nanopore detector. SBX is a molecular engineering platform that benefits from core design principles that separate the multiple molecular functions. This systems approach enables efficient development and incorporation of improvements to SBX and is key to reconfiguring and optimizing Xpandomer measurement for different detection platforms.</p><p>http://www.stratosgenomics.com/stratos-genomics-technology</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>