1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2025
Practical colinear chaining on sequences revisited
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
Colinear chaining is a classical heuristic for sequence alignment and is widely used in modern practical aligners. Jain et al. (J. Comput. Biol. 2022) proposed an t…
cs.DS2023
Finding Maximal Exact Matches in Graphs
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
We study the problem of finding maximal exact matches (MEMs) between a query string and a labeled graph . MEMs are an important class of seeds, often used in seed-chain-exte…
cs.DS2023★ 1 cited
Elastic Founder Graphs Improved and Enhanced
Nicola Rizzo, Massimo Equi, Tuukka Norri +1
Indexing labeled graphs for pattern matching is a central challenge of pangenomics. Equi et al. (Algorithmica, 2022) developed the Elastic Founder Graph () representi…