An Introduction to String Algorithms by Carl Kingsford (.PDF)
File Size: 11.9 MB
An Introduction to String Algorithms by Carl Kingsford
Requirements: .PDF reader, 11.9 MB | True PDF
Overview: An essential introduction to the building blocks of modern text processing. String algorithms make it possible to process, store, and manipulate text with computational efficiency, with applications ranging from search engines and social networks that regularly process terabytes of information to areas like genomics, where the genome of an organism can be encoded as a long string of letters. This book provides an incisive introduction to the concepts and applications that every practitioner in the field needs to know. Ideal for the classroom and self-study, it guides readers from the fundamentals of string processing to advanced computational methods, presenting useful data structures and proof techniques for strings and other data and serving as an on-ramp to doing cutting-edge research in string algorithms. We assume you understand the language of algorithms: loops, if statements, functions, arrays, etc. We also assume some mathematical ability—big-O notation and some basic mathematical manipulations are used. By design, no seriously “advanced” mathematics is used in the text.
Genre: Non-Fiction > Tech & Devices
Free Download links: