Construction of Fundamental Data Structures for Strings

E-bok

Engelska, 2020

797 kr

Läs direkt i Bokus Reader – eller ladda ned till din enhet

Beskrivning

This books reviews recent theoretical and practical advances on suffix sorting and introduces algorithmic solutions to problems of wide interest for the construction of fundamental data structures that operate efficiently on strings namely, constructing the suffix array, the longest common prefix (LCP) array, the document array and the Lyndon array.

These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression.

This book introduces the relevant problem areas, their importance, the notation and related algorithms and then presents the algorithmic solutions for indexing data structure constructions.

This book is intended for graduate students, researchers and practitioners from Computer Science and Bioinformatics with a strong interest in algorithmic aspects.

Produktinformation

Utgivningsdatum:2020-10-07
Språk:Engelska
Filformat:EPUB
Kopieringsskydd:LCP
ISBN:9783030551087
Förlag:Springer International Publishing

Utforska kategorier

Mer från samma författare