Jewels Of Stringology: Text Algorithms

Maxime Crochemore

ISBN 10: 9810248970 ISBN 13: 9789810248970
Verlag: World Scientific Publishing Co Pte Ltd, 2002
Neu PAP

Verkäufer PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Heritage Bookseller
AbeBooks-Mitglied seit 1996


Beschreibung

Beschreibung:

New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers CW-9789810248970

Diesen Artikel melden

Inhaltsangabe:

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Bibliografische Details

Titel: Jewels Of Stringology: Text Algorithms
Verlag: World Scientific Publishing Co Pte Ltd
Erscheinungsdatum: 2002
Einband: PAP
Zustand: New

Beste Suchergebnisse bei AbeBooks

Beispielbild für diese ISBN

Rytter, Wojciech,Crochemore, Maxime
ISBN 10: 9810248970 ISBN 13: 9789810248970
Gebraucht paperback

Anbieter: HPB-Red, Dallas, TX, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

paperback. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_425021991

Verkäufer kontaktieren

Gebraucht kaufen

EUR 50,63
EUR 3,19 shipping
Versand innerhalb von USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Rytter, Wojciech; Crochemore, Maxime
ISBN 10: 9810248970 ISBN 13: 9789810248970
Gebraucht Softcover

Anbieter: ZBK Books, Carlstadt, NJ, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: acceptable. Fast & Free Shipping â" A well-used but reliable copy with all text fully readable. Pages and cover remain intact, though wear such as notes, highlighting, bends, or library marks may be present. Supplemental items like CDs or access codes may not be included. Bestandsnummer des Verkäufers ZWV.9810248970.A

Verkäufer kontaktieren

Gebraucht kaufen

EUR 53,48
Versand gratis
Versand innerhalb von USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Crochemore, Maxime; Rytter, Wojciech
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Softcover

Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Bestandsnummer des Verkäufers 2326458-n

Verkäufer kontaktieren

Neu kaufen

EUR 65,53
EUR 17,14 shipping
Versand von Vereinigtes Königreich nach USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Maxime Crochemore, Wojciech Rytter
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Paperback

Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9789810248970

Verkäufer kontaktieren

Neu kaufen

EUR 65,54
EUR 74,27 shipping
Versand von Vereinigtes Königreich nach USA

Anzahl: 13 verfügbar

In den Warenkorb

Foto des Verkäufers

Crochemore, Maxime; Rytter, Wojciech
ISBN 10: 9810248970 ISBN 13: 9789810248970
Gebraucht Softcover

Anbieter: GreatBookPrices, Columbia, MD, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 2326458

Verkäufer kontaktieren

Gebraucht kaufen

EUR 66,44
EUR 2,25 shipping
Versand innerhalb von USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Crochemore, Maxime; Rytter, Wojciech
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Softcover

Anbieter: GreatBookPrices, Columbia, MD, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Bestandsnummer des Verkäufers 2326458-n

Verkäufer kontaktieren

Neu kaufen

EUR 66,86
EUR 2,25 shipping
Versand innerhalb von USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Crochemore, Maxime; Rytter, Wojciech
ISBN 10: 9810248970 ISBN 13: 9789810248970
Gebraucht Softcover

Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 2326458

Verkäufer kontaktieren

Gebraucht kaufen

EUR 68,55
EUR 17,14 shipping
Versand von Vereinigtes Königreich nach USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Wojciech Rytter
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Paperback

Anbieter: Grand Eagle Retail, Bensenville, IL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: new. Paperback. 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." 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9789810248970

Verkäufer kontaktieren

Neu kaufen

EUR 69,19
Versand gratis
Versand innerhalb von USA

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Rytter, Wojciech; Crochemore, Maxime
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Softcover

Anbieter: California Books, Miami, FL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Bestandsnummer des Verkäufers I-9789810248970

Verkäufer kontaktieren

Neu kaufen

EUR 69,26
Versand gratis
Versand innerhalb von USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Maxime Crochemore, Wojciech Rytter
ISBN 10: 9810248970 ISBN 13: 9789810248970
Neu Paperback

Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9789810248970

Verkäufer kontaktieren

Neu kaufen

EUR 69,66
Versand gratis
Versand von Vereinigtes Königreich nach USA

Anzahl: 13 verfügbar

In den Warenkorb

Es gibt 5 weitere Exemplare dieses Buches

Alle Suchergebnisse ansehen