Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press 11/6/2014, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Algorithms on Strings. Book.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 47.97
Quantity: Over 20 available
Add to basketCondition: New. In English.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases. Num Pages: 392 pages, 6 tables 142 exercises. BIC Classification: UMB; UMZ. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 231 x 154 x 26. Weight in Grams: 52. . 2014. Paperback. . . . .
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases. Num Pages: 392 pages, 6 tables 142 exercises. BIC Classification: UMB; UMZ. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 231 x 154 x 26. Weight in Grams: 52. . 2014. Paperback. . . . . Books ship from the US and Ireland.
Language: English
Published by Cambridge University Press, 2001
ISBN 10: 0521848997 ISBN 13: 9780521848992
Hardcover. Condition: Good. viii 383p hardback, illustrated blue boards, a fresh copy, clean firm, in excellent condition Language: English.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,750grams, ISBN:9780521848992.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: WYEMART LIMITED, HEREFORD, United Kingdom
Hardcover. Condition: Very Good.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 136.80
Quantity: Over 20 available
Add to basketCondition: New. In English.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 136.79
Quantity: Over 20 available
Add to basketCondition: New.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 152.26
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases. Num Pages: 392 pages, 6 tables 142 exercises. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 236 x 160 x 27. Weight in Grams: 624. . 2007. Illustrated. hardcover. . . . . Books ship from the US and Ireland.
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases. Num Pages: 392 pages, 6 tables 142 exercises. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 236 x 160 x 27. Weight in Grams: 624. . 2007. Illustrated. hardcover. . . . .
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521848997 ISBN 13: 9780521848992
Seller: GoldBooks, Denver, CO, U.S.A.
Hardcover. Condition: new. New Copy. Customer Service Guaranteed.
Language: English
Published by Cambridge University Press, Cambridge, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases. This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. reprint edition. 383 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 53.29
Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 392.
Language: English
Published by Cambridge University Press, Cambridge, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases. This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-li.
Language: English
Published by Cambridge University Press, Cambridge, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases. This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.