Construction of Fundamental Data Structures for Strings (1st ed. 2020) (SpringerBriefs in Computer Science)

By: and and

Sign Up Now! Already a Member? Log In
You must be logged into Bookshare to access this title. Learn about membership options, or view our freely available titles.

Synopsis
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.
Copyright:
2020

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9783030551087
Related ISBNs:
9783030551070
Publisher:
Springer International Publishing
Date of Addition:
Copyrighted By:
Springer
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Science, Computers and Internet
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet