String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area, and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating 'edit' distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.
"synopsis" may belong to another edition of this title.
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condition: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail. Seller Inventory # OTV.9810237030.VG
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Fine. Used book that is in almost brand-new condition. May contain a remainder mark. Better World Books: Buy Books. Do Good. Seller Inventory # 68916992-6
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 256 pages. 12.48x8.70x0.57 inches. In Stock. Seller Inventory # zk9810237030
Quantity: 1 available