Algorithms and Complexity on Indexing Founder Graphs

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 time to answer queries efficiently (Equi et al. ICAL...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 6; S. 1586 - 1623
Hauptverfasser:	Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2023 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Burrows-Wheeler transform Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Indexing Lower bounds Mathematics of Computing Polynomials Special Issue on Algorithms and Computation (ISAAC 2021) String matching Theory of Computation Compressed data structures Multiple sequence alignment String matching Segmentation algorithms Graph algorithms Computational complexity Pangenomics
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!