Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes

DOI10.1007/978-3-642-33122-0_17zbMath1370.68340arXiv1304.5535OpenAlexW3105789150MaRDI QIDQ4916910

Ole B. Schulz-Trieglaff, Tobias Jakobi, Anthony J. Cox, Giovanna Rosone

Publication date: 26 April 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (6)

An external-memory algorithm for string graph construction ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Generalized substring compression ⋮ When a dollar makes a BWT ⋮ Detecting Mutations by eBWT ⋮ BEETL

Uses Software

• Soap
• TopHat
• BEDTools
• GitHub

This page was built for publication: Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes