Bookbot

Ocena książki

Parametry

  • 392 strony
  • 14 godzin czytania

Więcej o książce

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. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.

Wydanie

Zakup książki

Algorithms on Strings, Maxime Crochemore, Christophe Hancart, Thierry Lecroq

Język
Rok wydania
2007
Oprawa
(twarda)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

4,4
Bardzo dobra
17 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
Algorithms on Strings
Język
angielski
Rok wydania
2007
Oprawa
twarda
Liczba stron
392
ISBN10
0521848997
ISBN13
9780521848992
Seria
Ocena
4,35 z 5
Opis
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. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.