A quick, $1 syphilis test in development by researchers from UNU-BIOLAC."

Source:

http://www.sciencedaily.com/releases/2013/09/130902101846.htm

http://www.eurekalert.org/pub_releases/2013-09/tca-ssg082613.php

Related Paper:

http://genomebiology.com/2014/15/3/R59/abstract

Address of the bookmark: http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859

Tool link:

http://www.cs.cmu.edu/~ckingsf/software/sailfish/

Address of the bookmark: http://www.genengnews.com/gen-news-highlights/lightweight-algorithms-sail-through-rna-sequencing-data/81249765/

Source: http://www.eurekalert.org/pub_releases/2014-05/esoh-pco052914.php

GraphMap was also designed for ease-of-use: the default parameters can handle a wide range of read lengths and error profiles, including: Illumina, PacBio and Oxford Nanopore.
This is an especially important feature for technologies where the error rates and error profiles can vary widely across, or even within, sequencing runs.

http://biorxiv.org/content/early/2015/06/10/020719

Address of the bookmark: https://github.com/isovic/graphmap

Address of the bookmark: https://github.com/AlexeyG/GRASS

Input

Jabba takes as input a concatenated de Bruijn graph and a set of sequences:

the de Bruijn graph should appear in fasta format with 1 entry per node, the meta information should be in the format:
>NODE
the set of sequences should be in fasta or fastq format. These sequences will be corrected (e.g. PacBio reads). The corrections will be written to a file Jabba fasta.
The output is a file in fasta format with corrections of the long reads, and additionally a file in the input format containing uncorrected reads.

https://github.com/biointec/jabba/wiki

https://almob.biomedcentral.com/articles/10.1186/s13015-016-0075-7

Address of the bookmark: https://github.com/biointec/jabba

https://www.researchgate.net/job/939073_Senior_Scientist_Bioinformatics-Multi_Omics_Integration

Senior_Scientist_Bioinformatics-Transcriptomics_Analysis

https://www.researchgate.net/job/939075_Senior_Scientist_Bioinformatics-Transcriptomics_Analysis-Belgium_France_Switzerland_The_Netherlands

Senior Scientist Bioinformatics - Network Analytics

https://www.researchgate.net/job/939070_Senior_Scientist_Bioinformatics-Network_Analytics_Belgium_France_Switzerland_the_Netherlands

Team Leader Bioinformatics Data Sciences - Mechelen, Belgium

https://www.researchgate.net/job/938787_Team_Leader_Bioinformatics_Data_Sciences-Mechelen_Belgium

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.

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.

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.

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.

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.

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.

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.

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.

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.

Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.

Read more at https://link.springer.com/article/10.1186/s13059-026-04280-y

Dan Kortschak, Bioinformatics Group, School of Molecular and Biomedical Science ,The University of Adelaide

Address of the bookmark: http://talks.biogo.googlecode.com/git/illumination/illumination.pdf