Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>

Construction of Fundamental Data Structures for Strings

-15% su kodu: ENG15
79,18 
Įprasta kaina: 93,15 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
79,18 
Įprasta kaina: 93,15 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 93.1500 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 10,00 

Knygos aprašymas

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.

Informacija

Autorius: Felipe A. Louza, Guilherme P. Telles, Simon Gog,
Serija: SpringerBriefs in Computer Science
Leidėjas: Springer Nature Switzerland
Išleidimo metai: 2020
Knygos puslapių skaičius: 116
ISBN-10: 3030551075
ISBN-13: 9783030551070
Formatas: 235 x 155 x 7 mm. Knyga minkštu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Construction of Fundamental Data Structures for Strings“

Būtina įvertinti prekę

Goodreads reviews for „Construction of Fundamental Data Structures for Strings“