Algorithms On Strings - Rilegato

Maxime Crochemore

Rilegato

ISBN 10: 0521848997 ISBN 13: 9780521848992

Casa editrice: New Publisher, 2021

Riassunto

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.

Su questo libro

Recensione:

'... perfect for lectures on 'stringology', for graduate students as a reference on the topic and for appliers in linguistic or molecular biology ...' Acta Scientiarum Mathematicarum

'This is a good book on string matching and other related algorithms, especially from the theoretical point of view. ... The material is well explained and the treatment of the subjects covered is quite complete. ... Overall, this book will be of interest to people doing research in combinatorial biology and computational linguistics.' Mathematical Reviews

Descrizione del libro:

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.

Su questa edizione

• Editore: New Publisher
• Data di pubblicazione: 2021
• ISBN 10: 0521848997
• ISBN 13: 9780521848992
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 392