Projekt per år
Sammanfattning
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 subquadratic time, nor index the graph in polynomial time to answer queries efficiently (Equi et al. ICALP 2019, SOFSEM 2021). These conditional lowerbounds cover even deterministic graphs with binary alphabet, but there naturally exist also graph classes that are easy to index: E.g. Wheeler graphs (Gagie et al. Theor. Comp. Sci. 2017) cover graphs admitting a BurrowsWheeler transform based indexing scheme. However, it is NPcomplete to recognize if a graph is a Wheeler graph (Gibney, Thankachan, ESA 2019).
We propose an approach to alleviate the construction bottleneck of Wheeler graphs. Rather than starting from an arbitrary graph, we study graphs induced from multiple sequence alignments. Elastic degenerate strings (Bernadini et al. SPIRE 2017, ICALP 2019) can be seen as such graphs, and we introduce here their generalization: elastic founder graphs. We first prove that even such induced graphs are hard to index under OVH. Then we introduce two subclasses that are easy to index. Moreover, we give a nearlinear time algorithm to construct indexable elastic founder graphs. This algorithm is based on an earlier segmentation algorithm for gapless multiple sequence alignments inducing nonelastic founder graphs (Mäkinen et al., WABI 2020), but uses more involved techniques to cope with repetitive string collections synchronized with gaps. Finally, we show that one of the subclasses admits a reduction to Wheeler graphs in polynomial time.
We propose an approach to alleviate the construction bottleneck of Wheeler graphs. Rather than starting from an arbitrary graph, we study graphs induced from multiple sequence alignments. Elastic degenerate strings (Bernadini et al. SPIRE 2017, ICALP 2019) can be seen as such graphs, and we introduce here their generalization: elastic founder graphs. We first prove that even such induced graphs are hard to index under OVH. Then we introduce two subclasses that are easy to index. Moreover, we give a nearlinear time algorithm to construct indexable elastic founder graphs. This algorithm is based on an earlier segmentation algorithm for gapless multiple sequence alignments inducing nonelastic founder graphs (Mäkinen et al., WABI 2020), but uses more involved techniques to cope with repetitive string collections synchronized with gaps. Finally, we show that one of the subclasses admits a reduction to Wheeler graphs in polynomial time.
Originalspråk  engelska 

Titel på värdpublikation  32nd International Symposium on Algorithms and Computation (ISAAC 2021) 
Redaktörer  HeeKap Ahn, Kunihiko Sadakane 
Antal sidor  18 
Utgivningsort  Dagstuhl, Germany 
Förlag  Schloss Dagstuhl  LeibnizZentrum für Informatik 
Utgivningsdatum  30 nov. 2021 
ISBN (elektroniskt)  9783959772143 
DOI  
Status  Publicerad  30 nov. 2021 
MoEpublikationstyp  A4 Artikel i en konferenspublikation 
Evenemang  The 32nd International Symposium on Algorithms and Computation (ISAAC 2021)  Fukuoka, Japan Varaktighet: 6 dec. 2021 → 8 dec. 2021 Konferensnummer: 32 https://tcs.inf.kyushuu.ac.jp/isaac2021/ 
Publikationsserier
Namn  Leibniz International Proceedings in Informatics (LIPIcs) 

Förlag  Schloss Dagstuhl – LeibnizZentrum für Informatik 
Volym  212 
ISSN (elektroniskt)  18688969 
Vetenskapsgrenar
 113 Data och informationsvetenskap
Projekt
 1 Aktiv

SAFEBIO: Safe and Complete Algorithms for Bioinformatics
Khan, S., Schmidt, S. S. & Ma, J.
01/03/2020 → 28/02/2025
Projekt: Forskningsprojekt