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

Natalia Rodríguez

dblp:192/2214 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-9618-9383ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.312018
SiNoPsis: Single Nucleotide Polymorphisms selection and promoter profiling · Bioinform. 2018
Bioinformatics and computational biology › statistical genetics › single nucleotide polymorphism analysis
SNP selection
0.312018
SiNoPsis: Single Nucleotide Polymorphisms selection and promoter profiling · Bioinform. 2018
Bioinformatics and computational biology › population genetics
linkage disequilibrium
0.112018
SiNoPsis: Single Nucleotide Polymorphisms selection and promoter profiling · Bioinform. 2018

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

visualization · 0.3
YearPublicationVenuePosition
2018 Computing Optimal Shortcuts for Networks
Delia Garijo, Alberto Márquez 0001, Natalia Rodríguez, Rodrigo I. Silveira
ISAAC3
2018 SiNoPsis: Single Nucleotide Polymorphisms selection and promoter profiling
abstract
MOTIVATION: The selection of a single nucleotide polymorphism (SNP) using bibliographic methods can be a very time-consuming task. Moreover, a SNP selected in this way may not be easily visualized in its genomic context by a standard user hoping to correlate it with other valuable information. Here we propose a web form built on top of Circos that can assist SNP-centered screening, based on their location in the genome and the regulatory modules they can disrupt. Its use may allow researchers to prioritize SNPs in genotyping and disease studies. RESULTS: SiNoPsis is bundled as a web portal. It focuses on the different structures involved in the genomic expression of a gene, especially those found in the core promoter upstream region. These structures include transcription factor binding sites (for promoter and enhancer signals), histones and promoter flanking regions. Additionally, the tool provides eQTL and linkage disequilibrium (LD) properties for a given SNP query, yielding further clues about other indirectly associated SNPs. Possible disruptions of the aforementioned structures affecting gene transcription are reported using multiple resource databases. SiNoPsis has a simple user-friendly interface, which allows single queries by gene symbol, genomic coordinates, Ensembl gene identifiers, RefSeq transcript identifiers and SNPs. It is the only portal providing useful SNP selection based on regulatory modules and LD with functional variants in both textual and graphic modes (by properly defining the arguments and parameters needed to run Circos). AVAILABILITY AND IMPLEMENTATION: SiNoPsis is freely available at https://compgen.bio.ub.edu/SiNoPsis/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Daniel Boloc, Natalia Rodríguez, Patricia Gassó, Josep F. Abril, Miquel Bernardo, Amalia Lafuente, Sergi Mas
Bioinform.2
2018 Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
abstract
We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard "fairness" assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special "structural" properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.
Nicolás D'Ippolito, Natalia Rodríguez, Sebastian Sardiña
J. Artif. Intell. Res.2
2016 Implementing data-dependent triangulations with higher order Delaunay triangulations
abstract
The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ignoring their elevation. It has long been recognized that sometimes it may be beneficial to use other, non-Delaunay, criteria to build TINs. Data-dependent triangulations were introduced decades ago to address this. However, they are rarely used in practice, mostly because the optimization of data- dependent criteria often results in triangulations with many thin and elongated triangles. Recently, in the field of computational geometry, higher order Delaunay triangulations (HODTs) were introduced, trying to tackle both issues at the same time-data-dependent criteria and good triangle shape. Nevertheless, most previous studies about them have been limited to theoretical aspects. In this work we present the first extensive experimental study on the practical use of HODTs, as a tool to build data-dependent TINs. We present experiments with two USGS terrains that show that HODTs can give significant improvements over the Delaunay triangulation for the criteria identified as most important for data-dependent triangulations. The resulting triangulations have data-dependent values comparable to those obtained with pure data-dependent approaches, without compromising the shape of the triangles, and are faster to compute.
Natalia Rodríguez, Rodrigo I. Silveira
SIGSPATIAL/GIS1