Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield.
Gusfield, DanCall Number | 005.7/3 |
Author | Gusfield, Dan, author. |
Title | Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield. Algorithms on Strings, Trees & Sequences |
Physical Description | 1 online resource (xviii, 534 pages) : digital, PDF file(s). |
Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
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. |
Subject | COMPUTER ALGORITHMS. COMPUTATIONAL BIOLOGY. Molecular biology Data processing. |
Multimedia |
Total Ratings:
0
02368nam a2200373 i 4500
001
vtls001598819
003
VRT
005
20230127111600.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
230127s1997||||enk o ||1 0|eng|d
020
$a 9780511574931 (ebook)
020
$z 9780521585194 (hardback)
035
$a (UkCbUP)CR9780511574931
039
9
$y 202301271116 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA76.9.A43 $b G87 1997
082
0
0
$a 005.7/3 $2 21
100
1
$a Gusfield, Dan, $e author.
245
1
0
$a Algorithms on strings, trees, and sequences : $b computer science and computational biology / $c Dan Gusfield.
246
3
$a Algorithms on Strings, Trees & Sequences
264
1
$a Cambridge : $b Cambridge University Press, $c 1997.
300
$a 1 online resource (xviii, 534 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520
$a 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.
650
0
$a COMPUTER ALGORITHMS.
650
0
$a COMPUTATIONAL BIOLOGY.
650
0
$a Molecular biology $x Data processing.
776
0
8
$i Print version: $z 9780521585194
856
4
0
$u https://doi.org/10.1017/CBO9780511574931
999
$a VIRTUA
No Reviews to Display
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. |
Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
Subject | COMPUTER ALGORITHMS. COMPUTATIONAL BIOLOGY. Molecular biology Data processing. |
Multimedia |