Efficient computation of sequence mappability

DOI10.1007/978-3-030-00479-8_2zbMath1517.68426OpenAlexW2885600862MaRDI QIDQ6109730

Tomasz Kociumaka, Juliusz Straszyński, Solon P. Pissis, Panagiotis Charalampopoulos, Jakub Radoszewski, Costas S. Iliopoulos, Mai Alzamel

Publication date: 28 July 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/31544

zbMATH Keywords

Hamming distancesuffix treegenome sequencingsequence mappabilitylongest common substring with \(k\) mismatches

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (2)

Efficient computation of sequence mappability ⋮ Faster algorithms for 1-mappability of a sequence

This page was built for publication: Efficient computation of sequence mappability