
String Searching Algorithms
Graham A. Stephen(Author)
World Scientific Publishing Co Pte Ltd
Will be published approx. on 1. October 1994
Book
Hardback
256 pages
978-981-02-1829-4 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Singapore
Singapore
Target group
College/higher education
Professional and scholarly
Product notice
Laminated cover
Dimensions
Height: 229 mm
Width: 152 mm
Weight
18 gr
ISBN-13
978-981-02-1829-4 (9789810218294)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Content
String Matching; String Distance and Common Sequences; Suffix Trees; Approximate String Matching; Repeated Substrings.