株式会社極東書店トップ ＞ 商品一覧 ＞ Construction of Fundamental Data Structures for Strings. 1st ed. 2020
商品詳細
Construction of Fundamental Data Structures for Strings. 1st ed. 2020
・ISBN 978-3-030-55107-0 paper EUR 54.99
￥14,698.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Louza, Felipe A. / Gog, Simon / Telles, Guilherme P., |
|---|---|
| シリーズ | (SpringerBriefs in Computer Science) |
| 出版社 | (Springer Nature Switzerland AG, SZ) |
| 出版年月 | 2020 |
| ページ数 | 104 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A02-76867＞ |
解説
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.
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.