Handbook of Exact String Matching Algorithms (Texts on Algorithms 1)
Christian Charras, Thierry Lecroq
String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.
Jilid:
1
Tahun:
2004
Edisi:
1st
Penerbit:
Parlux
Bahasa:
english
Halaman:
238
ISBN 10:
0954300645
ISBN 13:
9780954300647
Nama siri:
Texts on Algorithms
Fail:
PDF, 713 KB
IPFS:
,
english, 2004
Amazon 
Barnes & Noble 
Bookshop.org 
Tukar fail
Lebih banyak hasil carian
Faedah lain 
![Karumanchi, Narasimha [Karumanchi, Narasimha] — Data Structures and Algorithms Made Easy](https://s3proxy.cdn-zlib.se/covers200/collections/userbooks/b6178a6617292f3ce0dc5d97640ae4dc00a77f690c8dd15189f3e68f242e794d.jpg)
Istilah utama
Koleksi pilihan
