Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ismael Zamora

dblp:43/964 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-7700-0354ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
evaluation
0.912025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Information retrieval › ranking
learning to rank
0.912025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Information retrieval › evaluation › effectiveness metrics
precision at top ranks
0.912025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Information retrieval
ranking
0.912025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Information retrieval
retrieval models
0.912025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Bioinformatics and computational biology › proteomics
peptide analysis
0.412019
WebMetabase: cleavage sites analysis tool for natural and unnatural substrates from diverse data source · Bioinform. 2019
Bioinformatics and computational biology › proteomics › post-translational modification site prediction
protease cleavage site prediction
0.412019
WebMetabase: cleavage sites analysis tool for natural and unnatural substrates from diverse data source · Bioinform. 2019
Bioinformatics and computational biology
proteomics
0.412019
WebMetabase: cleavage sites analysis tool for natural and unnatural substrates from diverse data source · Bioinform. 2019
Information retrieval › ranking › learning to rank
NDCG optimization
0.312025
The LambdaGap Framework for Precision-Oriented Ranking · ACM Trans. Inf. Syst. 2025
Bioinformatics and computational biology › drug discovery
drug design
0.112019
WebMetabase: cleavage sites analysis tool for natural and unnatural substrates from diverse data source · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

lambdarank · 0.9lambdagap · 0.9similarity scoring · 0.4frequency analysis · 0.4
YearPublicationVenuePosition
2025 The LambdaGap Framework for Precision-Oriented Ranking
abstract
LambdaRank has proven effective for optimizing information retrieval metrics such as Normalized Discounted Cumulative Gain (NDCG). However, its application to Precision at document k (P@k) poses significant challenges because of the metric’s unique definition, which heavily restricts the number of effective training document pairs. This limitation diminishes the learning signal for relevant documents beyond the top k, potentially resulting in suboptimal performance. To overcome this, we propose LambdaGap, a ranking algorithm inspired by LambdaRank specifically tailored for optimizing P@k. LambdaGap replaces the pairwise weighting scheme in LambdaRank by one where pairs of documents within k positions in the ranking are masked out. We establish a theoretical link between LambdaGap and P@k by identifying the implicit metric optimized by the model. Furthermore, we introduce a new metric, Average Relevance Position beyond document k, which can be used in conjunction with LambdaRank to indirectly optimize for P@k. Our extensive experiments on publicly available datasets demonstrate the effectiveness of the proposed methods, yielding statistically significant improvements in P@k performance and highlighting their potential for more efficient training.
Ramon Adàlia, Gemma Sanjuan, Tomàs Margalef, Ismael Zamora
ACM Trans. Inf. Syst.4
2019 WebMetabase: cleavage sites analysis tool for natural and unnatural substrates from diverse data source
abstract
SUMMARY: More than 150 peptide therapeutics are globally in clinical development. Many enzymatic barriers should be crossed by a successful drug to be prosperous in such a process. Therefore, the new peptide drugs must be designed preventing the potential protease cleavage to make the compound less susceptible to protease reaction. We present a new data analysis tool developed in WebMetabase, an approach that stores the information from liquid chromatography mass spectrometry-based experimental data or from external sources such as the MEROPS database. The tool is a chemically aware system where each peptide substrate is presented as a sequence of structural blocks (SBs) connected by amide bonds and not being limited to the natural amino acids. Each SB is characterized by its pharmacophoric and physicochemical properties including a similarity score that describes likelihood between a SB and each one of the other SBs in the database. This methodology can be used to perform a frequency analysis to discover the most frequent cleavage sites for similar amide bonds, defined based on the similarity of the SB that participate in such a bond within the experimentally derived and/or public database. AVAILABILITY AND IMPLEMENTATION: http://webmetabase.com:8182/WebMetabaseBioinformatics/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Tatiana Radchenko, Fabien Fontaine, Luca Morettoni, Ismael Zamora
Bioinform.4