Pattern Matching Algorithms
Alberto Apostolico Β· Zvi Galil
ΠΌΠ°ΠΉ 1997β―Π³. Β· Oxford University Press
ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½Π°Ρ ΠΊΠ½ΠΈΠ³Π°
400
ΠΠΎΠ»ΠΈΡΠ΅ΡΡΠ²ΠΎ ΡΡΡΠ°Π½ΠΈΡ
family_home
ΠΠΎΠΆΠ½ΠΎ Π΄ΠΎΠ±Π°Π²ΠΈΡΡ
info
reportΠΡΠ΅Π½ΠΊΠΈ ΠΈ ΠΎΡΠ·ΡΠ²Ρ Π½Π΅ ΠΏΡΠΎΠ²Π΅ΡΠ΅Π½Ρ. ΠΠΎΠ΄ΡΠΎΠ±Π½Π΅Π΅β¦
ΠΠ± ΡΠ»Π΅ΠΊΡΡΠΎΠ½Π½ΠΎΠΉ ΠΊΠ½ΠΈΠ³Π΅
Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algorithms were discovered as a result of these needs, which in turn created the subfield of Pattern Matching. This book provides an overview of the current state of Pattern Matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material advanced enough to faithfully portray the current frontier of research. Because of these recent advances, this is the right time for a book that brings together information relevant to both graduate students and specialists in need of an in-depth reference.
ΠΡΠ΅Π½ΠΈΡΠ΅ ΡΠ»Π΅ΠΊΡΡΠΎΠ½Π½ΡΡ ΠΊΠ½ΠΈΠ³Ρ
ΠΠΎΠ΄Π΅Π»ΠΈΡΠ΅ΡΡ Ρ Π½Π°ΠΌΠΈ ΡΠ²ΠΎΠΈΠΌ ΠΌΠ½Π΅Π½ΠΈΠ΅ΠΌ.
ΠΠ΄Π΅ ΡΠΈΡΠ°ΡΡ ΠΊΠ½ΠΈΠ³ΠΈ
Π‘ΠΌΠ°ΡΡΡΠΎΠ½Ρ ΠΈ ΠΏΠ»Π°Π½ΡΠ΅ΡΡ
Π£ΡΡΠ°Π½ΠΎΠ²ΠΈΡΠ΅ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΠ΅ Google Play ΠΠ½ΠΈΠ³ΠΈ Π΄Π»Ρ Android ΠΈΠ»ΠΈ iPad/iPhone. ΠΠ½ΠΎ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΡΠ΅ΡΡΡ Ρ Π²Π°ΡΠΈΠΌ Π°ΠΊΠΊΠ°ΡΠ½ΡΠΎΠΌ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈ, ΠΈ Π²Ρ ΡΠΌΠΎΠΆΠ΅ΡΠ΅ ΡΠΈΡΠ°ΡΡ Π»ΡΠ±ΠΈΠΌΡΠ΅ ΠΊΠ½ΠΈΠ³ΠΈ ΠΎΠ½Π»Π°ΠΉΠ½ ΠΈ ΠΎΡΠ»Π°ΠΉΠ½ Π³Π΄Π΅ ΡΠ³ΠΎΠ΄Π½ΠΎ.
ΠΠΎΡΡΠ±ΡΠΊΠΈ ΠΈ Π½Π°ΡΡΠΎΠ»ΡΠ½ΡΠ΅ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΡ
Π‘Π»ΡΡΠ°ΠΉΡΠ΅ Π°ΡΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΈΠ· Google Play Π² Π²Π΅Π±-Π±ΡΠ°ΡΠ·Π΅ΡΠ΅ Π½Π° ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ΅.
Π£ΡΡΡΠΎΠΉΡΡΠ²Π° Π΄Π»Ρ ΡΡΠ΅Π½ΠΈΡ ΠΊΠ½ΠΈΠ³
Π§ΡΠΎΠ±Ρ ΠΎΡΠΊΡΡΡΡ ΠΊΠ½ΠΈΠ³Ρ Π½Π° ΡΠ°ΠΊΠΎΠΌ ΡΡΡΡΠΎΠΉΡΡΠ²Π΅ Π΄Π»Ρ ΡΡΠ΅Π½ΠΈΡ, ΠΊΠ°ΠΊ Kobo, ΡΠΊΠ°ΡΠ°ΠΉΡΠ΅ ΡΠ°ΠΉΠ» ΠΈ Π΄ΠΎΠ±Π°Π²ΡΡΠ΅ Π΅Π³ΠΎ Π½Π° ΡΡΡΡΠΎΠΉΡΡΠ²ΠΎ. ΠΠΎΠ΄ΡΠΎΠ±Π½ΡΠ΅ ΠΈΠ½ΡΡΡΡΠΊΡΠΈΠΈ ΠΌΠΎΠΆΠ½ΠΎ Π½Π°ΠΉΡΠΈ Π² Π‘ΠΏΡΠ°Π²ΠΎΡΠ½ΠΎΠΌ ΡΠ΅Π½ΡΡΠ΅.
