Algorithms on strings, trees, and sequences : computer science and computational biology
Başlık:
Algorithms on strings, trees, and sequences : computer science and computational biology
ISBN:
9781139811736
9780511574931
9781107192140
9781139811484
9780511969652
9781283870795
9781139811606
Personal Author:
Yayın Bilgileri:
Cambridge [England] ; New York : Cambridge University Press, 1997.
Fiziksel Tanımlama:
1 online resource (xviii, 534 pages) : illustrations
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.
Abstract:
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.
Local Note:
WorldCat record variable field(s) change: 650
Subject Term:
Elektronik Erişim:
Full Text Available From eBooks on EBSCOhost
Dil:
English