Algorithms and Complexity on Indexing Elastic Founder Graphs

Autor: Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., M��kinen, Veli

Publikováno v: 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this problem in strongly sub-quadratic time, nor index the graph in polynomial ti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54fb65c15f4d41920c731972214056b4
http://hdl.handle.net/10138/338450

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree

Autor: Equi, Massimo, Grossi, Roberto, M��kinen, Veli

Publikováno v: ICALP 2019-46th International Colloquium on Automata, Languages and Programming
ICALP 2019-46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece. pp.1-15

Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in comput

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::941d9a8243037355d18596cec336a9d9
https://inria.hal.science/hal-02338498

Factors affecting outdoor exposure in winter: population-based study.

Autor: Tiina Mäkinen, Veli-Pekka Raatikka, Mika Rytkönen, Jari Jokelainen, Hannu Rintamäki, Reija Ruuhela, Simo Näyhä, Juhani Hassi

Publikováno v: International Journal of Biometeorology; Sep2006, Vol. 51 Issue 1, p27-36, 10p