Cristian Iñiguez

Cristian Iñiguez

Auto-generated profile, based on publicly available information

Cristian Iñiguez

Barcelona Supercomputing Center , Barcelona, 08034

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
8 April 2025 in IEEE Journal of Indoor and Seamless Positioning and Navigation
Verified
Journal Article
Open access
Aleix Galan-FiguerasAleix Galan-Figueras
Aleix Galan-Figueras
CICristian Iñiguez
Cristian Iñiguez
IFIgnacio Fernandez-Hernandez
Ignacio Fernandez-Hernandez
SPSofie Pollin
Sofie Pollin
GSGonzalo Seco-Granados
Gonzalo Seco-Granados
Galileo will declare OSNMA (Open Service Navigation Message Authentication), a civil GNSS signal authentication scheme, operational in the near future. OSNMAlib, an open-source library that implements OSNMA, was presented two years ago after the test phase of the protocol started and has since undergone several upgrades. In this paper, we disclose these upgrades, which comprise new input sources, new features and optimizations, and the creation of an OSNMA real-time monitoring website. For each input source, we describe how can they be integrated within an OSNMA library and what pitfalls to avoid. The new features include optimizations for data retrieval such as the use of dual frequency and Reed Solomon encoding, which are evaluated in urban and open sky scenarios using real recorded data. The new JSON logging format aimed at researchers is used in osnmalib.eu website to display, in a friendly and understandable way, the live Galileo and OSNMA messages and the OSNMAlib authentication output. Additionally, the website also provides the I/NAV data bits to help snapshot receivers and other GNSS-based applications.

25 June 2024
Verified
Conference Paper
Closed access
Aleix Galan-FiguerasAleix Galan-Figueras
Aleix Galan-Figueras
CICristian Iñiguez
Cristian Iñiguez
IFIgnacio Fernandez-Hernandez
Ignacio Fernandez-Hernandez
SPSofie Pollin
Sofie Pollin
GSGonzalo Seco-Granados
Gonzalo Seco-Granados
Galileo will declare OSNMA (Open Service Navigation Message Authentication), a civil GNSS signal authentication scheme, operational in the near future. OSNMAlib, an open-source library that implements OSNMA, was presented two years ago after the test phase of the protocol started and has since undergone several upgrades. In this paper, we disclose these upgrades, which comprise new input sources, new features and optimizations, and the creation of an OSNMA real-time monitoring website. For each input source (SBF, UBX, GNSS-SDR and galmon), we describe how can they be integrated with an OSNMA library and what pitfalls to avoid. The new features include data retrieval and time to first authenticated fix optimizations and a new logging format aimed at researchers. This logging format is used in osnmalib.eu website to display, in a friendly and understandable way, the live Galileo and OSNMA messages and the OSNMAlib authentication output. Additionally, the website also provides the I/NAV data bits to help snapshot receivers and other GNSS-based applications.

13 April 2026 in Bioinformatics
Verified
Journal Article
Open access
LLLorién López-Villellas
Lorién López-Villellas
CICristian Iñiguez
Cristian Iñiguez
AJAlbert Jiménez-Blanco
Albert Jiménez-Blanco
QAQuim Aguado-Puig
Quim Aguado-Puig
MMMiquel Moretó
Miquel Moretó
SMSantiago Marco-Sola
Santiago Marco-Sola
Motivation: Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy. Results: We present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires storing a single DP matrix while preserving optimal alignment results. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e. 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. We demonstrate that Singletrack reduces memory consumption for both SK and WFA algorithms, lowering SK usage by 2× and 4× and WFA usage by 3× and 5× for gap-affine and dual gap-affine alignments, respectively. Moreover, replacing KSW2’s memory-reduction technique with Singletrack accelerates its SK implementation by up to 1.4× at the cost of doubling memory consumption, while Singletrack increases the performance of the WFA implementation in WFA2-lib by 1.2–2.1×. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2× higher performance. Availability and implementation: The Singletrack implementations presented in this work are available on Zenodo (DOI: 10.5281/zenodo.18770585) and GitHub (https://github.com/LorienLV/singletrack).

19 September 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
MDMax Doblas
Max Doblas
OLOscar Lostes-Cazorla
Oscar Lostes-Cazorla
QAQuim Aguado-Puig
Quim Aguado-Puig
CICristian Iñiguez
Cristian Iñiguez
MMMiquel Moreto
Miquel Moreto
SMSantiago Marco-Sola
Santiago Marco-Sola
Motivation: Pairwise sequence alignment is a core component of multiple sequencing-data analysis tools. Recent advancements in sequencing technologies have enabled the generation of longer sequences at a much lower price. Thus, long-read sequencing technologies have become increasingly popular in sequencing-based studies. However, classical sequence analysis algorithms face significant scalability challenges when aligning long sequences. As a result, several heuristic methods have been developed to improve performance at the expense of accuracy, as they often fail to produce the optimal alignment. Results: This paper introduces QuickEd, a sequence alignment algorithm based on a bound-and-align strategy. First, QuickEd effectively bounds the maximum alignment-score using efficient heuristic strategies. Then, QuickEd utilizes this bound to reduce the computations required to produce the optimal alignment. Using QuickEd’s bound-and-align strategy, we reduce O ( n 2 ) complexity of traditional dynamic programming algorithms to O ( nŝ ), where n is the sequence length and ŝ is an estimated upper bound of the alignment-score between the sequences. As a result, QuickEd is consistently faster than other state-of-the-art implementations, such as Edlib and BiWFA, achieving performance speedups of 1.6 − 7.3× and 2.1 − 2.5×, respectively, aligning long and noisy datasets. In addition, QuickEd maintains a stable memory footprint below 50 MB while aligning sequences up to 1 Mbp. Availability: QuickEd code and documentation are publicly available at https://github.com/maxdoblas/QuickEd . Contact: max.doblas@bsc.es

2 November 2025 in bioRxiv
Verified
Preprint
Open access
LLLorién López-Villellas
Lorién López-Villellas
CICristian Iñiguez
Cristian Iñiguez
AJAlbert Jiménez-Blanco
Albert Jiménez-Blanco
QAQuim Aguado-Puig
Quim Aguado-Puig
MMMiquel Moretó
Miquel Moretó
SMSantiago Marco-Sola
Santiago Marco-Sola
Motivation: Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice either speed or alignment accuracy. Results: We present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires only storing a single DP matrix. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e., 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. Our results demonstrate that Singletrack accelerates the SK implementation of KSW2, used within Minimap2, by up to 1.4×. Similarly, Singletrack enhances the performance of the WFA implementation in WFA2-lib by 1.2–2.1× while reducing memory usage by 3× for gap-affine and 5× for dual gap-affine. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2× higher performance. Availability: All the implementations of the Singletrack algorithm presented in this work are available at https://github.com/LorienLV/singletrack .