Detecting Mutations by eBWT

DOI10.4230/LIPIcs.WABI.2018.3zbMath1494.92089arXiv1805.01876OpenAlexW2964007100MaRDI QIDQ5090327

Marinella Sciortino, Giovanna Rosone, Nadia Pisanti, Nicola Prezza

Publication date: 18 July 2022

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

zbMATH Keywords

LCP arrayBWTSNPsassembly-freereference-free

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Space-efficient construction of compressed suffix trees ⋮ Space-efficient computation of the LCP array from the Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Lightweight algorithms for constructing and inverting the BWT of string collections
• Inducing enhanced suffix arrays for string collections
• An extension of the Burrows-Wheeler transform
• Lightweight LCP construction for very large collections of strings
• Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes
• Lightweight BWT and LCP Merging via the Gap Algorithm

This page was built for publication: Detecting Mutations by eBWT