國立高雄大學圖資館 |

Language: English

Back

String algorithms in Cefficient text...

Mailund, Thomas.

String algorithms in Cefficient text representation and search /

Record Type:	Electronic resources : Monograph/item
Title/Author:	String algorithms in Cby Thomas Mailund.
Reminder of title:	efficient text representation and search /
Author:	Mailund, Thomas.
Published:	Berkeley, CA :Apress :2020.
Description:	ix, 293 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithms.
Online resource:	https://doi.org/10.1007/978-1-4842-5920-7
ISBN:	9781484259207$q(electronic bk.)

String algorithms in Cefficient text representation and search /
Mailund, Thomas.

String algorithms in Cefficient text representation and search /[electronic resource] :by Thomas Mailund. - Berkeley, CA :Apress :2020. - ix, 293 p. :ill., digital ;24 cm.

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$q(electronic bk.)

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

184478
Computer algorithms.

LC Class. No.: QA76.9.A43 / M35 2020

Dewey Class. No.: 005.13

String algorithms in Cefficient text representation and search /
LDR:02823nmm a2200337 a 4500 001 585537
003 DE-He213
005 20200828152040.0
006 m d
007 cr nn 008maaau
008 210311s2020 cau s 0 eng d
020 $a 9781484259207$q(electronic bk.)
020 $a 9781484259191$q(paper)
024 7 $a 10.1007/978-1-4842-5920-7 $2 doi
035 $a 978-1-4842-5920-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b M35 2020
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
090 $a QA76.9.A43 $b M222 2020
100 1 $a Mailund, Thomas. $3 776342
245 1 0 $a String algorithms in C $h [electronic resource] : $b efficient text representation and search / $c by Thomas Mailund.
260 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2020.
300 $a ix, 293 p. : $b ill., digital ; $c 24 cm.
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 0 $a Computer algorithms. $3 184478
650 0 $a C (Computer program language) $3 181957
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Algorithms. $3 184661
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-1-4842-5920-7
950 $a Professional and Applied Computing (SpringerNature-12059)