Algorithms on strings, trees, and sequences : / Dan Gusfield.

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.

Gespeichert in:
Bibliographische Detailangaben
ParalleltitelAlgorithms on Strings, Trees & Sequences
1. Verfasser:in Gusfield, Dan (Verfasser:in)
Ort, Verlag, Jahr Cambridge : Cambridge University Press , 1997
Umfang1 online resource (xviii, 534 pages) : : digital, PDF file(s).
ISBN1-107-19214-5
1-139-81148-7
0-511-57493-2
1-139-81173-8
0-511-96965-1
1-283-87079-7
1-139-81160-6
SpracheEnglisch
Zusatzinfopt. 1. Exact string matching : the fundamental string problem -- pt. 2. Suffix trees and their uses -- pt. 3. Inexact matching, sequence alignment, dynamic programing -- pt. 4. Currents, cousins, and cameos.
ZusatzinfoEnglish
Online-ZugangEBSCO EBS 2024
Kauf EBS 2021 Cambridge ebooks

Bei Problemen beim Zugriff auf diese Online-Quelle beachten Sie unsere Hinweise zum Zugriff auf lizenzierte Angebote von außerhalb des Campus.