WORLD SCIENTIFIC'S LECTURE NOTES SERIES ON COMPUTING String Searching Algorithms, String Matching Algorithms, String Algorithms, Text Algorithms, Pattern Matching Algorithms, Algorithmics, Approximate String Matching, Edit Distance, String Distance, Common Sequences, Substrings, Subsequences, Longest Repetitions, Suffix Trees, Theoretical Computer Science, Computational Biology, Lecture Notes Series on Computing, World Scientific Publishing, Book, Monograph, Graham Alexander Stephen, Graham A Stephen, Graham Stephen, AMS Mathematical Reviews, ACM Computing Reviews

STRING SEARCHING ALGORITHMS
by Graham A Stephen
This delightful book provides succinct and complete coverage of the important algorithms for string matching and approximate string matching...    In most cases, the writing is extremely clear so that it can be understood in a single relaxed reading...
    ACM Computing Reviews, October 1995
The presentation of the material in the book is quite original...    In my opinion, researchers can read the book as a monograph on a sample of problems in text algorithmics, and students can use it to learn several basic important algorithms in the field.
    Maxime Crochemore,
    Mathematical Reviews,
    Issue 96e (American Mathematical Society)

(Also reviewed in Zentralblatt für Mathematik und ihre Grenzgebiete (Mathematical Abstracts) (Springer Verlag), Vol. 831, No. 68028, ISSN 0044-4235.)

Published October 1994
First Reprint 1998
243pp 		ISBN 981-02-1829-X
ISBN 981-02-3703-0 (pbk) 		(US) $46 / (UK) £32
(US) $28 / (UK) £20
[Home] [Summary] [Contents] [Publisher]




© 1995-99 Graham A Stephen
(gastephen@iee.org)



String Searching Algorithms String Matching Algorithms Text Algorithms Pattern Matching Algorithms