Construction of Fundamental Data Structures for Strings
Sale price
$53.99
Regular price $59.99
Skip to product information
Construction of Fundamental Data Structures for Strings
Sale price
$53.99
Regular price $59.99
Reliable shipping
Flexible returns
SpringerBriefs in Computer Science
Construction of Fundamental Data Structures for Strings
Felipe A. Louza | Simon Gog | Guilherme P. Telles
Computers / Database Administration & Management
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.
Felipe Alves Louza, Dr., Prof., Faculdade de Engenharia Elétrica, Universidade Federal de Uberlândia, Uberlândia – MG, Brazil, 38400-902
Simon Gog, Dr., eBay Inc., San Jose – USA
Guilherme Pimentel Telles, Dr., Prof., Instituto de Computação, Universidade Estadual de Campinas, Campinas – SP, Brazil, 13083-852
| Publication Date: | 08 October 2020 |
| Publisher: | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) |
| Imprint: | Springer |
| ISBN-13: | 9783030551070 |
| Format: | Paperback softback |
| Page Count: | 104 |