<?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/29601?offset=1040</link>
	<atom:link href="https://bioinformaticsonline.com/related/29601?offset=1040" 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/opportunity/view/17505/kau-thrissur-biotechbioinformatics-rasrfjrftraineestudentships</guid>
  <pubDate>Fri, 26 Sep 2014 20:07:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[KAU Thrissur Biotech/Bioinformatics RA/SRF/JRF/Trainee/Studentships]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the following posts at Bioinformatics Centre (DIC), IT- BT Complex, College of Horticulture, Kerala Agricultural University, Vellanikkara, Thrissur.</p>

<p>1. Research Associate <br />Emoluments*: 14880/- + HRA 	<br />Qualification needed: Ph.D/M.Sc in Bioinformatics or Ph.D/M.Sc in Agriculture or Biotechnology with advanced Diploma in Bioinformatics <br />Desirable: 2 year experience in Bioinformatics.</p>

<p>2 Senior Research Fellow <br />Emoluments*: 10230/- 	<br />Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/ Biotechnology with Diploma in Bioinformatics. <br />Desirable: One year experience in Bioinformatics</p>

<p>3 Junior Research Fellow <br />Emoluments*: 9300/- 	<br />Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/Biotechnology/Plant Sciences with Diploma in Bioinformatics.</p>

<p>4 .Trainee/Studentship Bioinformatics <br />Emoluments*: 5000/- 	<br />Qualification needed: M.Sc in Bioinformatics with good knowledge of Bioinformatics softwares and tools.</p>

<p>5 Trainee/ Studentship Biotechnology <br />Emoluments*: 5000/- 	<br />Qualification needed: M.Sc in Biotechnology, with working knowledge in tissue culture, molecular markers and cloning of genes.</p>

<p>Candidates with the required qualifications and experience may give an application in the prescribed format with attested copies of certificates to prove eligibility on or before 30th November 2014. The applications are to be addressed to The Associate Dean, College of Horticulture and send to "Professor &amp; Coordinator, Bioinformatics Centre (DIC), IT-BT Complex, Kerala Agricultural University, Vellanikkara, Thrissur, Kerala 680 656”. The envelope may be superscribed “Application for the post at Bioinformatics Centre”.</p>

<p>*Emoluments are likely to be revised in 2014-2015</p>

<p>More at http://www.kaubic.in/downloads/Notification_bic.pdf<br />http://www.kaubic.in/downloads/Application%20form.pdf</p>
]]></description>
</item>
<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/opportunity/view/17894/faculty-position-at-national-institute-of-technology-rourkela</guid>
  <pubDate>Sun, 05 Oct 2014 15:45:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[FACULTY POSITION at NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA]]></title>
  <description><![CDATA[
<p>NIT, Rourkela, an institute of national importance under Ministry of HRD, Govt. of India invites applications from Indian nationals possessing excellent academic background along with commitment to quality teaching and research for faculty positions at the level of Professor, Associate Professor and Assistant Professor in most branches of Engineering, Science, Management and Humanities as per following table:-</p>

<p>    1 Asst. Professor (on Pre-Ph.D. Contract)</p>

<p>    2 Asst. Professor (on Contract)</p>

<p>    3 Asst. Professor</p>

<p>    4 Associate Professor</p>

<p>    5 Professor</p>

<p>Life Sciences:-</p>

<p>    i)Biochemistry and Molecular Biology; ii)Cell and Developmental Biology; iii)Immunology and Molecular Medicine; (iv) Microbiology and Ecology (v)Bioinformatics Group; vi)Biophysical Sciences</p>

<p>HOW TO APPLY:-</p>

<p>a. Candidates willing to apply for one or more posts are requested to apply online at “http://www.nitrkl.ac.in/ JOBS &amp; TENDERS /Faculty Position” .<br />b. Persons employed in Government and Semi-Government organizations may apply directly against the standing advertisement. For this the application should be completed online. The printout of the application generated online should be submitted through employer if shortlisted for interview.<br />c. The online application can be filled in multiple sessions.<br />d. Candidates are required to check the Institute website from time to time for latest information, application status call for interview, change of dates and final results.<br />e. Applications shall be received online only. Please do not send application or CV against this advertisement by email or letter mail.</p>

<p>More Info: http://nitrkl.ac.in/Jobs_Tenders/1FacultyPosition/Default.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</guid>
	<pubDate>Sun, 04 Nov 2018 16:44:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</link>
	<title><![CDATA[Referee: Genome assembly quality scores]]></title>
	<description><![CDATA[<p>Modern genome sequencing technologies provide a succint measure of quality at each position in every read, however all of this information is lost in the assembly process. Referee summarizes the quality information from the reads that map to a site in an assembled genome to calculate a quality score for each position in the genome assembly.</p>
<p>We accomplish this by first calculating genotype likelihoods for every site. For a given site in a diploid genome, there are 10 possible genotypes (AA, AC, AG, AT, CC, CG, CT, GG, GT, TT). Referee takes as input the genotype likelihoods calculated for all 10 genotypes given the called reference base at each position.</p>
<h3>Referee is a program to calculate a quality score for every position in a genome assembly. This allows for easy filtering of low quality sites for any downstream analysis.</h3>
<p>https://github.com/gwct/referee</p><p>Address of the bookmark: <a href="https://gwct.github.io/referee/#" rel="nofollow">https://gwct.github.io/referee/#</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</guid>
	<pubDate>Mon, 06 Oct 2014 12:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</link>
	<title><![CDATA[Software developed in pevsner lab]]></title>
	<description><![CDATA[<div>
<div id="block-system-main">
<div>
<div id="node-7">
<div>
<div>
<div>
<div>
<p><a href="http://pevsnerlab.kennedykrieger.org/dragon.htm">DRAGON</a>: Database Referencing of Array Genes Online</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/96">SNOMAD</a>: Standardization and Normalization of Microarray Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/70">SNPduo</a>: SNP Analysis Between Two Individuals</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/71">SNPtrio</a>: Analyzing and Visualizing and Inheritance Patterns in Trios</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">SNPscan</a>: Data Analysis and Visualization of SNP Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">pediSNP</a>: Analyze SNP Data From a Pedigree of Two Generations</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/73">kcoeff</a>: Calculate Cotterman Coefficients of SNP Genotype Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/113">triPOD:</a> Detects chromosomal abnormalities in parent-child trio-based microarray data</p>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div><p>Address of the bookmark: <a href="http://pevsnerlab.kennedykrieger.org/php/?q=software" rel="nofollow">http://pevsnerlab.kennedykrieger.org/php/?q=software</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</guid>
	<pubDate>Fri, 26 Jul 2019 00:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</link>
	<title><![CDATA[jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator]]></title>
	<description><![CDATA[<p><code>jackalope</code> simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants can be simulated using summary statistics, phylogenies, Variant Call Format (VCF) files, and coalescent simulations&mdash;the latter of which can include selection, recombination, and demographic fluctuations. <code>jackalope</code> can simulate single, paired-end, or mate-pair Illumina reads, as well as reads from Pacific Biosciences These simulations include sequencing errors, mapping qualities, multiplexing, and optical/PCR duplicates. All outputs can be written to standard file formats.</p>
<p><span>A swift, versatile phylogenomic and high-throughput sequencing simulator </span> <span><a href="https://jackalope.lucasnell.com">https://jackalope.lucasnell.com</a></span></p><p>Address of the bookmark: <a href="https://github.com/lucasnell/jackalope" rel="nofollow">https://github.com/lucasnell/jackalope</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</guid>
	<pubDate>Fri, 17 Oct 2014 02:16:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</link>
	<title><![CDATA[Big genomic data on Google Cloud Platform]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/ExNxi_X4qug" frameborder="0" allowfullscreen></iframe>As the cost of DNA sequencing has dropped, the volume of data produced has risen into the petabytes. Google is working with the genomics community to define a standard API for working with big genomic data sets in the cloud. Building on Google Cloud Platform, we show how to store, process, explore and share genomic data using technologies like BigQuery, AppEngine MapReduce, R and more.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/120/user</guid>
	<pubDate>Wed, 10 Jul 2013 14:41:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/120/user</link>
	<title><![CDATA[useR!]]></title>
	<description><![CDATA[<p><span>The R project actively supports two conference series, organized regularly by members from the R community: useR! - providing a forum to the R user community - and DSC - a platform for developers of statistical software.</span></p><p><span>Recently useR! conference have been organized&nbsp;<span>University of Castilla-La Mancha, Albacete, Spain.</span></span></p><p><a href="http://www.edii.uclm.es/~useR-2013//">http://www.edii.uclm.es/~useR-2013//</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>