Manuel Cáceres

According to our database, Manuel Cáceres authored at least 20 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Finding maximal exact matches in graphs.

Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Algorithms Mol. Biol., December, 2024

2023

A safety framework for flow decomposition problems via integer linear programming.

Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu

Bioinform., October, 2023

Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.

Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu

Bioinform., August, 2023

Parameterized and Safe & Complete Graph Algorithms for Bioinformatics.

Manuel Cáceres

PhD thesis, 2023

Minimum Path Cover: The Power of Parameterization.

Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu

CoRR, 2023

Chaining of Maximal Exact Matches in Graphs.

Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Proceedings of the String Processing and Information Retrieval, 2023

Minimum Chain Cover in Almost Linear Time.

Manuel Cáceres

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Sorting Finite Automata via Partition Refinement.

Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond.

Manuel Cáceres

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Improving RNA Assembly via Safety and Completeness in Flow Decompositions.

Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu

J. Comput. Biol., 2022

Faster repetition-aware compressed suffix trees based on Block Trees.

Manuel Cáceres, Gonzalo Navarro

Inf. Comput., 2022

Minimum Path Cover in Parameterized Linear Time.

Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu

CoRR, 2022

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time.

Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Safety and Completeness in Flow Decompositions for RNA Assembly.

Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu

Proceedings of the Research in Computational Molecular Biology, 2022

Width Helps and Hinders Splitting Flows.

Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Block trees.

Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei

J. Comput. Syst. Sci., 2021

A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.

Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

On the parameterized complexity of the Minimum Path Cover problem in DAGs.

Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu

CoRR, 2020

Fast Indexes for Gapped Pattern Matching.

Manuel Cáceres, Simon J. Puglisi, Bella Zhukova

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020