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

Erika Gardini

dblp:278/5576 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0001-8980-327XORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Bioinformatics and computational biology · 56% Computational science and engineering · 44%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.412020
Spathial: an R package for the evolutionary analysis of biological data · Bioinform. 2020
Computational science and engineering
high-dimensional data analysis
0.412020
Spathial: an R package for the evolutionary analysis of biological data · Bioinform. 2020

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

principal path algorithm · 0.4manifold navigation · 0.4
YearPublicationVenuePosition
2021 An Ab Initio Local Principal Path Algorithm
abstract
We introduce an improved version of the principal path method, an algorithm conceived to find smooth paths between objects in space. Some key steps of the algorithm have been changed, making the solution intrinsically local and preventing it from being attracted by a global manifold. Judiciously performing the initialization step with the Dijkstra algorithm and a proper metric, the functional now only performs a final refinement of the initial solution. Hence the algorithm is stabler as the space of possible solutions has been considerably reduced with respect to the original method. We tested the proposed algorithm in 2D toy data sets (to understand the behaviour) and in high-dimensional data sets. Compared to the previous version of the algorithm, we obtained significantly stabler and more realistic generated samples.
Erika Gardini, Andrea Cavalli, Sergio Decherchi
IJCNN1
2020 Spathial: an R package for the evolutionary analysis of biological data
abstract
SUMMARY: A primary problem in high-throughput genomics experiments is finding the most important genes involved in biological processes (e.g. tumor progression). In this applications note, we introduce spathial, an R package for navigating high-dimensional data spaces. spathial implements the Principal Path algorithm, which is a topological method for locally navigating on the data manifold. The package, together with the core algorithm, provides several high-level functions for interpreting the results. One of the analyses we propose is the extraction of the genes that are mainly involved in the progress from one state to another. We show a possible application in the context of tumor progression using RNA-Seq and single-cell datasets, and we compare our results with two commonly used algorithms, edgeR and monocle3, respectively. AVAILABILITY AND IMPLEMENTATION: The R package spathial is available on the Comprehensive R Archive Network (https://cran.r-project.org/web/packages/spathial/index.html) and on GitHub (https://github.com/erikagardini/spathial). It is distributed under the GNU General Public License (version 3). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Erika Gardini, Federico Manuel Giorgi, Sergio Decherchi, Andrea Cavalli
Bioinform.1