000			03145cam a2200301 a 4500
008			080521s1997 nyua b 001 0 eng
010			_a96046612
020			_a0521585198
035			_a(Sirsi) u604
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a005.73 _2 22
100	1		_aGusfield, Dan. _911770
245	1	0	_aAlgorithms on strings, trees, and sequences : _b computer science and computational biology / _c Dan Gusfield.
260			_aCambridge [England] ; _a New York : _b Cambridge University Press, _c 1997.
300			_axviii, 534 p. : _b ill. ; _c 26 cm.
504			_aIncludes bibliographical references (p. 505-523) and index.
505	0		_aExact String Matching: The Fundamental String Problem -- Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Semi-numerical string matching -- Suffix Trees and their Uses: 5. Introduction to suffix trees -- Linear time construction of suffix -- First applications of suffix trees trees -- Constant time lowest common ancestor retrieval -- Inexact Matching, Sequence Alignment and Dynamic Programming -- 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 database and their uses: the motherlode -- Currents, Cousins and Cameos -- Maps, mapping, sequencing and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of genome-level mutations
520			_aString 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 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.
630	0	0	_aBioinformatics. _9475
630	0	0	_aCIT. _914
650		0	_aComputer algorithms. _911771
650		0	_aComputational biology. _9993
650		0	_aMolecular biology _x Data processing. _911772
596			_a1
999			_c4995 _d4995