| 书目名称 | Construction of Fundamental Data Structures for Strings |
| 编辑 | Felipe A. Louza,Simon Gog,Guilherme P. Telles |
| 视频video | |
| 概述 | This book features numerous examples, including graphic explanations of sophisticated algorithms that provide a clearer understanding of the main algorithmic ideas for readers interested in the topic |
| 丛书名称 | SpringerBriefs in Computer Science |
| 图书封面 |  |
| 描述 | 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.. |
| 出版日期 | Book 2020 |
| 关键词 | Suffix sorting; Suffix array; LCP array; Document array; Lyndon array |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-030-55108-7 |
| isbn_softcover | 978-3-030-55107-0 |
| isbn_ebook | 978-3-030-55108-7Series ISSN 2191-5768 Series E-ISSN 2191-5776 |
| issn_series | 2191-5768 |
| copyright | The Author(s), under exclusive license to Springer Nature Switzerland AG 2020 |
发表于 2025-3-21 18:50:32
