Linear time construction of indexable elastic founder graphs
From MaRDI portal
Publication:2169983
DOI10.1007/978-3-031-06678-8_35OpenAlexW4285151990MaRDI QIDQ2169983FDOQ2169983
Authors: Nicola Rizzo, Veli Mäkinen
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2201.06492
Recommendations
- Linear time construction of indexable founder block graphs
- Algorithms and complexity on indexing founder graphs
- scientific article; zbMATH DE number 7696008
- Optimal query complexity bounds for finding graphs
- scientific article
- On indexable graphs
- Embedding rectilinear graphs in linear time
- scientific article; zbMATH DE number 7301806
- An Almost Linear-Time Algorithm for Graph Realization
- Finding articulation points of large graphs in linear time
dynamic programmingdata structurespattern matchingsuffix treemultiple sequence alignmentsegmentation algorithms
Cites Work
Cited In (2)
Uses Software
This page was built for publication: Linear time construction of indexable elastic founder graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169983)