Suffix trees for very large inputs

Suffix trees for very large inputs

A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than their input sequences...

Full description

Bibliographic Details
Main Author: Barsky, Marina
Other Authors: Thomo, Alex
Language:English
en
Published: 2010
Subjects:
full-text index
genomics
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Online Access:http://hdl.handle.net/1828/2901
M. Barsky, U. Stege, and A. Thomo, A survey of practical algorithms for suffix tree construction in external memory. (Accepted for publication, Software: Practice and Experience) Pre-published on-line:http://authorservices.wiley.com/bauthor/WISproxy.asp?doi=10.1002/spe.960&ArticleID=658860

Internet

http://hdl.handle.net/1828/2901
M. Barsky, U. Stege, and A. Thomo, A survey of practical algorithms for suffix tree construction in external memory. (Accepted for publication, Software: Practice and Experience) Pre-published on-line:http://authorservices.wiley.com/bauthor/WISproxy.asp?doi=10.1002/spe.960&ArticleID=658860

Similar Items