However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge. The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.

PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.

This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.

The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.

Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.

Reference: Solun, G. K., Dogrusoz, U., Bingöl, Z., & Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.

Interested candidates may email their resume along with a cover letter to careers@arraygen.com

Official website: http://www.arraygen.com/

Scientists face a big challenge with the human genome. They can read its letters, but understanding their roles is much harder. Only about 2 percent of the genome codes for proteins. The rest acts like a huge control panel, deciding when and where genes turn on. With about 9 billion possible single-letter changes, testing them all in a lab just isn’t possible.

So, Google DeepMind asked a new question: what if we could predict what those changes might do?

This question led to the AlphaGenome Atlas (https://deepmind.google.com/science/alphagenome/atlas?), a detailed map of nearly every possible single-letter change in the human genome. Instead of checking each change one by one, researchers can use the Atlas to spot the ones most likely to matter. The AlphaGenome Variant Impact (AVI) score works like a trail marker, pointing scientists toward the changes worth a closer look.

This is where the Atlas gets especially useful. Much of the genome lies outside the protein-coding regions, where DNA acts as a switch or controller for genes. AlphaGenome lets researchers explore these areas and see how small changes could affect gene activity.

An atlas isn't the destination; it's a guide.

The AlphaGenome Atlas doesn’t replace experiments or solve every mystery. Instead, it helps scientists decide where to begin. From billions of possibilities, it turns the vast genetic landscape into something researchers can start to explore.

There are nine billion possibilities, a vast map, and maybe among them therWith nine billion possibilities and a huge map to explore, there may be clues hidden here to some of medicine’s toughest mysteries.

More at https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-atlas-a-predictive-map-of-every-possible-dna-letter-change-in-the-human-genome/alphagenome-atlas.pdf

New Delhi-110012

Walk in interview

Eligible candidates may appear for Walk-in interview for the temporary positions of JRF/SRF/ RA, in ICAR, DBT funded research projects. Positions are purely temporary in nature and are co-terminus with the projects. The initial appointment will be for maximum one year, which can be extended on the basis of assessment of the candidate performance and need in the project work (PI-Dr. N. K. Singh, National Professor).

Name of the

PI (Project)

Name of

Position

Number of

positions

Emoluments

Fixed per

month (Rs.)

Essential

Qualifications

DBT-“Physical Mapping and Sample sequencing of Wheat Chromosome 2A- International Wheat Genome Sequencing Consortium (India)”.

(Up to Nov,2014)

DBT- Identification and functional analysis of genes related to yield and biotic stresses (Up to Oct,2014)

NPTC-Central Facility

RA (Master)

JRF/SRF

Research Associate: One

Essential: MCA or M. Tech. (Bioinformatics and computer Science with 2 years experience in Database Management with

MySQL, Linux)

Desirable: Proficiency in handling of large biological databases

Age limit: Max. Age 35 years (Age of relaxation of 5 years for SC/ST& woman. and 3 years for OBC). The interview will be held on 08 July, 2014 at 11 am at room no. 39, NRCPB, LBS Building, Pusa Campus, New Delhi-110012. The candidates must bring original certificates and four copies of biodata, and recent passport size photograph. No TA/DA would be given for the appearance in interview. Only the candidates having essential qualifications would be entertained for the interviews.

Advertisement:

www.nrcpb.org/sites/default/files/news%20paper%20advirtisment..docx

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

Faculty of Science

Essential Qualifications:

(i) Good academic record having at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s Degree level in a relevant subject, from an Indian University, or an equivalent degree from an accredited foreign University.

(II) Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET.

(III) Notwithstanding anything contained in sub-clauses (i) and (ii) of clause 4.4.1 of UGC regulations 2010, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/ SLET/ SET for engagement of guest Teacher.

(IV) NET/ SLET/ SET shall also not be required for such Master’s Degree Programmes in discipline for which NET/ SLET/ SET is not conducted.

Application form along with detailed instructions can be downloaded from Tripura University website: www.tripurauniv.in. The duly filled in application forms complete in all respects may be sent so as to reach the Office of the Deputy Registrar Academic Branch, Tripura University, Suryamaninagar - 799022, Tripura on or before 31st July, 2014. The Candidates who responded against advertisement No. TU.REG/N-Advt./02/10 dated 20.02.2014 need not apply again.

For more info visit: http://www.tripurauniv.in/images/universitymedia/EmploymentNotification/Guest%20Teacher%20Advt.%20website_09072014.pdf

• Whole-genome sequencing
• Whole-exome sequencing
• RNA-seq (speical mode available)
• ChIP-seq

Address of the bookmark: http://qualimap.bioinfo.cipf.es/

Notice: As of jtools version 2.0.0, all functions dealing with interactions (e.g., interact_plot(), sim_slopes(), johnson_neyman()) have been moved to a new package, aptly named interactions.

Address of the bookmark: https://cran.r-project.org/web/packages/jtools/readme/README.html

No.of Posts:01 (SC)

Pay Scale:

Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.

Qualifications:

Area of Specialization:-

Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology

1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.

2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/

Immunology/Structural Biology etc

Experience:

1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical

Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.

2. Minimum two publication with atleast one in international journal and atleast one as first author

Desirable:-

Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)

Send your applications to O/O, Deputy Registrar, Recruitment & Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014

For more details,please visit website:http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf

https://wlcb.oit.uci.edu/modules/index.html

Address of the bookmark: https://wlcb.oit.uci.edu/NG-Circos