Lightweight algorithms for constructing and inverting the BWT of string collections

Recent progress in the field of DNA sequencing motivates us to consider the problem of computing the Burrows–Wheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be gene...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 483; pp. 134 - 148
Main Authors:	Bauer, Markus J., Cox, Anthony J., Rosone, Giovanna
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.04.2013
Subjects:	BWT Next-generation sequencing Text indexes BWT Text indexes Next-generation sequencing
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!