Demo Data from EDBT 2026 / reviewers in the wild / expert
Laura Luebbert
dblp:370/5801
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0003-1379-2927ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 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% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
protein sequence analysis |
0.8 | 1 | 2024 | Fast and scalable querying of eukaryotic linear motifs with gget elm · Bioinform. 2024 |
Bioinformatics and computational biology › sequence analysis › motif discovery
short linear motif discovery |
0.8 | 1 | 2024 | Fast and scalable querying of eukaryotic linear motifs with gget elm · Bioinform. 2024 |
Bioinformatics and computational biology › genomics
genomic data analysis |
0.7 | 1 | 2023 | Efficient querying of genomic reference databases with gget · Bioinform. 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Fast and scalable querying of eukaryotic linear motifs with gget elmabstractMOTIVATION: Eukaryotic linear motifs (ELMs), or Short Linear Motifs, are protein interaction modules that play an essential role in cellular processes and signaling networks and are often involved in diseases like cancer. The ELM database is a collection of manually curated motif knowledge from scientific papers. It has become a crucial resource for investigating motif biology and recognizing candidate ELMs in novel amino acid sequences. Users can search amino acid sequences or UniProt Accessions on the ELM resource web interface. However, as with many web services, there are limitations in the swift processing of large-scale queries through the ELM web interface or API calls, and, therefore, integration into protein function analysis pipelines is limited. RESULTS: To allow swift, large-scale motif analyses on protein sequences using ELMs curated in the ELM database, we have extended the gget suite of Python and command line tools with a new module, gget elm, which does not rely on the ELM server for efficiently finding candidate ELMs in user-submitted amino acid sequences and UniProt Accessions. gget elm increases accessibility to the information stored in the ELM database and allows scalable searches for motif-mediated interaction sites in the amino acid sequences. AVAILABILITY AND IMPLEMENTATION: The manual and source code are available at https://github.com/pachterlab/gget. Laura Luebbert, Chi Hoang, Manjeet Kumar, Lior Pachter |
Bioinform. | 1 |
| 2023 | Efficient querying of genomic reference databases with ggetabstractMOTIVATION: A recurring challenge in interpreting genomic data is the assessment of results in the context of existing reference databases. With the increasing number of command line and Python users, there is a need for tools implementing automated, easy programmatic access to curated reference information stored in a diverse collection of large, public genomic databases. RESULTS: gget is a free and open-source command line tool and Python package that enables efficient querying of genomic reference databases, such as Ensembl. gget consists of a collection of separate but interoperable modules, each designed to facilitate one type of database querying required for genomic data analysis in a single line of code. AVAILABILITY AND IMPLEMENTATION: The manual and source code are available at https://github.com/pachterlab/gget. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Laura Luebbert, Lior Pachter |
Bioinform. | 1 |