Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads

DOI10.1007/978-3-031-20643-6_15zbMath1529.92033arXiv2208.14787MaRDI QIDQ6111586

Leena Salmela, Diego Díaz-Domínguez, Simon J. Puglisi

Publication date: 4 August 2023

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

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

zbMATH Keywords

genomicstext indexingcompact data structures

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Lightweight algorithms for constructing and inverting the BWT of string collections
• New algorithms on wavelet trees and applications to information retrieval
• Sublinear approximate string matching and biological applications
• Compressed suffix trees with full functionality
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Suffix Arrays: A New Method for On-Line String Searches
• Algorithms on Strings, Trees and Sequences
• Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
• Orthogonal range searching on the RAM, revisited

This page was built for publication: Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads