Offer
We offer a full-time contract for two years. The contract starts between October 2021
and December 2021. The position involves no or extremely light teaching load, if the
candidate is interested. Salaries are competitive at the European level. The recruited
person will benefit from the Belgian social insurance scheme (health care, etc.) without
additional expenses.

Profile
Applicants are expected to show outstanding commitment to research and must have
obtained a PhD by the start of the position. A strong expertise in genomics is required.
More specifically, solid competences in bioinformatics (e.g. scripting pipelines) and in
genome evolution are needed. Knowledge or interest regarding recombination,
metazoan evolution, phylogenomics and population genomics is an added-value.

Application
Applications should be submitted via email to karine.van.doninck@ulb.be. The
application package should contain the following documents:
- A curriculum vitae with the complete list of publications
- A cover letter mentioning why the candidate is interested in the position
- Minimum 2 recommendation letters
Interviews: Interviews will be conducted with the selected candidates. Selected
candidates could also be invited to give a seminar to MBE ULB.
For any additional information, please contact karine.van.doninck@ulb.be

Classificier of reads from metagenomic sequencing experiments.

•  Kawulok, J., Deorowicz, S., CoMeta: Classification of Metagenomes Using k-mers, PLOS ONE, 2015; 10(4):1–23,

CoMSA

Compressor of multiple sequence alignments of proteins.

•  Deorowicz, S., Walczyszyn, J., Debudaj-Grabysz, A., CoMSA: compression of protein multiple sequence alignment files, Bioinformatics, 2019; 35(2):22–234,

DSRC

Compressor of sequencing reads.

•  Roguski, L., Deorowicz, S., DSRC 2: Industry-oriented compression of FASTQ files, Bioinformatics, 2014; 30(15):2213–2215,
•  Deorowicz, S., Grabowski, Sz., Compression of DNA sequences in FASTQ format, Bioinformatics, 2011; 27(6):860–862,

FAMSA

Multiple sequence alignment designed for huge families of proteins (even containing hundreds of thousands of sequences).

•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., FAMSA: Fast and accurate multiple sequence alignment of huge protein families, Scientific Reports, 2016; 6(33964):

FaStore

Compressor of FASTQ files.

•  Roguski, L., Ochoa, I., Hernaez, M., Deorowicz, S., FaStore - a space-saving solution for raw sequencing data, Bioinformatics, 2018; 34(16):2748–2756,

FQSqueezer

Experimental high-end compressor of FASTQ files.

•  Deorowicz, S., FQSqueezer: k-mer-based compression of sequencing data, Scientific Reports, 2020; 10(578):

GDC

Compressor of collections of genome sequences.

•  Deorowicz, S., Danek, A., Niemiec, M., GDC 2: Compression of large collections of genomes, Scientific Reports, 2015; 5(11565):1–12,
•  Deorowicz, S., Grabowski, Sz., Robust relative compression of genomes with random access, Bioinformatics, 2011; 27(21):2979–2986,

GTC

Genotype databases compressor with support for fast queries.

•  Danek, A., Deorowicz, S., GTC: how to maintain huge genotype collections in a compressed form, Bioinformatics, 2018; 34(11):1834–1840,

GTShark

Genotypes compressor.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, Bioinformatics, 2019; 35(22):4791–4793,

KMC

Memory frugal k-mer counter.

•  Kokot, M., Długosz, M., Deorowicz, S., KMC 3: counting and manipulating k -mer statistics, Bioinformatics, 2017; 33(17):2759–2761,
•  Deorowicz, S., Kokot, M., Grabowski, Sz., Debudaj-Grabysz, A., KMC 2: Fast and resource-frugal k-mer counting, Bioinformatics, 2015; 31(10):1569–1576,
•  Deorowicz, S., Debudaj-Grabysz, A., Grabowski, Sz., Disk-based k-mer counting on a PC, BMC Bioinformatics, 2013; 14():Article no. 160,

Kmer-db

Tool for estimation of evolutionary distances in a collection of genomes.

•  Deorowicz, S., Gudys, A., Dlugosz, M., Kokot, M., Danek, A., Kmer-db: instant evolutionary distance estimation, Bioinformatics, 2019; 35(1):133–136,

MuGI

Index allowing queries for a collection of multiple genome sequences.

•  Danek, A., Deorowicz, S., Grabowski, Sz., Indexes of Large Genome Collections on a PC, PLOS ONE, 2014; 9(10):e109384,

ORCOM

Experimental compressor of sequencing reads.

•  Grabowski, Sz., Deorowicz, S., Roguski, L., Disk-based compression of data from genome sequencing, Bioinformatics, 2014; 31(9):1389–1395,

PgSA

Index allowing queries for a collection of sequencing reads.

•  Kowalski, T., Grabowski, Sz., Deorowicz, S., Indexing arbitrary-length k-mers in sequencing reads, PLOS ONE, 2015; 10(7):1–16,

QuickProbs

Multiple sequence alignment designed especially for GPU.

•  Gudys, A., Deorowicz, S., QuickProbs 2: towards rapid construction of high-quality alignments of large protein families, Scientific Reports, 2017; 7(41553):
•  Gudys, A., Deorowicz, S., QuickProbs – A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors, PLOS ONE, 2014; 9(2):e88901,

RECKONER

Read error corrector.

•  Maciej Długosz, M., Deorowicz, S., RECKONER: read error corrector based on KMC, Bioinformatics, 2017; 33(7):1086–1089,

TGC

Compressor of collections of genomes given in Variant Call Format (VCF) files.

•  Deorowicz, S., Danek, A., Grabowski, Sz., Genome compression: a novel approach for large collections, Bioinformatics, 2013; 29(20):2572–2578,

VCFShark

Compressor of VCF files.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, biorxiv.org, 2020; ():

Whisper

Experimental mapper of whole genome sequencing data.

•  Deorowicz, S., Gudys, A., Whisper 2: indel-sensitive short read mapping, bioRxiv.org, 2019; :
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Whisper: read sorting allows robust robust mapping of DNA sequencing data, Bioinformatics, 2019; 35(12):2043–2050,
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Robust mapping of whole genome sequencing data, Poster at The Biology of Genomes Conference, 2017;

Address of the bookmark: https://genomes.atcc.org/

Address of the bookmark: https://proksee.ca/

What Are lncRNAs?

lncRNAs are RNA transcripts longer than 200 nucleotides that do not code for proteins. Despite their non-coding nature, they play diverse roles in gene regulation, including chromatin remodeling, transcriptional control, and post-transcriptional processing. Unlike messenger RNAs (mRNAs), lncRNAs often function as scaffolds, decoys, or guides in cellular machinery, influencing biological processes such as cell differentiation, immune response, and even cancer metastasis.

Challenges in lncRNA Research

Identifying and understanding lncRNAs pose unique challenges:

1. High Sequence Variability: Unlike protein-coding genes, lncRNAs exhibit low sequence conservation across species, making functional predictions difficult.
2. Low Expression Levels: lncRNAs are often expressed at low levels, complicating their detection in transcriptomic data.
3. Diverse Functions: The multifunctional nature of lncRNAs requires advanced computational tools to decipher their roles in complex networks.

Bioinformatics: A Crucial Ally in lncRNA Research

Bioinformatics bridges the gap between raw biological data and meaningful insights, making it indispensable in lncRNA research. Here’s how:

1. Identification and Annotation

High-throughput sequencing technologies like RNA-seq generate vast amounts of data. Bioinformatics tools such as StringTie, Cufflinks, and HISAT2 help assemble and annotate lncRNAs from this data. Additionally, databases like NONCODE, LNCipedia, and Ensembl provide curated repositories of lncRNA sequences and annotations.

2. Functional Prediction

Bioinformatics algorithms predict the potential functions of lncRNAs by analyzing their interactions with DNA, RNA, and proteins. Tools like LncRNA2Function and RIblast utilize sequence motifs and secondary structure predictions to hypothesize about the roles of specific lncRNAs.

3. Network Construction

lncRNAs often act as regulatory hubs. Bioinformatics platforms such as Cytoscape enable the visualization of lncRNA-mediated networks, elucidating their roles in pathways like cell cycle regulation and apoptosis.

4. Epigenetic Studies

lncRNAs are known to interact with chromatin-modifying complexes, influencing gene expression epigenetically. Tools like ChIP-seq and ATAC-seq, combined with computational pipelines, identify these interactions and map them to the genome.

5. Clinical Applications

Bioinformatics aids in the discovery of lncRNA biomarkers for diseases like cancer and neurodegenerative disorders. Machine learning models analyze differential expression profiles, helping prioritize lncRNAs with therapeutic potential.

Case Study: lncRNAs in Cancer Research

lncRNAs such as HOTAIR and MALAT1 have been implicated in cancer progression. Bioinformatics analyses have revealed their roles in promoting metastasis and altering the tumor microenvironment. For example, transcriptome analysis in cancer patients identifies lncRNA expression signatures, enabling precision medicine approaches.

Future Directions

The fusion of bioinformatics with experimental biology is unlocking the secrets of lncRNAs. Advances in artificial intelligence, single-cell sequencing, and structural modeling promise to overcome current limitations. Here are some promising directions:

• Integrative Analysis: Combining multi-omics data to understand the interplay of lncRNAs with other biomolecules.
• CRISPR Screens: Leveraging bioinformatics to design CRISPR-based functional screens for lncRNAs.
• Therapeutic Development: Using bioinformatics to design lncRNA-based therapeutics, including antisense oligonucleotides and RNA interference tools.

Conclusion

lncRNAs are the hidden gems of the genome, and bioinformatics is the key to unearthing their full potential. As research progresses, lncRNAs could pave the way for novel diagnostics, targeted therapies, and personalized medicine, revolutionizing our approach to complex diseases.

The journey into the world of lncRNAs is only beginning, and bioinformatics will continue to play a pivotal role in decoding these molecular mysteries. Whether you’re a researcher, clinician, or bioinformatics enthusiast, the study of lncRNAs offers a fascinating frontier of discovery.

Overview of SLiM and msprime

SLiM: Forward Genetic Simulator

SLiM is a free, open-source tool designed for forward genetic simulations. It allows researchers to model complex evolutionary scenarios, including selection, recombination, and demographic events, making it particularly useful for studying adaptation and selection in populations.

Key Features of SLiM:

• Simulates population evolution forward in time

• Supports custom evolutionary models using an embedded scripting language

• Allows modeling of spatial and ecological dynamics

• Provides high flexibility and extensibility for user-defined scenarios

• Available on GitHub as an open-source project

msprime: Ancestry and Mutation Simulator

msprime is an efficient, open-source tool that simulates ancestry and mutations using a coalescent framework. It is known for its high-speed performance and low memory requirements, making it a popular choice for large-scale genomic simulations.

Key Features of msprime:

• Implements coalescent simulations for ancestry modeling

• Efficiently simulates large population histories

• Supports the addition of mutations to genealogies

• Developed using an open-source community model

• Often faster and more memory-efficient than alternative simulators

Using SLiM and msprime with slendr

Both SLiM and msprime can be integrated with slendr, a framework that facilitates structured population genetic simulations. This integration allows for seamless comparison of simulation outputs.

How They Work Together:

• SLiM and msprime simulations can be analyzed within slendr.

• The ts_read() function in slendr enables loading and comparing tree sequence outputs from both simulators.

• This integration allows researchers to validate simulation results and gain deeper insights into evolutionary processes.

Performance Considerations

While SLiM offers powerful forward simulations with extensive customization, msprime is often preferred for its speed and memory efficiency when simulating ancestry and mutations. The choice between the two depends on the research goals:

• For detailed evolutionary modeling with selection and recombination: Use SLiM.

• For large-scale coalescent simulations with mutations: Use msprime.

• For comparing different simulation models and their outputs: Use slendr to integrate SLiM and msprime results.

Conclusion

SLiM and msprime are valuable tools for genome simulation, each serving distinct but complementary purposes in population genetics research. By leveraging the strengths of both simulators with slendr, researchers can conduct robust and efficient evolutionary simulations, enhancing our understanding of genetic diversity and adaptation.

For more information, check out the official GitHub repositories for SLiM and msprime, and explore the slendr framework for streamlined simulation workflow

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.

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

This is where KiNext comes into the picture. Introduced in a 2024 study published in BMC Bioinformatics, KiNext is a computational workflow designed to identify and classify protein kinases from predicted protein sequences. Instead of relying on a single search method, it brings together several approaches, including Hidden Markov Models, sequence alignment, phylogenetic analysis, and structural comparison.

The search begins with a simple question: does a protein contain the characteristics of a kinase? Protein kinases can change considerably during evolution, but important regions of their sequences often retain recognizable patterns. KiNext uses Hidden Markov Models, or HMMs, to detect these patterns. An HMM does not require a protein to be an exact match to a known kinase. Instead, it looks for a statistical sequence signature associated with kinase proteins, making it possible to detect more distant candidates.

Once potential kinases are identified, KiNext takes the analysis further. It distinguishes conventional eukaryotic protein kinases from atypical protein kinases and then attempts to classify them into different kinase groups and families. This distinction is important because simply identifying a protein as a kinase does not tell the complete story. Different kinase families can have very different evolutionary histories and biological functions.

The next stage brings evolution into the picture. KiNext can align kinase sequences and construct phylogenetic trees, allowing researchers to examine how newly identified proteins are related to previously characterized kinases. When sequence evidence alone is difficult to interpret, structural information can provide another clue. The workflow can incorporate AlphaFold-predicted structures and Foldseek-based structural comparisons to investigate whether an unusual protein resembles known kinase structures.

The researchers tested KiNext using two very different organisms: the Pacific oyster, Crassostrea gigas, and the green alga Ostreococcus tauri. In C. gigas, KiNext recovered previously reported kinases while identifying additional candidates. Structural analysis provided further evidence for many of the newly detected proteins. In O. tauri, the workflow similarly recovered most previously reported kinases and identified additional candidates while refining some of their classifications.

What makes KiNext particularly interesting is not just its ability to find kinases, but how the entire analysis is organized. The workflow uses Nextflow, allowing the different computational steps to be connected into a reproducible pipeline. Containers can also help manage software dependencies, making it easier to run the workflow across different computing environments.

This reproducibility becomes increasingly important as the number of available genomes continues to grow. A researcher studying one organism may be able to perform an analysis manually, but repeating the same process across hundreds or thousands of genomes quickly becomes impractical. A standardized workflow provides a way to perform the analysis consistently while keeping track of how the results were generated.

At its core, KiNext demonstrates a broader change taking place in modern genomics. Sequencing a genome provides an enormous amount of information, but the real scientific challenge begins afterward: understanding what all those sequences mean. Protein kinases are only one part of this larger puzzle, yet they are particularly important because they act as molecular switches throughout the cell.

By combining sequence profiles, evolutionary analysis, and structural evidence within a reproducible computational framework, KiNext provides researchers with a systematic way to uncover these molecular switches. Its real value lies not only in finding more kinases, but in making the process scalable, repeatable, and easier to apply to new genomes.

As genome sequencing continues to expand across the tree of life, tools such as KiNext can help turn enormous collections of protein sequences into meaningful biological stories—one kinase at a time.

Read more about it @

https://link.springer.com/article/10.1186/s12859-024-05953-w

This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.

Address of the bookmark: http://dagchainer.sourceforge.net/