Image of 125 Problems in text algorithms

Buku Text Sistem Informasi

125 Problems in text algorithms

bibliografi: hal. 318-331
index: hal. 332-334

DescriptionContentsResourcesCoursesAbout the Authors
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).

Ketersediaan
14320518.1 CRO s c1UPT. PERPUSTAKAAN PUSAT (Rak Tandon)Tersedia - No Loan
14321518.1 CRO s c2UPT. PERPUSTAKAAN PUSATTersedia
14322518.1 CRO s c3UPT. PERPUSTAKAAN PUSATTersedia
Informasi Detail
Judul Seri
-
No. Panggil
518.1 CRO s
Penerbit
New York : Cambridge University Press.,
Deskripsi Fisik
x, 334 hlm.; 23 cm
Bahasa
English
ISBN/ISSN
978-1-108-79885-3
Klasifikasi
518.1
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
Ed. I, cet. 1
Subjek
-
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
Tidak Ada Data
Komentar
Anda harus masuk sebelum memberikan komentar