VLDB 2026 Research / reviewers in the wild / expert
Taushif Khan
dblp:211/6296
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-7917-8965ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Language models and text generation · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genomics › computational genomics
gene prioritization |
0.9 | 1 | 2025 | Automating candidate gene prioritization with large language models: from naive scoring to literature-grounded validation · Bioinform. 2025 |
Bioinformatics and computational biology › sequence analysis
profile hidden markov model |
0.3 | 1 | 2017 | SVM-dependent pairwise HMM: an application to protein pairwise alignments · Bioinform. 2017 |
Bioinformatics and computational biology › sequence alignment › pairwise sequence alignment
protein pairwise alignment |
0.3 | 1 | 2017 | SVM-dependent pairwise HMM: an application to protein pairwise alignments · Bioinform. 2017 |
Bioinformatics and computational biology
sequence analysis |
0.3 | 1 | 2017 | SVM-dependent pairwise HMM: an application to protein pairwise alignments · Bioinform. 2017 |
Natural language and speech › Language models and text generation
retrieval-augmented generation |
0.3 | 1 | 2025 | Automating candidate gene prioritization with large language models: from naive scoring to literature-grounded validation · Bioinform. 2025 |
Methods — techniques the papers use, named apart from their topics
retrieval-augmented generation · 1.7large language model · 1.7faithfulness evaluation · 1.7support vector machine · 0.3hidden markov model · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Automating candidate gene prioritization with large language models: from naive scoring to literature-grounded validationabstractMOTIVATION: Identifying promising therapeutic targets from thousands of genes in transcriptomic studies remains a major bottleneck in biomedical research. While large language models (LLMs) show potential for gene prioritization, they suffer from hallucination and lack systematic validation against expert knowledge. RESULTS: The framework identified 609 sepsis-relevant genes with >94% filtering efficiency, demonstrating strong enrichment for inflammatory pathways including TNF-α signaling, complement activation, and interferon responses. Literature validation yielded 30 ultra-high confidence therapeutic candidates, including both established sepsis genes (IL10, TREM1, S100A9, NLRP3) and novel targets warranting investigation. Benchmark validation against expert-curated databases achieved 71.2% recall, with systematic correlation between computational confidence and evidence quality. The final candidate set balanced discovery (11 novel genes) with validation (19 known genes), maintaining biological coherence throughout the filtering process. This framework demonstrates that rigorous methodology can transform unreliable LLM outputs into systematically validated biological insights. By combining computational efficiency with literature grounding, the approach provides a practical tool for prioritizing experimental validation efforts. The modular design enables adaptation to other diseases through knowledge base substitution, offering a systematic approach to literature-guided biomarker discovery. AVAILABILITY AND IMPLEMENTATION: We developed a two-stage computational framework that combines LLM-based screening with literature validation for systematic gene prioritization. Starting with 10 824 genes from the BloodGen3 repertoire, we applied multi-criteria evaluation for sepsis relevance, followed by retrieval-augmented generation using 6346 curated sepsis publications. A novel faithfulness evaluation system verified that LLM predictions aligned with retrieved literature evidence. Source code and implementation details are available at https://github.com/taushifkhan/llm-geneprioritization-framework, vector database at https://doi.org/10.5281/zenodo.15802241, and Interactive demonstration at https://llm-geneprioritization.streamlit.app/. Taushif Khan, Mohammed Toufiq, Marina Yurieva, Nitaya Indrawattana, Akanitt Jittmittraphap, Nathamon Kosoltanapiwat, Pornpan Pumirat, Passanesh Sukphopetch, Muthita Vanaporn, Karolina Palucka, Basirudeen Syed Ahamed Kabeer, Darawan Rinchai, Damien Chaussabel |
Bioinform. | 1 |
| 2018 | ProLego: tool for extracting and visualizing topological modules in protein structuresabstractBACKGROUND: In protein design, correct use of topology is among the initial and most critical feature. Meticulous selection of backbone topology aids in drastically reducing the structure search space. With ProLego, we present a server application to explore the component aspect of protein structures and provide an intuitive and efficient way to scan the protein topology space. RESULT: We have implemented in-house developed "topological representation" in an automated-pipeline to extract protein topology from given protein structure. Using the topology string, ProLego, compares topology against a non-redundant extensive topology database (ProLegoDB) as well as extracts constituent topological modules. The platform offers interactive topology visualization graphs. CONCLUSION: ProLego, provides an alternative but comprehensive way to scan and visualize protein topology along with an extensive database of protein topology. ProLego can be found at http://www.proteinlego.com. Taushif Khan, Shailesh Kumar Panday, Indira Ghosh |
BMC Bioinform. | 1 |
| 2017 | SVM-dependent pairwise HMM: an application to protein pairwise alignmentsabstractMOTIVATION: Methods able to provide reliable protein alignments are crucial for many bioinformatics applications. In the last years many different algorithms have been developed and various kinds of information, from sequence conservation to secondary structure, have been used to improve the alignment performances. This is especially relevant for proteins with highly divergent sequences. However, recent works suggest that different features may have different importance in diverse protein classes and it would be an advantage to have more customizable approaches, capable to deal with different alignment definitions. RESULTS: Here we present Rigapollo, a highly flexible pairwise alignment method based on a pairwise HMM-SVM that can use any type of information to build alignments. Rigapollo lets the user decide the optimal features to align their protein class of interest. It outperforms current state of the art methods on two well-known benchmark datasets when aligning highly divergent sequences. AVAILABILITY AND IMPLEMENTATION: A Python implementation of the algorithm is available at http://ibsquare.be/rigapollo. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Gabriele Orlando, Daniele Raimondi, Taushif Khan, Tom Lenaerts, Wim F. Vranken |
Bioinform. | 3 |