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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 483; s. 134 - 148
Hlavní autori:	Bauer, Markus J., Cox, Anthony J., Rosone, Giovanna
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 29.04.2013
Predmet:	BWT Next-generation sequencing Text indexes BWT Text indexes Next-generation sequencing
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!