東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Construction of fundamental data str...

Louza, Felipe A.

FindBook

Google Book

Amazon

博客來

Construction of fundamental data structures for strings

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Construction of fundamental data structures for strings/ by Felipe A. Louza, Simon Gog, Guilherme P. Telles.
作者:	Louza, Felipe A.
其他作者:	Gog, Simon.
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	ix, 104 p. :ill. (some col.), digital ;24 cm.
內容註:	Part I. Introduction and Preliminaries -- 1. Introduction -- 2. Background -- 3. Induced Suffix Sorting -- Part II. Augmented Suffix Sorting -- 4. Inducing the LCP Array -- 5. Inducing the Document Array -- 6. Inducing the Lyndon Array -- Part III. Conclusions -- 7. Conclusions -- Index.
Contained By:	Springer Nature eBook
標題:	Data structures (Computer science) -
電子資源:	https://doi.org/10.1007/978-3-030-55108-7
ISBN:	9783030551087

Construction of fundamental data structures for strings
Louza, Felipe A.

Construction of fundamental data structures for strings[electronic resource] /by Felipe A. Louza, Simon Gog, Guilherme P. Telles. - Cham :Springer International Publishing :2020. - ix, 104 p. :ill. (some col.), digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..

Part I. Introduction and Preliminaries -- 1. Introduction -- 2. Background -- 3. Induced Suffix Sorting -- Part II. Augmented Suffix Sorting -- 4. Inducing the LCP Array -- 5. Inducing the Document Array -- 6. Inducing the Lyndon Array -- Part III. Conclusions -- 7. Conclusions -- Index.

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.

ISBN: 9783030551087

Standard No.: 10.1007/978-3-030-55108-7doiSubjects--Topical Terms:

527210
Data structures (Computer science)

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Construction of fundamental data structures for strings
LDR:02228nmm a2200349 a 4500 001 2243562
003 DE-He213
005 20201007062724.0
006 m d
007 cr nn 008maaau
008 211207s2020 sz s 0 eng d
020 $a 9783030551087 $q (electronic bk.)
020 $a 9783030551070 $q (paper)
024 7 $a 10.1007/978-3-030-55108-7 $2 doi
035 $a 978-3-030-55108-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D35
072 7 $a UMB $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b L895 2020
100 1 $a Louza, Felipe A. $3 3503685
245 1 0 $a Construction of fundamental data structures for strings $h [electronic resource] / $c by Felipe A. Louza, Simon Gog, Guilherme P. Telles.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a ix, 104 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SpringerBriefs in computer science, $x 2191-5768
505 0 $a Part I. Introduction and Preliminaries -- 1. Introduction -- 2. Background -- 3. Induced Suffix Sorting -- Part II. Augmented Suffix Sorting -- 4. Inducing the LCP Array -- 5. Inducing the Document Array -- 6. Inducing the Lyndon Array -- Part III. Conclusions -- 7. Conclusions -- Index.
520 $a 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.
650 0 $a Data structures (Computer science) $3 527210
650 0 $a Computers. $3 544777
650 0 $a Bioinformatics. $3 553671
650 1 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Theory of Computation. $3 892514
700 1 $a Gog, Simon. $3 3503686
700 1 $a Telles, Guilherme P. $3 3503687
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in computer science. $3 1567571
856 4 0 $u https://doi.org/10.1007/978-3-030-55108-7
950 $a Computer Science (SpringerNature-11645)