Manuel Cáceres

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 34

Top Topics

String Matching

Top Venues

Publications

Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
Practical Minimum Path Cover. SEA (2024)
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Finding maximal exact matches in graphs. Algorithms Mol. Biol. 19 (1) (2024)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20 (2) (2024)
Manuel Cáceres
Minimum Chain Cover in Almost Linear Time. CoRR (2023)
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Finding Maximal Exact Matches in Graphs. WABI (2023)
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Chaining of Maximal Exact Matches in Graphs. SPIRE (2023)
Manuel Cáceres
Minimum Chain Cover in Almost Linear Time. ICALP (2023)
Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
A safety framework for flow decomposition problems via integer linear programming. Bioinform. 39 (10) (2023)
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Finding Maximal Exact Matches in Graphs. CoRR (2023)
Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. Bioinform. 39 (8) (2023)
Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
Minimum Path Cover: The Power of Parameterization. CoRR (2023)
Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR (2023)
Manuel Cáceres
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CPM (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. ESA (2023)
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Chaining of Maximal Exact Matches in Graphs. CoRR (2023)
Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
Sorting Finite Automata via Partition Refinement. CoRR (2023)
Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19 (6) (2022)
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR (2022)
Manuel Cáceres, Gonzalo Navarro
Faster repetition-aware compressed suffix trees based on Block Trees. Inf. Comput. 285 (Part) (2022)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. ESA (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA (2022)
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
Width Helps and Hinders Splitting Flows. CoRR (2022)
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB (2022)
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. 29 (12) (2022)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Minimum Path Cover in Parameterized Linear Time. CoRR (2022)
Manuel Cáceres
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CoRR (2022)
Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei
Block trees. J. Comput. Syst. Sci. 117 (2021)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG (2021)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR (2021)
Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
Fast Indexes for Gapped Pattern Matching. CoRR (2020)
Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
Fast Indexes for Gapped Pattern Matching. SOFSEM (2020)
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR (2020)
Manuel Cáceres, Gonzalo Navarro
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. SPIRE (2019)
Manuel Cáceres, Gonzalo Navarro
Faster Repetition-Aware Compressed Suffix Trees based on Block Trees. CoRR (2019)