Lightweight LCP Construction for Next-Generation Sequencing Datasets

DOI10.1007/978-3-642-33122-0_26zbMath1370.68338arXiv1305.0160OpenAlexW1929174210MaRDI QIDQ4916913

Giovanna Rosone, Anthony J. Cox, Markus J. Bauer, Marinella Sciortino

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/1305.0160

zbMATH Keywords

massive datasetsBWTtext indexesLCPnext-generation sequencing datasets

Mathematics Subject Classification ID

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

Related Items (11)

An external-memory algorithm for string graph construction ⋮ Indeterminate string factorizations and degenerate text transformations ⋮ Lightweight LCP construction for very large collections of strings ⋮ A survey of string orderings and their application to the Burrows-Wheeler transform ⋮ Better External Memory LCP Array Construction ⋮ Full-Text Indexes for High-Throughput Sequencing ⋮ Binary block order Rouen transform ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory

This page was built for publication: Lightweight LCP Construction for Next-Generation Sequencing Datasets