Construction of Fundamental Data Structures for Strings (SpringerBriefs in Computer Science) 1st ed. 2020 Edition
by Felipe A. Louza (Author), Simon Gog (Contributor), Guilherme P. Telles (Contributor)
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.
Product Details
Product Details
- Publisher : Springer; 1st ed. 2020 edition (October 8, 2020)
- Language : English
- Digital eBook : 116 pages

Dilemma's bij dementie
History of Infectious Disease Pandemics in Urban Societies
Teaching Cultural Competence in Nursing and Health Care, Third Edition: Inquiry, Action, and Innovation
The Ileoanal Pouch: A Practical Guide for Surgery, Management and Troubleshooting 1st ed. 2019 Edition
Absolute Obstetric Anesthesia Review: The Complete Study Guide for Certification and Recertification
Small Animal Soft Tissue Surgery
Chronic Headache: A Comprehensive Guide to Evaluation and Management 1st ed. 2019 Edition, Kindle Edition
Mechanical Ventilation in Emergency Medicine
Dynamic Ophthalmic Ultrasonography: A Video Atlas for Ophthalmologists and Imaging Technicians (PDF)
Clinical Research: From Proposal to Implementation
Developability of Biotherapeutics: Computational Approaches 

