Amazon cover image
Image from Amazon.com

Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield.

By: Material type: TextTextPublication details: Cambridge [England] ; New York : Cambridge University Press, 1997.Description: 1 online resource (xviii, 534 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781139811736
  • 1139811738
  • 9780511574931
  • 0511574932
  • 1107192145
  • 9781107192140
  • 1139811487
  • 9781139811484
  • 0511969651
  • 9780511969652
  • 1283870797
  • 9781283870795
  • 1139811606
  • 9781139811606
Subject(s): Genre/Form: Additional physical formats: Print version:: Algorithms on strings, trees, and sequences.DDC classification:
  • 005.7/3 22
LOC classification:
  • QA76.9.A43 G87 1997eb
NLM classification:
  • 1997 I-920
  • QA 76.9.A43
Other classification:
  • 42.10
  • 54.10
  • ST 360
  • ST 630
  • WC 7000
  • WC 7700
  • BIO 110f
  • DAT 537f
Online resources:
Contents:
Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations.
Summary: 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.
Item type:
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Collection Call number Materials specified Status Date due Barcode
Electronic-Books Electronic-Books OPJGU Sonepat- Campus E-Books EBSCO Available

Includes bibliographical references (pages 505-523) and index.

Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations.

Print version record.

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.

English.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.

O.P. Jindal Global University, Sonepat-Narela Road, Sonepat, Haryana (India) - 131001

Send your feedback to glus@jgu.edu.in

Hosted, Implemented & Customized by: BestBookBuddies   |   Maintained by: Global Library