web site hit counter Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology - Ebooks PDF Online
Hot Best Seller

Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology

Availability: Ready to download

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure c String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.


Compare

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure c String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

18 review for Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology

  1. 5 out of 5

    Naes

  2. 4 out of 5

    John M. Battista

  3. 4 out of 5

    Seong-Kook Shin

  4. 5 out of 5

    Rado

  5. 4 out of 5

    Nikunj Singh

  6. 4 out of 5

    Ajay Mendez

  7. 5 out of 5

    Christopher Sean Grogan

  8. 5 out of 5

    Dmitry Mykhaylov

  9. 4 out of 5

    Bill Giles

  10. 4 out of 5

    Adalberto

  11. 5 out of 5

    Maria Antony

  12. 5 out of 5

    Marcus Maelstrom

  13. 5 out of 5

    Uli

  14. 5 out of 5

    Rachel Engel

  15. 5 out of 5

    David

  16. 4 out of 5

    George Erickson

  17. 5 out of 5

    Steven Chang

  18. 4 out of 5

    Jackson Eckert

Add a review

Your email address will not be published. Required fields are marked *

Loading...
We use cookies to give you the best online experience. By using our website you agree to our use of cookies in accordance with our cookie policy.