ISBN: 9780521848992 - algorithms on strings hardback (19 resultados)

Condición: as new. Wie neu/Like new.

Condición: 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. …

Condición: New.

Condición: New.

Hardcover. Condición: new. New Copy. Customer Service Guaranteed.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Buch. Condición: 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.…

Condición: 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.…

Condición: 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. . . . .…

Condición: New. Print on Demand pp. 392.

Condición: New. Print on Demand pp. 392 Illus.

Condición: New. PRINT ON DEMAND pp. 392.

Hardcover. Condición: new. Hardcover. 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.…

Gebunden. Condición: 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.…

Buch. Condición: Neu. Algorithms on Strings | Maxime Crochemore (u. a.) | Buch | Gebunden | Englisch | 2010 | Cambridge University Press | EAN 9780521848992 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.