About Me
Hi, I’m Alejandro, a PhD in Computer Science. My research focuses on analysing and designing algorithms for graphs, with a recent interest in approximation algorithms and parameterised complexity. I also study string constraint algorithms and algorithms that reconstruct evolutionary histories.
- Passionate about:
- algorithms
- cultures
- languages
-
Look at my interactive CV in Tableau; hover over the icons, charts and text for additional information.
-
TLDR; My short CV
- You can also take a look at my skills tree.
Education
CICESE Research Center
PhD & MSc Computer Science
2015 - 2018 & 2012 - 2014
https://www.cicese.edu.mx/
At CICESE, I acquired essential skills that have contributed significantly to my professional development, including time management, communication, and teamwork. My experience as a PhD student at CICESE was immensely gratifying and played a pivotal role in shaping my career.
- Supervisor: Dr. José Alberto Fernández-Zepeda.
While at the Autonomous University of Zacatecas, I gained proficiency in various programming languages, ranging from low-level machine language to high-level languages such as Java. Also, during my time at the University, I cultivated a keen interest in the analysis and design of algorithms.
At the University of Manitoba, I enriched my technical skills while acquiring valuable soft skills. I had the opportunity to immerse myself in diverse social settings, gaining insights into professional ethics and work culture. This experience helped me explore different career paths, making it a crucial milestone in my professional development journey.
The University of Belize allowed me to experience, for the first time, an international and multicultural environment with a rich cultural exchange. This exposure broadened my understanding of the world and equipped me with skills to navigate and overcome language and communication barriers.
Academic employment
This research involves developing and applying graph algorithms to accurately reconstruct the evolutionary histories of gene families, enabling a deeper understanding of their origins, diversification, and the genetic relationships among different species.
- Line of research: Algorithms for reconstructing evolutionary histories of gene families.
- Supported by: The Center for Research and Advanced Studies of the National Polytechnic Institute (Cinvestav).
Royal Holloway, University of London
Postdoctoral Research Assistant
2020 - 2023
https://www.royalholloway.ac.uk/
The focus of this project was on the handling of strings in software systems. Existing research relying on regular expressions to study strings often overlooks important features in modern programming languages. This project bridges such a gap by enhancing theoretical understanding and practical implementation.
- Line manager: Prof. Matthew Hague.
- Project: String Constraint Solving with Real-World Regular Expressions.
- Supported by: The Engineering and Physical Sciences Research Council, EPSRC [EP/T00021X/1].
Artificial Intelligence Consortium
Research Associate
2019 - 2019
The primary objective of the CONACYT Public Centers’ Artificial Intelligence Consortium is to foster the development of highly skilled professionals in the field of Artificial Intelligence through applied research. The Consortium emphasises key areas such as urban mobility, healthcare, environmental risks, and mathematics for advancing Artificial Intelligence.
- Project: Algorithms for Artificial Intelligence
- Supported by: The Artificial Intelligence Consortium of CONACYT Public Centers, Mexico
CICESE Research Center
PhD in Computer Science
2015 - 2018
This project addresses the problem of finding a $2$-packing set in some planar graphs in polynomial time, in both centralized and distributed environments. The main result is a parameterized algorithm that computes a maximum $2$-packing set on a 1-outerplanar graph in linear time.
- Project: Feasibility study to solve the maximum $2$-packing set problem in polynomial time in outerplanar graphs (translated from Spanish)
- Supported by: CONACYT, National Scholarship for doctoral studies, Mexico
CICESE Research Center
MSc in Computer Science
2012 - 2014
This work presents an approach to find a maximum $2$-packing set in a cactus graph. The main result is an algorithm that decomposes the input graph into biconnected components to form a tree, then it solves each component individually and merges partial solutions to find such a set.
- Project: An algorithm to find a maximum $2$-packing set in a cactus graph (translated from Spanish)
- Supported by: CONACYT, National Scholarship for master’s studies, Mexico
Competitions
SMT-COMP
2023
Taolue Chen, Riccardo De Masellis, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Anthony W. Lin, Oliver Markgraf, Philipp Rümmer and Zhilin Wu. “The OSTRICH String Solver”. 2023. Available at: The 18th International Satisfiability Modulo Theories Competition.
Publications in journals and proceedings
Proceedings
Ignacio Garcia Labari, Alejandro Flores Lamas, Flavio E. Spetale, Pilar Bulacio and Elizabeth Tapia. “Transformer-Based Refinement of Pseudoknot Predictions in RNA Secondary Structures”. 2024. Available at: IEEE Biennial Congress of Argentina (ARGENCON).
Proceedings
Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales and Manuel Lafond. “The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees”. 2024. Available at: 24th International Workshop on Algorithms in Bioinformatics (WABI 2024). Also available at: arXiv.
Journal
Joel Antonio Trejo-Sánchez, Francisco A. Madera-Ramírez, José Alberto Fernández-Zepeda, José Luis López-Martínez and Alejandro Flores-Lamas . “A fast approximation algorithm for the maximum $2$-packing set problem on planar graphs”. 2022. Available at: Optimization Letters
Proceedings
Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Shuanglong Kan, Anthony W. Lin, Philipp Rümmer and Zhilin Wu. “Solving string constraints with Regex-dependent functions through transducers with priorities and variables”. 2022. Available at: Proceedings of the ACM on Programming Languages Vol. 6, Issue. POPL
Journal
Alejandro Flores-Lamas, José Alberto Fernández-Zepeda and Joel Antonio Trejo-Sánchez. “A distributed algorithm for a maximal $2$-packing set on Halin graphs”. 2020. Available at: Journal of Parallel and Distributed Computing
Proceedings
Joel Antonio Trejo-Sánchez, Andrés Vela-Navarro, Alejandro Flores-Lamas, José Luis López-Martínez, Carlos Bermejo-Sabbagh and Nora Leticia Cuevas-Cuevas. “Fast random cactus generation”. 2018. Available at: International Conference on Supercomputing in Mexico, ISUM 2018
Journal
Alejandro Flores-Lamas, José Alberto Fernández-Zepeda and Joel Antonio Trejo-Sánchez. “Algorithm to find a maximum $2$-packing set in a cactus”. 2018. Available at: Theoretical Computer Science
Work in progress
Journal
Submitted, under review
José Alberto Fernández-Zepeda, Alejandro Flores-Lamas, Matthew Hague and Joel Antonio Trejo-Sánchez. “A dynamic programming algorithm for a maximum $s$-club set on trees. 2024. Submitted to: Discrete Applied Mathematics, transferred to: The European Journal of Operational Research (EJOR).
Journal
Submitted, under review
Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas, Maribel Hernández-Rosales and Manuel Lafond. “The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees”. 2024. Submitted to: Algorithms for Molecular Biology.
Journal
Submitted, under review
Garcia Labari Ignacio, Flores-Lamas Alejandro, Spetale Flavio, Bulacio Pilar and Tapia Elizabeth. “ClaraFold: Prediction of RNA secondary structures including pseudoknots using Transformers”. 2025. Submitted to: Scientific Reports - Springer Nature.
Journal
In preparation
José Alberto Fernández-Zepeda, Alejandro Flores-Lamas, Tadeo Alán Gutiérrez-Medina and Joel Antonio Trejo-Sánchez. “A simple algorithm for decomposing geometric Halin graphs”. 2025. In preparation, to be submitted to: Journal of Parallel and Distributed Computing.
Posters
RECOMB-CG
2024
Ignacio Garcia Labari, Alejandro Flores Lamas, Flavio E. Spetale, Pilar Bulacio and Elizabeth Tapia. “Transformer-Based Refinement of Pseudoknot Predictions in RNA Secondary Structures”. 2024. Presented at: RECOMB-CG 2024.
X-meeting
2024
Ignacio Garcia Labari, Alejandro Flores Lamas, Flavio E. Spetale, Pilar Bulacio and Elizabeth Tapia. “Transformer-Based Refinement of Pseudoknot Predictions in RNA Secondary Structures”. 2024. Presented at: 20º Congresso Brasileiro de Bioinformática: X-Meeting 2024.
Service
I am/was on the Program Committee of the following workshops. Please consider a submission!
- 2025 - 51ª Conferencia Latinoamericana de Informática (CLEI 2025), Latin American Informatics Conference
- 2024 - Thirteenth International Conference on Complex Networks & Their Applications
- Complex Networks 2024, Sub-reviewer.
- 2024 - 50ª Conferencia Latinoamericana de Informática (L CLEI 2024), Latin American Informatics Conference
- 2023 - Encuentro Nacional de Computación 2023 (ENC 2023)
Projects & Material
Co-developer of PARLE: This tool computes the path-label reconciliation (PLR) dissimilarity measure. see abstract.
A simple Skill tree diagram creator. Generated in Python 3.10 and visualised thanks to the Python module Pyvis.
A dynamic programming algorithm for a maximum $s$-club set on trees
https://alexfloreslamas.github.io/maximum-s-club-set-on-trees.io/club finding in networks is a fundamental problem graph problem. To overcome the limitations of strict clubs, a relaxed version called $s$-club is studied. The $s$-club allows for greater flexibility in modelling relationships such as social concepts. Finding the largest $s$-club in an arbitrary graph is computationally challenging. Here we propose a dynamic programming algorithm that efficiently solves such a problem on an $n$-vertex tree in $O(s \cdot n)$ time for $s \geq 2$, outperforming existing methods. This advancement paves the way for finding maximum $s$-clubs in less restrictive graphs. We use Python, Pandas, YAML and NetworkX for the project’s scripts. We also provide a small set of artificial and real trees (along with corresponding credits) for experimentation.
This project involves a brief report on regular expressions (regex) within the NPM package manager for JavaScript. To extract the data, we developed a Ruby script called ‘RegexFinder.rb’. The input can be either the NPM installation directory or a set of JavaScript files, and the output includes details about regex usage. The information is displayed on the screen and can be saved as markdown or PDF files.
I was also briefly involved in creating CICESE’s $\LaTeX$ thesis template. See CICESE’s library webpage and the README_Plantilla.txt file for more information.
A Little More About Me
Mexican
Spanish | Mother tongue |
English | C1. IELTS, 01 Feb 2020 |
German & Italian | Basic words and phrases only |
Learning goal | I am willing to put in the time and effort required to learn a new language. |
In the past, I was actively involved in various volunteering endeavours:
2016-2018 | CICESE Open Days |
2007-2012 | Zacatecas International Folklore Festival "Gustavo Vaquera Contreras" |
2009 | International Year of Astronomy |
2004, 2005, 2007 | Good Vision to Learn Better |
2004, 2005 | SEMARNAT, Secretariat of Environment and Natural Resources, Mexico |
2003-2005 | Zacatecas Food Bank |
2005 | Zacatecas Street Theater Festival |
Credits
- A modern simple static resume template and theme: modern-resume-theme James Grant. by