scientific article; zbMATH DE number 7559033

DOI10.4230/LIPIcs.WABI.2018.15zbMath1494.92072arXiv1805.03574MaRDI QIDQ5090343

Dmitry Kosolobov, Tuukka Norri, Bastien Cazaux, Veli Mäkinen

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingrange minimum querypositional Burrows-Wheeler transformfounder reconstructionpan-genome indexing

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Algorithms and complexity on indexing founder graphs ⋮ Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance

Cites Work

• Unnamed Item
• Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
• Indexing Highly Repetitive Collections
• Hybrid indexes for repetitive datasets
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE

This page was built for publication: