國立虎尾科技大學 |

String Algorithms in C = Efficient Text Representation and Search /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	String Algorithms in C/ by Thomas Mailund.
其他題名:	Efficient Text Representation and Search /
作者:	Mailund, Thomas.
面頁冊數:	IX, 293 p. 89 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithm Analysis and Problem Complexity. -
電子資源:	https://doi.org/10.1007/978-1-4842-5920-7
ISBN:	9781484259207

String Algorithms in C = Efficient Text Representation and Search /
Mailund, Thomas.

String Algorithms in CEfficient Text Representation and Search /[electronic resource] :by Thomas Mailund. - 1st ed. 2020. - IX, 293 p. 89 illus.online resource.

1. Introduction -- 2. Classical Algorithms for Exact Search -- 3. Suffix Trees -- 4. Suffix Arrays -- 5. Approximate Search -- 6. Conclusions -- Appendix A: Vectors -- Appendix B: Lists -- Appendix C: Queues.

Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. String Algorithms in C teaches you the following algorithms and how to use them: classical exact search algorithms; tries and compact tries; suffix trees and arrays; approximative pattern searches; and more. In this book, author Thomas Mailund provides a library with all the algorithms and applicable source code that you can use in your own programs. There are implementations of all the algorithms presented in this book so there are plenty of examples. You’ll understand that string algorithms are used in various applications such as image processing, computer vision, text analytics processing from data science to web applications, information retrieval from databases, network security, and much more. You will: Use classical exact search algorithms including naive search, borders/border search, Knuth-Morris-Pratt, and Boyer-Moor with or without Horspool Search in trees, use tries and compact tries, and work with the Aho-Carasick algorithm Process suffix trees including the use and development of McCreight’s algorithm Work with suffix arrays including binary searches; sorting naive constructions; suffix tree construction; skew algorithms; and the Borrows-Wheeler transform (BWT) Deal with enhanced suffix arrays including longest common prefix (LCP) Carry out approximative pattern searches among suffix trees and approximative BWT searches .

ISBN: 9781484259207

Standard No.: 10.1007/978-1-4842-5920-7doiSubjects--Topical Terms:

593923
Algorithm Analysis and Problem Complexity.

LC Class. No.: QA76.7-76.73

Dewey Class. No.: 005.13

String Algorithms in C = Efficient Text Representation and Search /
LDR:03145nam a22004095i 4500 001 1021723
003 DE-He213
005 20200828152040.0
007 cr nn 008mamaa
008 210318s2020 xxu| s |||| 0|eng d
020 $a 9781484259207 $9 978-1-4842-5920-7
024 7 $a 10.1007/978-1-4842-5920-7 $2 doi
035 $a 978-1-4842-5920-7
050 4 $a QA76.7-76.73
050 4 $a QA76.76.C65
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
072 7 $a UMC $2 thema
082 0 4 $a 005.13 $2 23
100 1 $a Mailund, Thomas. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1140758
245 1 0 $a String Algorithms in C $h [electronic resource] : $b Efficient Text Representation and Search / $c by Thomas Mailund.
250 $a 1st ed. 2020.
264 1 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a IX, 293 p. 89 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 1. Introduction -- 2. Classical Algorithms for Exact Search -- 3. Suffix Trees -- 4. Suffix Arrays -- 5. Approximate Search -- 6. Conclusions -- Appendix A: Vectors -- Appendix B: Lists -- Appendix C: Queues.
520 $a Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. String Algorithms in C teaches you the following algorithms and how to use them: classical exact search algorithms; tries and compact tries; suffix trees and arrays; approximative pattern searches; and more. In this book, author Thomas Mailund provides a library with all the algorithms and applicable source code that you can use in your own programs. There are implementations of all the algorithms presented in this book so there are plenty of examples. You’ll understand that string algorithms are used in various applications such as image processing, computer vision, text analytics processing from data science to web applications, information retrieval from databases, network security, and much more. You will: Use classical exact search algorithms including naive search, borders/border search, Knuth-Morris-Pratt, and Boyer-Moor with or without Horspool Search in trees, use tries and compact tries, and work with the Aho-Carasick algorithm Process suffix trees including the use and development of McCreight’s algorithm Work with suffix arrays including binary searches; sorting naive constructions; suffix tree construction; skew algorithms; and the Borrows-Wheeler transform (BWT) Deal with enhanced suffix arrays including longest common prefix (LCP) Carry out approximative pattern searches among suffix trees and approximative BWT searches .
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 0 $a Algorithms. $3 527865
650 0 $a Programming languages (Electronic computers). $3 1127615
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9781484259191
776 0 8 $i Printed edition: $z 9781484259214
856 4 0 $u https://doi.org/10.1007/978-1-4842-5920-7
912 $a ZDB-2-CWD
912 $a ZDB-2-SXPC
950 $a Professional and Applied Computing (SpringerNature-12059)
950 $a Professional and Applied Computing (R0) (SpringerNature-43716)