Jewels Of Stringology: Text Algorithms
Maxime Crochemore
ISBN 10: 9810248970 ISBN 13: 9789810248970
Editore: World Scientific Publishing Co Pte Ltd, 2002
Nuovi
PAP
Da
PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 7 aprile 2005
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
New Book. Shipped from UK. Established seller since 2000. Codice articolo CW-9789810248970
Riassunto:
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Jewels Of Stringology: Text Algorithms
Casa editrice: World Scientific Publishing Co Pte Ltd
Data di pubblicazione: 2002
Legatura: PAP
Condizione: New
I migliori risultati di ricerca su AbeBooks
Foto dell'editore
Jewels of Stringology
Editore:
World Scientific Publishing Comp, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Antico o usato
paperback
Da: HPB-Red, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: 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! Codice articolo S_425021991
Compra usato
EUR 50,79
EUR 3,20 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Jewels of Stringology
Editore:
World Scientific Publishing Company, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Antico o usato
Brossura
Da: ZBK Books, Carlstadt, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo ZWV.9810248970.A
Compra usato
EUR 53,64
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Jewels of Stringology
Editore:
World Scientific Publishing Company, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Nuovo
Brossura
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9789810248970
Compra nuovo
EUR 69,47
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Jewels Of Stringology: Text Algorithms
Editore:
World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9789810248970
Compra nuovo
EUR 69,87
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 3 disponibili
Immagini fornite dal venditore
Jewels of Stringology: Text Algorithms
Editore:
WORLD SCIENTIFIC PUB CO INC, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.Inhaltsve. Codice articolo 909656886
Compra nuovo
EUR 71,30
EUR 48,99 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
JEWELS OF STRINGOLOGY
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. JEWELS OF STRINGOLOGY | Crochemore Maxime | Taschenbuch | Kartoniert / Broschiert | Englisch | 2002 | World Scientific | EAN 9789810248970 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Codice articolo 102390653
Compra nuovo
EUR 74,10
EUR 70,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Jewels Of Stringology: Text Algorithms
Editore:
World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970
ISBN 13: 9789810248970
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9789810248970
Compra nuovo
EUR 80,35
EUR 74,24 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 3 disponibili
Immagini fornite dal venditore
JEWELS OF STRINGOLOGY
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 resultspresently 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. Codice articolo 9789810248970
Compra nuovo
EUR 85,56
EUR 62,35 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Jewels of Stringology
Editore:
World Scientific Pub Co Inc, 2003
ISBN 10: 9810248970
ISBN 13: 9789810248970
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 320 pages. 8.80x6.00x0.70 inches. In Stock. Codice articolo x-9810248970
Compra nuovo
EUR 91,52
EUR 11,42 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili