Construction of Fundamental Data Structures for Strings

de

, ,

Éditeur :

Springer


Collection :

SpringerBriefs in Computer Science

Paru le : 2020-10-07

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
58,01

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description
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.
Pages
104 pages
Collection
SpringerBriefs in Computer Science
Parution
2020-10-07
Marque
Springer
EAN papier
9783030551070
EAN PDF
9783030551087

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
3113 Ko
Prix
58,01 €
EAN EPUB
9783030551087

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
11530 Ko
Prix
58,01 €