Jewels of Stringology

4.33 avg rating
( 6 ratings by Goodreads )
 
9789810248970: Jewels of Stringology

The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

"synopsis" may belong to another edition of this title.

Review:

.,." nicely covers material from the famous KMP and BM algorithms to suffix trees ..."

"About this title" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Rytter, Wojciech, Crochemore, Maxime
Published by World Scientific Publishing Company (2002)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Quantity Available: 1
Seller:
Zubal-Books
(Cleveland, OH, U.S.A.)
Rating
[?]

Book Description World Scientific Publishing Company, 2002. Book Condition: New. 320 pp., Paperback, NEW!!. Bookseller Inventory # ZB1085831

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 49.78
Convert Currency

Add to Basket

Shipping: US$ 3.50
Within U.S.A.
Destination, Rates & Speeds

2.

Maxime Crochemore, Wojciech Rytter
Published by World Scientific Publishing Co Pte Ltd, Singapore (2003)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Paperback Quantity Available: 1
Seller:
The Book Depository US
(London, United Kingdom)
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd, Singapore, 2003. Paperback. Book Condition: New. Language: English . Brand New Book. The term stringology is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as algorithmic jewels and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms. Bookseller Inventory # AAZ9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 64.74
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

3.

Maxime Crochemore, Wojciech Rytter
Published by World Scientific Publishing Co Pte Ltd, Singapore (2003)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Paperback Quantity Available: 1
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd, Singapore, 2003. Paperback. Book Condition: New. Language: English . Brand New Book. The term stringology is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as algorithmic jewels and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms. Bookseller Inventory # AAZ9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 66.60
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Maxime Crochemore
Published by World Scientific Publishing Co Pte Ltd (2002)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Quantity Available: 2
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd, 2002. PAP. Book Condition: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Bookseller Inventory # GB-9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 56.59
Convert Currency

Add to Basket

Shipping: US$ 11.88
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

MAXIME CROCHEMORE
Published by World Scientific Publishing 2002-09-17 (2002)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New paperback Quantity Available: 1
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description World Scientific Publishing 2002-09-17, 2002. paperback. Book Condition: New. Bookseller Inventory # 9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 61.17
Convert Currency

Add to Basket

Shipping: US$ 7.92
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Maxime Crochemore, Wojciech Rytter
Published by World Scientific Publishing Co Pte Ltd
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Paperback Quantity Available: 1
Seller:
THE SAINT BOOKSTORE
(Southport, United Kingdom)
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd. Paperback. Book Condition: new. BRAND NEW, Jewels of Stringology: Text Algorithms, Maxime Crochemore, Wojciech Rytter, The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This work deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The text reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. Bookseller Inventory # B9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 60.37
Convert Currency

Add to Basket

Shipping: US$ 9.16
From United Kingdom to U.S.A.
Destination, Rates & Speeds

7.

Crochemore, Maxime; Rytter, Wojciech
Published by World Scientific Publishing Co Pte Ltd (2002)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Softcover Quantity Available: 2
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd, 2002. Book Condition: New. This work deals with the basic algorithms in the area of stringology. It reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. Num Pages: 320 pages. BIC Classification: PBV; UMB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 227 x 163 x 18. Weight in Grams: 466. . 2002. Paperback. . . . . . Bookseller Inventory # V9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 77.06
Convert Currency

Add to Basket

Shipping: FREE
From Ireland to U.S.A.
Destination, Rates & Speeds

8.

Maxime Crochemore, Wojciech Rytter
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Paperback Quantity Available: 2
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Paperback. Book Condition: New. Not Signed; The term stringology is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as algorithmic jewels and deserve reader-friendly presentation. One of the main aims of the book is to present several. book. Bookseller Inventory # ria9789810248970_rkm

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 72.42
Convert Currency

Add to Basket

Shipping: US$ 5.11
From United Kingdom to U.S.A.
Destination, Rates & Speeds

9.

Crochemore, Maxime; Rytter, Wojciech
Published by World Scientific Publishing Co Pte Ltd
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Softcover Quantity Available: 2
Seller:
Kennys Bookstore
(Olney, MD, U.S.A.)
Rating
[?]

Book Description World Scientific Publishing Co Pte Ltd. Book Condition: New. This work deals with the basic algorithms in the area of stringology. It reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. Num Pages: 320 pages. BIC Classification: PBV; UMB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 227 x 163 x 18. Weight in Grams: 466. . 2002. Paperback. . . . . Books ship from the US and Ireland. Bookseller Inventory # V9789810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 78.67
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

10.

Wojciech Rytter; Maxime Crochemore
Published by World Scientific Publishing Company (2002)
ISBN 10: 9810248970 ISBN 13: 9789810248970
New Paperback Quantity Available: 1
Seller:
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating
[?]

Book Description World Scientific Publishing Company, 2002. Paperback. Book Condition: New. book. Bookseller Inventory # M9810248970

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 79.66
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book