Linear time construction of indexable elastic founder graphs

DOI10.1007/978-3-031-06678-8_35OpenAlexW4285151990MaRDI QIDQ2169983

Veli Mäkinen, Nicola Rizzo

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2201.06492

zbMATH Keywords

dynamic programmingdata structuresmultiple sequence alignmentpattern matchingsuffix treesegmentation algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Algorithms and complexity on indexing founder graphs ⋮ Elastic founder graphs improved and enhanced

Uses Software

• HISAT
• vg

Cites Work

• Unnamed Item
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
• On-line construction of suffix trees

This page was built for publication: Linear time construction of indexable elastic founder graphs