Katerin Vanessa de la Hoz Luna

Katerin Vanessa de la Hoz Luna

Auto-generated profile, based on publicly available information

Katerin Vanessa de la Hoz Luna


Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 June 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
KLKaterin Vanessa de la Hoz Luna
Katerin Vanessa de la Hoz Luna
APAlexis Poindron
Alexis Poindron
LSLilian Salinas
Lilian Salinas
JAJulio Aracena
Julio Aracena
In Boolean models of gene regulatory networks, each regulator acts as an activator or a repressor, a structure captured by unate Boolean functions. Determining whether a unate Boolean function is compatible with a set of binary observations is NP-complete. We address this problem through a combinatorial formulation built on two concepts: the multiset of discrepancies, which encodes how positive and negative observations differ, and the coverage vector, which represents a way to resolve those differences. We prove that the existence of a coverage vector is necessary and sufficient for the existence of a compatible unate function, and we characterize the full set of compatible functions as an interval between two explicit bounds. Building on these results, we develop a greedy randomized algorithm that constructs coverage vectors and scales to instances with several thousand variables. Experiments on synthetic data show that recovery of the true signed support depends primarily on the ratio between active and total variables, and that an optional sparsity bound improves both recall and precision. A case study on the Drosophila ventral furrow Boolean network confirms the applicability of the method to gene regulatory networks under sparse biological observations.

18 June 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
KLKaterin Vanessa de la Hoz Luna
Katerin Vanessa de la Hoz Luna
APAlexis Poindron
Alexis Poindron
LSLilian Salinas
Lilian Salinas
JAJulio Aracena
Julio Aracena
In Boolean models of gene regulatory networks, each regulator acts as an activator or a repressor, a structure captured by unate Boolean functions. Determining whether a unate Boolean function is compatible with a set of binary observations is NP-complete. We address this problem through a combinatorial formulation built on two concepts: the multiset of discrepancies, which encodes how positive and negative observations differ, and the coverage vector, which represents a way to resolve those differences. We prove that the existence of a coverage vector is necessary and sufficient for the existence of a compatible unate function, and we characterize the full set of compatible functions as an interval between two explicit bounds. Building on these results, we develop a greedy randomized algorithm that constructs coverage vectors and scales to instances with several thousand variables. Experiments on synthetic data show that recovery of the true signed support depends primarily on the ratio between active and total variables, and that an optional sparsity bound improves both recall and precision. A case study on the Drosophila ventral furrow Boolean network confirms the applicability of the method to gene regulatory networks under sparse biological observations.